CIGALE: A tool for interactive grammar construction and expression parsing
Science of Computer Programming
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
A recursive ascent Earley parser
Information Processing Letters
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
A Bottom-Up Adaption of Earley's Parsing Algorithm
PLILP '88 Proceedings of the 1st International Workshop on Programming Language Implementation and Logic Programming
Generalized left-corner parsing
EACL '93 Proceedings of the sixth 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
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The computational complexity of the correct-prefix property for TAGs
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
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Approximating context-free by rational transduction for example-based MT
DMMT '01 Proceedings of the workshop on Data-driven methods in machine translation - Volume 14
Improved left-corner chart parsing for large context-free grammars
New developments in parsing technology
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic parsing strategies
Journal of the ACM (JACM)
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Bidirectional push down automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
| Hi-index | 0.00 |
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular algorithms, and a parallel algorithm. We show that these algorithms are based on the same underlying ideas.By relating existing ideas, we hope to provide an opportunity to improve some algorithms based on features of others. A second purpose of this paper is to answer a question which has come up in the area of tabular parsing, namely how to obtain a parsing algorithm with the property that the table will contain as little entries as possible, but without the possibility that two entries represent the same subderivation.