Abstract
A new parallel parsing algorithm is described, based on Tomita's generalized LR parser and related to a well-known parallel version of Barley's algorithm. It uses a pipeline of processors, one for every word in the sentence. Each processor parses alt constituents starting with its "own" word. While constructing such a partial parse, constituents that have been parsed by other processors higher up the pipeline may be used as terminal symbols.
| Original language | English |
|---|---|
| Title of host publication | Tomita's Algorithm - Extensions and Applications |
| Subtitle of host publication | Proceedings of the First Twente Workshop on Language Technology (TWLT1) |
| Editors | R. Heemels, A. Nijholt, K. Sikkel |
| Place of Publication | Enschede |
| Publisher | University of Twente |
| Pages | 95-103 |
| Number of pages | 9 |
| Publication status | Published - 1991 |
| Event | 1st Twente Workshop on Language Technology, TWLT 1: Tomita's Algorithm: Extensions and Applications - Enschede, Netherlands Duration: 22 Mar 1991 → 22 Mar 1991 Conference number: 1 |
Publication series
| Name | Memoranda informatica |
|---|---|
| Publisher | University of Twente |
| Number | 91-68 |
| ISSN (Print) | 0924-3755 |
Workshop
| Workshop | 1st Twente Workshop on Language Technology, TWLT 1 |
|---|---|
| Abbreviated title | TWLT |
| Country/Territory | Netherlands |
| City | Enschede |
| Period | 22/03/91 → 22/03/91 |