Algorithm schemata and data structures in syntactic processing
Readings in natural language processing
Practical parsing of generalized phrase structure grammars
Computational Linguistics
Category cooccurrence restrictions and the elimination of metarules
COLING '86 Proceedings of the 11th coference on Computational linguistics
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
A constructive view of GPSG or how to make it work
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Parsing with Category Coocurrence Restrictions
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Island parsing and bidirectional charts
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
This paper describes a tractable method for parsing GPSG grammars without altering the modularity and expressiveness of this formalism. The proposed method is based on a constraint propagation mechanism which reduces the number of unnecessary structures built at parse time through the early detection of inadmissible local trees. The propagation of constraints is rendered efficient by indexing constraints and categories in a connection graph and by using a bidirectional chart parser together with a bottom-up strategy centered around head constituents.