Highly constrained unification grammars

DOI10.1007/S10849-008-9062-9zbMATH Open1172.68056OpenAlexW2042633642MaRDI QIDQ1024820FDOQ1024820

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)

Cites Work

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

Cited In (6)

• Unification grammars.
• Highly constrained unification grammars
• Feature-constraint logics for unification grammars
• “Syntactic” AC-unification
• Conjunctive Grammars Can Generate Non-regular Unary Languages
• Uniquely parsable unification grammars and their parser implemented in Prolog

This page was built for publication: Highly constrained unification grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024820)