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

Wil Janssen; Mannes Poel; Klaas Sikkel; Job Zwiers

doi:10.3115/992066.992127

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 proceeding › Conference contribution › Academic › peer-review

64 Downloads (Pure)

Abstract

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 language	English
Title of host publication	COLING-92
Subtitle of host publication	Proceedings of the fifteenth International Conference on Computational Linguistics
Editors	Ch. Boitot
Publisher	Association for Computational Linguistics (ACL)
Pages	373-379
Number of pages	7
DOIs	https://doi.org/10.3115/992066.992127
Publication status	Published - 23 Aug 1992
Event	14th International Conference on Computational Linguistics, COLING 1992 - Nantes, France Duration: 23 Aug 1992 → 28 Aug 1992 Conference number: 14

Conference

Conference	14th International Conference on Computational Linguistics, COLING 1992
Abbreviated title	COLING
Country/Territory	France
City	Nantes
Period	23/08/92 → 28/08/92

Access to Document

10.3115/992066.992127

Janssen1992primordialFinal published version, 489 KB

Cite this

@inproceedings{2b98142ec1124639b674e072cf5823b5,

title = "The Primordial Soup Algorithm: a systematic approach to the specification of parallel parsers",

abstract = "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.",

author = "Wil Janssen and Mannes Poel and Klaas Sikkel and Job Zwiers",

year = "1992",

month = aug,

day = "23",

doi = "10.3115/992066.992127",

language = "English",

pages = "373--379",

editor = "Ch. Boitot",

booktitle = "COLING-92",

publisher = "Association for Computational Linguistics (ACL)",

address = "United States",

note = "14th International Conference on Computational Linguistics, COLING 1992, COLING ; Conference date: 23-08-1992 Through 28-08-1992",

}

Janssen, W, Poel, M, Sikkel, K & Zwiers, J 1992, The Primordial Soup Algorithm: a systematic approach to the specification of parallel parsers. in C Boitot (ed.), COLING-92: Proceedings of the fifteenth International Conference on Computational Linguistics. Association for Computational Linguistics (ACL), pp. 373-379, 14th International Conference on Computational Linguistics, COLING 1992, Nantes, France, 23/08/92. https://doi.org/10.3115/992066.992127

The Primordial Soup Algorithm : a systematic approach to the specification of parallel parsers. / Janssen, Wil; Poel, Mannes; Sikkel, Klaas et al.

COLING-92: Proceedings of the fifteenth International Conference on Computational Linguistics. ed. / Ch. Boitot. Association for Computational Linguistics (ACL), 1992. p. 373-379.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The Primordial Soup Algorithm

T2 - 14th International Conference on Computational Linguistics, COLING 1992

AU - Janssen, Wil

AU - Poel, Mannes

AU - Sikkel, Klaas

AU - Zwiers, Job

N1 - Conference code: 14

PY - 1992/8/23

Y1 - 1992/8/23

N2 - 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.

AB - 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.

U2 - 10.3115/992066.992127

DO - 10.3115/992066.992127

M3 - Conference contribution

SP - 373

EP - 379

BT - COLING-92

A2 - Boitot, Ch.

PB - Association for Computational Linguistics (ACL)

Y2 - 23 August 1992 through 28 August 1992

ER -

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

Abstract

Conference

Access to Document

Fingerprint

Cite this