Highly constrained unification grammars

DOI10.1007/s10849-008-9062-9zbMath1172.68056OpenAlexW2042633642MaRDI QIDQ1024820

Shuly Wintner, Daniel Feinstein

Publication date: 17 June 2009

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-008-9062-9

zbMATH Keywords

mildly context-sensitive languagesgenerative capacitylinear indexed grammarsunification grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Related Items (1)

Highly constrained unification grammars

Cites Work

• Highly constrained unification grammars
• A geometric hierarchy beyond context-free languages
• Tree adjunct grammars
• Unification grammars and off-line parsability
• The equivalence of four extensions of context-free grammars
• Welfare Economics and Robinson Crusoe the Producer

This page was built for publication: Highly constrained unification grammars