An efficient context-free parsing algorithm
Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A proposal for modifications in the formalism of GPSG
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A comparison of rule-invocation strategies in context-free chart parsing
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Category cooccurrence restrictions and the elimination of metarules
COLING '86 Proceedings of the 11th coference on Computational linguistics
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
QPATR and constraint threading
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Bottom-Up Filtering: a parsing strategy for GPSG
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
GPSG parsing, bidirectional charts, and connection graphs
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes two parsing algorithms that interpret it. CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other current syntax formalisms. The use of CCRs leads to syntactic descriptions formulated entirely with restrictive statements. The paper shows how conventional algorithms for the analysis of context free languages can be adapted to the CCR formalism. Special attention is given to the part of the parser that checks the fulfillment of logical well-formedness conditions on trees.