Maximum likelihood linear regression for speaker adaptation of continuous density hidden Markov models

✍ Scribed by C.J. Leggetter; P.C. Woodland

• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 148 KB
• Volume: 9
• Category: Article
• ISSN: 0885-2308
• DOI: 10.1006/csla.1995.0010

✦ Synopsis

A method of speaker adaptation for continuous density hidden Markov models (HMMs) is presented. An initial speaker-independent system is adapted to improve the modelling of a new speaker by updating the HMM parameters. Statistics are gathered from the available adaptation data and used to calculate a linear regressionbased transformation for the mean vectors. The transformation matrices are calculated to maximize the likelihood of the adaptation data and can be implemented using the forward-backward algorithm. By tying the transformations among a number of distributions, adaptation can be performed for distributions which are not represented in the training data. An important feature of the method is that arbitrary adaptation data can be used-no special enrolment sentences are needed.

Experiments have been performed on the ARPA RM1 database using an HMM system with cross-word triphones and mixture Gaussian output distributions. Results show that adaptation can be performed using as little as 11 s of adaptation data, and that as more data is used the adaptation performance improves. For example, using 40 adaptation utterances, a 37% reduction in error from the speakerindependent system was achieved with supervised adaptation and a 32% reduction in unsupervised mode.