Parallel parsing of spoken language

Abstract

The authors extended H. Maruyama's (1990) constraint dependency grammar (CDG) to process a lattice of sentence hypotheses instead of separate test strings. A postprocessor to a speech recognizer producing N-best hypotheses generates the word lattice representation, which is then augmented with information required for parsing. The authors summarize the CDG parsing algorithm and describe how the algorithm is extended to process the lattice on a single processor machine. They outline the CRCW P-RAM algorithm for parsing the word lattice, which requires O(n/sup 4/) processors to parse in O(k+n) time.<>