Prolog and natural-language analysis
Prolog and natural-language analysis
Feature structures: a logical theory with application to language analysis
Feature structures: a logical theory with application to language analysis
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computational Complexity and Natural Language
Computational Complexity and Natural Language
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Formal languages and their relation to automata
Formal languages and their relation to automata
Unification encodings of grammatical notations
Computational Linguistics
Off-Line Parsability and the Well-Foundedness of Subsumption
Journal of Logic, Language and Information
Nonminimal derivations in unification-based parsing
Computational Linguistics
Prediction in chart parsing algorithms for Categorial Unification Grammar
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Maximizing top-down constraints for unification-based systems
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Top-down predictive linking and complex-feature-based formalisms
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Unification Grammars and Off-Line Parsability
Journal of Logic, Language and Information
Unification-based semantic interpretation in the BBN Spoken Language System
HLT '89 Proceedings of the workshop on Speech and Natural Language
Bottom-up context-sensitive algorithms for Bengali parser in natural language processing
International Journal of Knowledge-based and Intelligent Engineering Systems
| Hi-index | 0.00 |
We describe a table-driven parser for unification grammar that combines bottom-up construction of phrases with top-down filtering. This algorithm works on a class of grammars called depth-bounded grammars, and it is guaranteed to halt for any input string. Unlike many unification parsers, our algorithm works directly on a unification grammar---it does not require that we divide the grammar into a context-free "backbone" and a set of feature agreement constraints. We give a detailed proof of correctness. For the case of a pure bottom-up parser, our proof does not rely on the details of unification---it works for any pattern-matching technique that satisfies certain simple conditions.