The forward-backward search algorithm
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 697-700 vol. 1
- https://doi.org/10.1109/icassp.1991.150435
Abstract
The authors introduce a technique that greatly speeds up expensive time-synchronous beam searches in speech recognition. The algorithm is called the forward-backward search and is mathematically related to the Baum-Welch forward-backward training algorithm. It uses a simplified forward pass followed by a detailed backward search. The information stored in the forward pass is used to decrease the computation in the backward pass by a large factor. An increase in speed of a factor of 40 with no increase in search errors was observed. The authors also describe how they have incorporated this algorithm into a real-time speaker-independent spoken language understanding system. One version of this is based on the 1000 word Resource Management vocabulary and is directed by a statistical class grammar. Another version has been incorporated into a military transportation planning application called DART (Dynamic Analysis Re-planning Tool).<>Keywords
This publication has 4 references indexed in Scilit:
- Constructing groups of acoustically confusable wordsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The N-best algorithms: an efficient and exact procedure for finding the N most likely sentence hypothesesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A comparison of several approximate algorithms for finding multiple (N-best) sentence hypothesesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A rapid match algorithm for continuous speech recognitionPublished by Association for Computational Linguistics (ACL) ,1990