The Primordial Soup Algorithm : a systematic approach to the specification of parallel parsers

Wil Janssen, Mannes Poel, Klaas Sikkel, Job Zwiers

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    36 Downloads (Pure)


    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 languageEnglish
    Title of host publicationCOLING-92
    Subtitle of host publicationProceedings of the fifteenth International Conference on Computational Linguistics
    EditorsCh. Boitot
    PublisherAssociation for Computational Linguistics (ACL)
    Number of pages7
    Publication statusPublished - 23 Aug 1992
    Event14th International Conference on Computational Linguistics, COLING 1992 - Nantes, France
    Duration: 23 Aug 199228 Aug 1992
    Conference number: 14


    Conference14th International Conference on Computational Linguistics, COLING 1992
    Abbreviated titleCOLING

    Cite this