A recursive ascent Earley parser
Information Processing Letters
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
CommandTalk: a spoken-language interface for battlefield simulations
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Generalized left-corner parsing
EACL '93 Proceedings of the sixth 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
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Efficient matrix-encoded grammars and low latency parallelization strategies for CYK
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We develop an improved form of left-corner chart parsing for large context-free grammars, introducing improvements that result in significant speed-ups compared to previously-known variants of left-corner parsing. We also compare our method to several other major parsing approaches, and find that our improved left-comer parsing method outperforms each of these across a range of grammars. In addition, we describe a new technique for minimizing the extra information needed to efficiently recover parses from the data structures built in the course of parsing.