Compose-Reduce Parsing

Henry S. Thompson; Michael Dixon; John Lamping

doi:10.3115/981344.981356

Compose-Reduce Parsing

Henry S. Thompson, Michael Dixon, John Lamping

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Publisher	Association for Computational Linguistics (ACL)
Pages	87-97
Number of pages	11
DOIs	https://doi.org/10.3115/981344.981356
Publication status	Published - 1991

Access to Document

10.3115/981344.981356

http://dl.acm.org/citation.cfm?doid=981344.981356

Cite this

@inproceedings{929aa026757b4ebdb4d1e214ba4e107d,

title = "Compose-Reduce Parsing",

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.",

author = "Thompson, {Henry S.} and Michael Dixon and John Lamping",

year = "1991",

doi = "10.3115/981344.981356",

language = "English",

pages = "87--97",

booktitle = "ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics",

publisher = "Association for Computational Linguistics (ACL)",

}

TY - GEN

T1 - Compose-Reduce Parsing

AU - Thompson, Henry S.

AU - Dixon, Michael

AU - Lamping, John

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

U2 - 10.3115/981344.981356

DO - 10.3115/981344.981356

M3 - Conference contribution

SP - 87

EP - 97

BT - ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics

PB - Association for Computational Linguistics (ACL)

ER -