Two Equivalent Regularizations for Tree Adjoining Grammars
From MaRDI portal
Publication:3618604
DOI10.1007/978-3-642-00982-2_40zbMATH Open1234.68181OpenAlexW2153627808MaRDI QIDQ3618604FDOQ3618604
Authors: Anna Kasprzik
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_40
Recommendations
Cites Work
- Title not available (Why is that?)
- IO and OI. II
- Tree adjunct grammars
- IO and OI. I
- Syntactic structures as multi-dimensional trees
- wMSO theories as grammar formalisms
- Spinal-formed context-free tree grammars
- Two Equivalent Regularizations for Tree Adjoining Grammars
- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
Cited In (2)
This page was built for publication: Two Equivalent Regularizations for Tree Adjoining Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618604)