Unification grammars and off-line parsability

DOI10.1007/s10849-005-4511-1zbMath1075.68040OpenAlexW2066155289MaRDI QIDQ1777374

Shuly Wintner, Nissim Francez, Efrat Jaeger

Publication date: 13 May 2005

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

Full work available at URL: https://doi.org/10.1007/s10849-005-4511-1

zbMATH Keywords

unification grammarsoff-line parsabilityparsing termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Polyadic dynamic logics for HPSG parsing ⋮ Highly constrained unification grammars

Cites Work

• Unnamed Item
• Off-line parsability and the well-foundedness of subsumption
• The Logic of Typed Feature Structures

This page was built for publication: Unification grammars and off-line parsability