Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
Experience with an extensible language
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
The predictive analyzer and a path elimination technique
Communications of the ACM
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract)
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Tree-size bounded alternation(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Formal development of correct algorithms: An example based on earley's recogniser
Proceedings of ACM conference on Proving assertions about programs
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
General context-free language recognition.
General context-free language recognition.
Determining the extent of lookahead in syntactic error repair
ACM Transactions on Programming Languages and Systems (TOPLAS)
ALIEN: a programming environment generator for personal computers
SIGSMALL '88 Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES
A parsing algorithm for unification grammar
Computational Linguistics
On Kilbury's modification of Earley's algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated message understanding—a real-world prototype
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
The BBN Spoken Language System
HLT '89 Proceedings of the workshop on Speech and Natural Language
HLT '91 Proceedings of the workshop on Speech and Natural Language
On deftly introducing procedural elements into unification parsing
HLT '90 Proceedings of the workshop on Speech and Natural Language
A bibliography on parallel parsing
ACM SIGPLAN Notices
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Linear-time suffix parsing for deterministic languages
Journal of the ACM (JACM)
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Pecan: Program development systems that support multiple views
ICSE '84 Proceedings of the 7th international conference on Software engineering
A forward move algorithm for LL and LR parsers
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
Crossroads
On the mathematical properties of linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Computation of the probability of initial substring generation by stochastic context-free grammars
Computational Linguistics
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
Computational Linguistics
Review of "Generalized LR parsing" by Masaru Tomita. Kluwer Academic Publishers 1991.
Computational Linguistics - Special issue on inheritance: II
Review of "The functional treatment of parsing" by René Leermakers. Kluwer Academic Publishers 1993.
Computational Linguistics
Fast context-free parsing requires fast Boolean matrix multiplication
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
On the mathematical properties of linguistic theories
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on 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
Gemini: a natural language system for spoken-language understanding
ACL '93 Proceedings of the 31st 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
Precise n-gram probabilities from stochastic context-free grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Interleaving syntax and semantics in an efficient bottom-up parser
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Some issues in parsing and natural language understanding
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Chart parsing and constraint programming
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The Primordial Soup Algorithm: a systematic approach to the specification of parallel parsers
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
An Earley-type recognizer for dependency grammar
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Pattern-based machine translation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Unification-based semantic interpretation in the BBN Spoken Language System
HLT '89 Proceedings of the workshop on Speech and Natural Language
Gemini: a natural language system for spoken-language understanding
HLT '93 Proceedings of the workshop on Human Language Technology
Offline Grammar-Based Recognition of Handwritten Sentences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Development in parsing technology: from theory to application
New developments in parsing technology
Improved left-corner chart parsing for large context-free grammars
New developments in parsing technology
New developments in parsing technology
Efficient parsing of highly ambiguous context-free grammars with bit vectors
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Efficient reconfigurable embedded parsers
Computer Languages, Systems and Structures
Rich bitext projection features for parse reranking
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Better binarization for the CKY parsing
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Journal of Artificial Intelligence Research
Phrase structure grammars and natural languages
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
An efficient context-free parsing algorithm for natural languages
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Parallel parsing for unification grammars
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
A platform for the automatic generation of attribute evaluation hardware systems
Computer Languages, Systems and Structures
IWSAS'01 Proceedings of the 2nd international conference on Self-adaptive software: applications
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Two monolingual parses are better than one (synchronous parse)
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
A probabilistic parser applied to software testing documents
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Top-down nearly-context-sensitive parsing
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Algorithmic aspects of natural language processing
Algorithms and theory of computation handbook
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Sparse RNA folding: Time and space efficient algorithms
Journal of Discrete Algorithms
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
An efficient hardware implementation for AI applications
SETN'06 Proceedings of the 4th Helenic conference on Advances in Artificial Intelligence
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Efficient matrix-encoded grammars and low latency parallelization strategies for CYK
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Parsing of partially bracketed structures for parse selection
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
A non-left-to-right, non-directional parser for ambiguous lattices
Pattern Recognition Letters
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A new algorithm for recognizing and parsing arbitrary context-free languages is presented, and several new results are given on the computational complexity of these problems. The new algorithm is of both practical and theoretical interest. It is conceptually simple and allows a variety of efficient implementations, which are worked out in detail. Two versions are given which run in faster than cubic time. Surprisingly close connections between the Cocke-Kasami-Younger and Earley algorithms are established which reveal that the two algorithms are “almost” identical.