@inbook{55e285e89a584218b75a645c5487b555,
title = "Massively Parallel Parsing Algorithms for Natural Language",
abstract = "Massively parallel algorithms are described for parsing with Tree Adjoining Grammar (TAG), a formalism for describing natural language. Sequential parsing algorithms for TAGs run in time quadratic in the grammar size, which is impractical for the very large grammars currently being developed for natural language. This paper presents two parallel algorithms, one running in time nearly linear in the grammar size, and the other running in time logarithmic in the grammar size. Both parallel algorithms were implemented on a Connection Machine CM-2 and performance measurements were obtained for varying grammar sizes.",
author = "Palis, {Michael A.} and Wei, {David S.L.}",
year = "1994",
month = jan,
day = "1",
doi = "10.1016/B978-0-444-81704-4.50020-X",
language = "English (US)",
series = "Machine Intelligence and Pattern Recognition",
number = "C",
pages = "365--407",
booktitle = "Machine Intelligence and Pattern Recognition",
edition = "C",
}