Paper: The Primordial Soup Algorithm A Systematic Approach To The Specification Of Parallel Parsers

ACL ID C92-1058
Title The Primordial Soup Algorithm A Systematic Approach To The Specification Of Parallel Parsers
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1992
Authors

A general framework for parallel parsing is pre- sented, which allows for a unitied, systematic approach to parallel parsing. The l'rimordial Soup Algorithm creates trees by alh)wing par- tial 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 pars- ing strategy algorithms for various machine ar- chitectures can be derived in a systematic way.