Transition network grammars for natural language analysis
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
A syntax directed compiler for ALGOL 60
Communications of the ACM
Conceptual Information Processing
Conceptual Information Processing
Understanding Natural Language
Understanding Natural Language
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A design for a parser for English
ACM '76 Proceedings of the 1976 annual conference
TINLAP '75 Proceedings of the 1975 workshop on Theoretical issues in natural language processing
Syntactic graphs: a representation for the union of all ambiguous parse trees
Computational Linguistics
Stroing logical form in a shared-packed forest
Computational Linguistics
Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
An improved left-corner parsing algorithm
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
Text knowledge bases: University of Texas at Austin
ACM SIGART Bulletin
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
It is desirable for a parser to be able to extend a phrase even after it has been combined into a larger syntactic unit. This paper presents an algorithm that does this in two ways, one dealing with "right extension" and the other with "left recursion". A brief comparison with other parsing algorithms shows it to be related to the left-corner parsing algorithm, but it is more flexible in the order that it permits phrases to be combined. It has many of the properties of the sentence analyzers of Marcus and Riesbeck, but is independent of the language theories on which those programs are based.