Computational cost of DP algorithms in speech recognition

Publisher Website
Google Scholar
Abstract
In this study we present the models of computation of several search algorithms for isolated word recognition. These search techniques considered include variants of the classical dynamic programming, variants of branch-and-bound search technique and variants of the beam search technique (as implemented in the Harpy system). We show that depending on the choice of the technique and related parameters, one can achieve more than an order of magnitude improvement in speed without any loss of accuracy.

This publication has 0 references indexed in Scilit: