A parsing algorithm for unification grammar
Computational Linguistics
The logic of typed feature structures
The logic of typed feature structures
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Off-Line Parsability and the Well-Foundedness of Subsumption
Journal of Logic, Language and Information
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Guaranteeing parsing termination of unification grammars
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Highly constrained unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Highly Constrained Unification Grammars
Journal of Logic, Language and Information
Polyadic Dynamic Logics for HPSG Parsing
Journal of Logic, Language and Information
Intelligent Processing of an Unrestricted Text in First Order String Calculus
Transactions on Computational Science V
| Hi-index | 0.00 |
Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undecidable whether w 驴 L(G). In order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (OLP), were suggested, such that the recognition problem is decidable for grammars which satisfy OLP. An open question is whether it is decidable if a given grammar satisfies OLP. In this paper we investigate various definitions of OLP and discuss their interrelations, proving that some of the OLP variants are indeed undecidable. We then present a novel, decidable OLP constraint which is more liberal than the existing decidable ones.