Polynomially parsable unification grammars

DOI10.1093/LOGCOM/EXT013MaRDI QIDQ3450205zbMATH OpenOpenAlexFDO

Authors Hadas Peled, Shuly Wintner

Publication date 3 November 2015

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/ext013

zbMATH Keywords

parsingrange concatenation grammarunification grammarsuniversal recognition problem

Mathematics Subject Classification ID

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

Recommendations

• Highly constrained unification grammars
• Uniquely parsable unification grammars and their parser implemented in Prolog
• Unification grammars and off-line parsability
• Unification grammars.
• scientific article; zbMATH DE number 1948985

Cited in

(20)

• Highly constrained unification grammars
• A formal approach to subgrammar extraction for NLP
• Finite-state unification automata and relational languages
• On the semantics of unification grammars
• Unification grammars and off-line parsability
• Uniquely parsable unification grammars and their parser implemented in Prolog
• A hierarchy of uniquely parsable grammar classes and deterministic acceptors
• Unification grammars.
• scientific article; zbMATH DE number 4051037 (Why is no real title available?)
• scientific article; zbMATH DE number 43017 (Why is no real title available?)
• scientific article; zbMATH DE number 549987 (Why is no real title available?)
• scientific article; zbMATH DE number 1948985 (Why is no real title available?)
• An approach to functional formal models of constraint-based lexicalized grammar
• Primal grammars and unification modulo a binary clause
• Learning and parsing stochastic unification-based grammars.
• scientific article; zbMATH DE number 2243358 (Why is no real title available?)
• Mechanizing Mathematical Reasoning
• A graph unification machine for NL parsing
• The expressivity of autosegmental grammars
• Associative grammar combination operators for tree-based grammars

This page was built for publication: Polynomially parsable unification grammars

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