Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An efficient augmented-context-free parsing algorithm
Computational Linguistics
Development of a programming environment for Setl
Proc. of the 1st European Software Engineering Conference on ESEC '87
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Communications of the ACM
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
Parsers and printers as stream destructors and constructors embedded in functional languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Substring parsing for arbitrary context-free grammars
ACM SIGPLAN Notices
Linear-time suffix parsing for deterministic languages
Journal of the ACM (JACM)
Yet another chart-based technique for parsing ill-formed input
ANLC '94 Proceedings of the fourth 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
Prefix probabilities from stochastic Tree Adjoining Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Chart parsing of robust grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A formal frame for robust parsing
Theoretical Computer Science - Implementation and application of automata
The information-processing difficulty of incremental parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Robust parsing using dynamic programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
String analysis as an abstract interpretation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Word segmentation, unknown-word resolution, and morphological agreement in a hebrew parsing system
Computational Linguistics
| Hi-index | 0.00 |
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts of unknown length. It produces in finite form all possible parses (often infinite in number) that could account for the missing parts. The algorithm is a variation on the construction due to Earley. However, its presentation is such that it can readily be adapted to any chart parsing schema (top-down, bottom-up, etc...).