Abstract
Hidden Markov Models (HMM) is one the most common statistical matching methods used for speech recognition, especially for continuous speech utterances. One major problem in HMM is that the training process that aims to generate a set of HMM models (recognizer) for matching the speech source usually based on a set of limited training data. The Minimum Classification Error (MCE) training approach proposed by Juang [9] is regarded as a discriminative method that is proven to be superior to other traditional probability distribution estimation approaches, such as the Maximum likelihood (ML) approach. The main drawback in the MCE is to formulate the error rate estimate junction as a smooth loss junction for applying gradient search technique that subsequently leads to a local optimal solution. In this paper, a genetic algorithm based approach (GA-MCE) for the MCE is proposed to solve these problems. In our experiments, the results demonstrated that the GA-MCE is superior to the original MCE method. It can be also significantly increased the performance of voice input systems.
Original language | English |
---|---|
Title of host publication | 2000 26th Annual Conference of the IEEE Industrial Electronics Society |
Publisher | IEEE |
Pages | 1692-1695 |
Number of pages | 4 |
ISBN (Print) | 0780364562 |
DOIs | |
Publication status | Published - 2000 |
Externally published | Yes |
Event | 26th Annual Conference of the IEEE Electronics Society - Nagoya, Japan Duration: 22 Oct 2000 → 28 Oct 2000 |
Conference
Conference | 26th Annual Conference of the IEEE Electronics Society |
---|---|
Abbreviated title | IECON 2000 |
Country/Territory | Japan |
City | Nagoya |
Period | 22/10/00 → 28/10/00 |
Keywords
- Error analysis
- Genetic algorithms
- Hidden Markov models
- Inference algorithms
- Maximum likelihood estimation
- Parameter estimation
- Speech processing
- Speech recognition
- Training data
- Vocabulary