Two Equivalent Regularizations for Tree Adjoining Grammars
From MaRDI portal
Publication:3618604
DOI10.1007/978-3-642-00982-2_40zbMath1234.68181MaRDI QIDQ3618604
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
68Q42: Grammars and rewriting systems
Related Items
Cites Work
- Unnamed Item
- Tree adjunct grammars
- IO and OI. I
- IO and OI. II
- Syntactic structures as multi-dimensional trees
- wMSO theories as grammar formalisms
- Spinal-formed context-free tree grammars
- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
- Two Equivalent Regularizations for Tree Adjoining Grammars