Compose-reduce parsing

Authors:
Henry S. Thompson;Mike Dixon;John Lamping
Affiliations:
University of Edinburgh, Edinburgh, Scotland;Xerox Palo Alto Research Center, Palo Alto, CA;Xerox Palo Alto Research Center, Palo Alto, CA
Venue:
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Year:
1991

Citing 4
Cited 4

Massive parallel assumption-based truth maintenance

Proceedings of the 2nd international workshop on Non-monotonic reasoning
The predictive analyzer and a path elimination technique

Communications of the ACM
Natural Language Processing in LISP: An Introduction to Computational Linguistics

Natural Language Processing in LISP: An Introduction to Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2

A bibliography on parallel parsing

ACM SIGPLAN Notices
Incremental interpretation: applications, theory, and relationship to dynamic semantics

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Left-corner parsing and psychological plausibility

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Incremental, predictive parsing with psycholinguistically motivated tree-adjoining grammar

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two new parsing algorithms for context-free phrase structure grammars are presented which perform a bounded amount of processing per word per analysis path, independently of sentence length. They are thus capable of parsing in real-time in a parallel implementation which forks processors in response to non-deterministic choice points.