Bottom-up parallelization of Tomita's algorithm

Nicolaas Sikkel

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

    11 Downloads (Pure)

    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 languageEnglish
    Title of host publicationTomita's Algorithm - Extensions and Applications
    Subtitle of host publicationProceedings of the First Twente Workshop on Language Technology (TWLT1)
    EditorsR. Heemels, A. Nijholt, K. Sikkel
    Place of PublicationEnschede
    PublisherUniversity of Twente
    Pages95-103
    Number of pages9
    Publication statusPublished - 1991
    Event1st Twente Workshop on Language Technology, TWLT 1: Tomita's Algorithm: Extensions and Applications - Enschede, Netherlands
    Duration: 22 Mar 199122 Mar 1991
    Conference number: 1

    Publication series

    NameMemoranda informatica
    PublisherUniversity of Twente
    Number91-68
    ISSN (Print)0924-3755

    Workshop

    Workshop1st Twente Workshop on Language Technology, TWLT 1
    Abbreviated titleTWLT
    CountryNetherlands
    CityEnschede
    Period22/03/9122/03/91

    Fingerprint Dive into the research topics of 'Bottom-up parallelization of Tomita's algorithm'. Together they form a unique fingerprint.

  • Cite this

    Sikkel, N. (1991). Bottom-up parallelization of Tomita's algorithm. In R. Heemels, A. Nijholt, & K. Sikkel (Eds.), Tomita's Algorithm - Extensions and Applications: Proceedings of the First Twente Workshop on Language Technology (TWLT1) (pp. 95-103). (Memoranda informatica; No. 91-68). Enschede: University of Twente.