Robust Estimation of Stocchastic Segment Models for Word Recognition (1990)
BibTeX
@MISC{Kannan90robustestimation,
author = {Ashvin Kannan and Mari Ostendorf and Bolt Beranek and Newman Inc},
title = {Robust Estimation of Stocchastic Segment Models for Word Recognition},
year = {1990}
}
OpenURL
Abstract
In this work, we develop robust estimation techniques for a continuous-word recognition system using the Stochastic Segment model (SSM). This work is done under the N-best rescoring formalism, where a less complex system than the SSM is used to generate candidate hypotheses which are then rescored and reranked by the SSM. Components of the system that are the focus of this work include estimation of weights for score combination and robust parameter estimation using clustering techniques to model context. In particular, we develop several agglomerative and divisive clustering techniques for multivariate Gaussian distributions, which we use to cluster triphone models. This leads to better estimates with fewer parameters resulting in reduction in word error and storage/computation costs over using unclustered triphones. We also implement an SSM system based on microsegments which combines mixture modeling with trajectory modeling and examine the tradeoffs involved between the allocation ...







