|
Abstract : |
We have extended Maruyama's [4, 2, 3] constraint dependency grammar (CDG) to process a lattice of sentence hypotheses instead of separate text strings. A post-processor to a speech recognizer producing N-best hypotheses generates the word lattice representation, which is then augmented with information required for parsing. We will first summarize the CDG parsing algorithm and then describe how the algorithm is extended to process the lattice on a single processor machine. Finally, we outline the CRCW P-RAM algorithm for parsing the word lattice, which requires O(n, |
