Third International Conference on Spoken Language Processing (ICSLP 94)

Yokohama, Japan
September 18-22, 1994

Fast Match for Segment-Based Large Vocabulary Continuous Speech Recognition

Michael Phillips, David Goddeau

Spoken Language Systems Group, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

This paper describes the use of a lexical tree based lookahead for reducing the computation needed by the lexical search stage of a segment-based speech recognition system. In the MIT SUMMIT system, a network representing possible phonetic interpretations of the signal is generated before the lexical search is performed. This allows the use of a fairly simple tree-based lookahead in order to find a reduced set of words which may be allowed to start at any point in time. The first N phones in the pronunciations of all words in the lexicon are collapsed into a tree and this tree is matched against the segment network using a pruning threshold to determine a subset of words which may start at each node in the segment network. We describe the computational needs of the system, explains the lookahead in more detail, and shows the tradeoffs between computation and accuracy.

Full Paper

Bibliographic reference.  Phillips, Michael / Goddeau, David (1994): "Fast match for segment-based large vocabulary continuous speech recognition", In ICSLP-1994, 1359-1362.