Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
Bidirectional context-free grammar parsing for natural language processing
Artificial Intelligence
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Probabilistic Languages: A Review and Some Open Questions
ACM Computing Surveys (CSUR)
An efficient context-free parsing algorithm
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
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An efficient implementation of the head-corner parser
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
Three generative, lexicalised models for statistical parsing
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Exploiting syntactic structure for language modeling
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Head automata and bilingual tiling: translation with minimal representations
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Statistical parsing with a context-free grammar and word statistics
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Are very large context-free grammars tractable?
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
| Hi-index | 0.00 |
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction of language models used in several state-of-the-art real-world parsers. We provide evidence that left-to-right parsing cannot be realised within acceptable time-bounds if the so called correct-prefix property is to be ensured. Our evidence is based on complexity results for the representation of regular languages.