Abstract
A general framework for parallel parsing is presented, which allows for a unitied, systematic approach to parallel parsing. The Primordial Soup Algorithm creates trees by allowing partial parse trees to combine arbitrarily. By adding constraints to the general algorithm, a large, class of parallel parsing strategies can be detined. This is exemplified by CYK, (hot, torn up) Earley and
de Vreught & Honig parsers. From such a parsing strategy algorithms for various machine architectures can be derived in a systematic way.
Original language | English |
---|---|
Title of host publication | COLING-92 |
Subtitle of host publication | Proceedings of the fifteenth International Conference on Computational Linguistics |
Editors | Ch. Boitot |
Publisher | Association for Computational Linguistics (ACL) |
Pages | 373-379 |
Number of pages | 7 |
DOIs | |
Publication status | Published - 23 Aug 1992 |
Event | 14th International Conference on Computational Linguistics, COLING 1992 - Nantes, France Duration: 23 Aug 1992 → 28 Aug 1992 Conference number: 14 |
Conference
Conference | 14th International Conference on Computational Linguistics, COLING 1992 |
---|---|
Abbreviated title | COLING |
Country/Territory | France |
City | Nantes |
Period | 23/08/92 → 28/08/92 |