Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/624061A2-DE86-4C51-8F91-D6558D8AF145 | ||
| Year | 1999 | ||
| Type of Item | Peer-Reviewed Journal Publication | ||
| License |
|
||
| Bibliographic Citation | V. Digalakis, "Online adaptation of hidden Markov models using incremental estimation algorithms," IEEE Trans. Speech Audio Process., vol. 7, no. 3, pp. 253-261, May 1999. doi:10.1109/89.759031 https://doi.org/10.1109/89.759031 | ||
| Appears in Collections |
The mismatch that frequently occurs between the training and testing conditions of an automatic speech recognizer can be efficiently reduced by adapting the parameters of the recognizer to the testing conditions. Two measures that characterize the performance of an adaptation algorithm are the speed with which it adapts to the new conditions, and its computational complexity, which is important for online applications. A family of adaptation algorithms for continuous-density hidden Markov model (HMM) based speech recognizers have appeared that are based on constrained reestimation of the distribution parameters. These algorithms are fast, in the sense that a small amount of data is required for adaptation. They are, however, based on reestimating the model parameters using the batch version of the expectation-maximization (EM) algorithm. The multiple iterations required for the EM algorithm to converge make these adaptation schemes computationally expensive and not suitable for online applications, since multiple passes through the adaptation data are required. We show how incremental versions of the EM and the segmental k-means algorithm can be used to improve the convergence of these adaptation methods, reduce the computational requirements, and make them suitable for online applications
Copyright © DIAS 2013
