We present a new view of hidden Markov model (HMM) state tying, showing that the accuracy of phonetically tied mixture (PTM) models is similar to, or better than, that of the more typical stateclustered HMM systems. The PTM models require fewer Gaussian distance computations during recognition, and can lead to recognition speedups. We describe a perphone Gaussian clustering algorithm that automatically determines the number of Gaussians for each phone in the PTM model. Experimental results show that this method gives a substantial decrease in the number of Gaussians and a corresponding speedup with little degradation in accuracy. Finally, we study mixture weight thresholding algorithms to drastically decrease the number of mixture weights in the PTM model without degrading accuracy. More than a factor of 10 reduction in mixture weights is achieved with no degradation in performance.
Cite as: Sankar, A., Rao Gadde, V.R. (1999) Parameter tying and gaussian clustering for faster, better, and smaller speech recognition. Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999), 1711-1714, doi: 10.21437/Eurospeech.1999-308
@inproceedings{sankar99_eurospeech,
author={Ananth Sankar and Venkata Ramana {Rao Gadde}},
title={{Parameter tying and gaussian clustering for faster, better, and smaller speech recognition}},
year=1999,
booktitle={Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999)},
pages={1711--1714},
doi={10.21437/Eurospeech.1999-308}
}