Scientific Symposium on Syntax and Semantics on Natural Language at the Computer
Scientific Symposium on Syntax and Semantics on Natural Language at the Computer
Scientific Symposium on Syntax and Semantics on Natural Language at the Computer
An efficient context-free parsing algorithm
Communications of the ACM
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
Computational Complexity and Natural Language
Computational Complexity and Natural Language
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Computational complexity of current GPSG theory
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
On the mathematical properties of linguistic theories
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Parsing with Category Coocurrence Restrictions
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Using active constraints to parse GPSGs
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A chart-based method of ID/LP parsing with generalized discrimination networks
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
From shallow to deep parsing using constraint satisfaction
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
In this paper, we propose an optimized strategy, called Bottom-Up Filtering, for parsing GPSGs. This strategy is based on a particular, high level, interpretation of GPSGs. It permits a significant reduction of the non-determinism inherent to the rule selection process.