Compose-Reduce Parsing

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
PublisherAssociation for Computational Linguistics (ACL)
Number of pages11
Publication statusPublished - 1991

Cite this