Bottom-up parallelization of Tomita's algorithm

Nicolaas Sikkel

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

    32 Downloads (Pure)


    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
    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
    ISSN (Print)0924-3755


    Workshop1st Twente Workshop on Language Technology, TWLT 1
    Abbreviated titleTWLT


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

    Cite this