Two Equivalent Regularizations for Tree Adjoining Grammars

DOI10.1007/978-3-642-00982-2_40MaRDI QIDQ3618604zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

regularizationliftingtree adjoining grammarmulti-dimensional trees

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 475427
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• scientific article; zbMATH DE number 1941335
• A model theoretic description of tree adjoining grammars
• scientific article; zbMATH DE number 1104362

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
• IO and OI. I
• IO and OI. II
• Spinal-formed context-free tree grammars
• Syntactic structures as multi-dimensional trees
• Tree adjunct grammars
• Two Equivalent Regularizations for Tree Adjoining Grammars
• wMSO theories as grammar formalisms

Cited in

(2)

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Two Equivalent Regularizations for Tree Adjoining Grammars

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)