Prolog and natural-language analysis
Prolog and natural-language analysis
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
A lexical functional grammar system in PROLOG
COLING '86 Proceedings of the 11th coference on Computational linguistics
Parsing with Category Coocurrence Restrictions
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Top-down predictive linking and complex-feature-based formalisms
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
QPATR is an MS-DOS Arity/PROLOG implementation of the PATR-II formalism for unification grammar. The formalism has been extended to include the constraints of LFG as well as negation and disjunction, which are implemented with the disjunction and negation-as-failure of PROLOG itself. A technique of constraint threading is employed to collect negative and constraining conditions in PROLOG difference lists. The parser of QPATR uses a left-corner algorithm for context-free grammars and includes a facility for identifying new lexical items in input on the basis of contextual information.