Back to University of Twente portal
Parallel on-line parsing in constant time per word
Sikkel, Klaas (1993) Parallel on-line parsing in constant time per word. Theoretical Computer Science, 120 (2). pp. 303-310. ISSN 0304-3975
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 464Kb |
| Abstract: | An on-line parser processes each word as soon as it is typed by the user, without waiting for the end of the sentence. Thus, in an interactive system, a sentence will be parsed almost immediately after the last word has been presented.
The complexity of an on-line parser is determined by the resources needed for the analysis of a single word, as it is assumed that previous words have been processed already. Sequential parsing algorithms like CYK or Earley need O(n2) time for the nth word. A parallel implementation in O(n) time on O(n) processors is straightforward. In this paper a novel parallel on-line parser is presented that needs O(1) time on O(n2) processors. |
| Item Type: | Article |
| Copyright: | © 1993 Elsevier Science |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/18047 |
| Official URL: | http://dx.doi.org/10.1016/0304-3975(93)90294-4 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page
Metis ID: 118566