Two Equivalent Regularizations for Tree Adjoining Grammars

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

• 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

zbMATH Keywords

regularizationliftingtree adjoining grammarmulti-dimensional trees

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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)

• 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)