Parallel level-building on a tree machine (speech recognition)
Allen L. Gorin, David B. Roe · 2003
The authors describe a parallel frame-synchronous level-building algorithm, utilizing HMM word-models, for connected-speech recognition on a tree-structured parallel computer. The algorithm is scalable in the sense that the source code and execution time remain essentially the same as vocabulary size increases, so long as the hardware is scaled proportionally. An illustrative sizing and timing analysis of a speaker-independent connected-digit recognizer on the ASPEN tree-machine is described. This algorithm executes in real-time and achieves 98.3% string accuracy on the Texas Instruments digit data base.>