Exact alpha-beta computation in logarithmic space with application to MAP word graph construction

Abstract

The classical dynamic programming recursions for the forwards-backwards and Viterbi HMM algorithms are linear in the number of time frames being processed. Adapting the method of [8] to the context of speech recognition, this paper uses a recursive divide-andconquer algorithm to reduce the space requirement to logarithmic in the number of frames. With this… (More)

Topics

5 Figures and Tables

Cite this paper

@inproceedings{Zweig2000ExactAC, title={Exact alpha-beta computation in logarithmic space with application to MAP word graph construction}, author={Geoffrey Zweig and Mukund Padmanabhan}, booktitle={INTERSPEECH}, year={2000} }