Incorporating Syntax into the Parallel Level-Building Algorithm on a Tree-Structured Parallel Computer
23 May 1989
In this paper, we continue our investigations into the parallel computation of large-vocabulary speech recognition on a tree-structured parallel computer. In particular, we address the computational structures necessary for efficient execution of a syntax-directed level-building connected- word recognizer based on whole-word HMMS. The feasibility of these ideas are demonstrated and evaluated via a benchmark study of the 1000-word DARPA Resource Management recognizer on the ASPEN tree-machine.