ASR2000 - Automatic Speech Recognition: Challenges for the new Millenium September 18-20, 2000 Paris, France

The Block-Synchronous Search Algorithm

Peter Stubley

Locus Dialogue, Montréal, Québec, Canada

Multiple-pass searches have many advantages, including the combination of the speed of small models with the accuracy of large models. In their simplest implementations, the later passes cannot begin until the first pass completes at the end of the utterance. This work describes a block-synchronous approach to multiple-pass searches, where the utterance is partitioned into fixed-length blocks. All search passes run on the current block before the next block is processed. The algorithm uses bounded memory and bounded delay after the utterance completes, since the blocks are of fixed length. There is no requirement to estimate phrase or word boundaries to limit the processing.

Full Paper (PDF)   Full Paper (Zipped Postscript)

Bibliographic reference.  Stubley, Peter (2000): "The block-synchronous search algorithm", In ASR-2000, 29-34.