A parsing algorithm for unification grammar
Computational Linguistics
Semantic-head-driven generation
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
Natural Language Processing for PROLOG Programmers
Natural Language Processing for PROLOG Programmers
Natural Language Processing in LISP: An Introduction to Computational Linguistics
Natural Language Processing in LISP: An Introduction to Computational Linguistics
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
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
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
QPATR and constraint threading
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A lexical functional grammar system in PROLOG
COLING '86 Proceedings of the 11th coference on Computational linguistics
| Hi-index | 0.00 |
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algorithms to the possibly infinite domain of feature structures. A technique is proposed which is designed specifically for left-recursive categories and is based on the generalization of their occurrences in a derivation. Particular attention is drawn to the top-down predictive character of the linking relation and to its significance not only as a filter for increasing the efficiency of syntactic analysis but as a device for the top-down instantiation of information, which then serves as a key to the directed analysis of inflected forms as well as "unknown" or "new" words.