An efficient context-free parsing algorithm
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Chart parsing and rule schemata in PSG
ACL '81 Proceedings of the 19th 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
Parsing with flexibility, dynamic strategies, and idioms in mind
Computational Linguistics
Left-to-right parsing and bilexical context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Generalized left-corner parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Bottom-up parsing extending context-freeness in a Process Grammar processor
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
A syntactic and morphological analyzer for a text-to-speech system
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
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
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Improved left-corner chart parsing for large context-free grammars
New developments in parsing technology
Formal properties and implementation of bidirectional charts
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
An environment for experimentation with parsing strategies
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
A tabular method for island-driven context-free grammar parsing
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.01 |
Currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a back-bone, e.g. LFG and PATR-II. Typically the processing of these formalisms is organized within a chart-parsing framework. The declarative character of the formalisms makes it important to decide upon an overall optimal control strategy on the part of the processor. In particular, this brings the rule-invocation strategy into critical focus: to gain maximal processing efficiency, one has to determine the best way of putting the rules to use. The aim of this paper is to provide a survey and a practical comparison of fundamental rule-invocation strategies within context-free chart parsing.