Matthew E. Dunnachie’s scientific contributions

A program for generating Hidden Markov Models to be used for speech recognition with a given speech recognition system, the information storage medium storing a program, that renders a computer to function as a scheduled-to-be-used model group storage section that stores a scheduled-to-be-used model group including a plurality of Hidden Markov Models scheduled to be used by the given speech recognition system, and a filler model generation section that generates Hidden Markov Models to be used as filler models by the given speech recognition system based on all or at least a part of the Hidden Markov Model group in the scheduled-to-be-used model group.

In Automatic Speech Recognition (ASR), the presence of Out Of Vocabulary (OOV) words or sounds, within the speech signal, can have a detrimental effect on recognition performance. One common method of solving this problem is to use filler models to absorb the unwanted OOV utterances. A balance between accepting In Vocabulary (IV) words and rejecting OOV words can be achieved by manipulating the values of Word Insertion Penalty and Filler Insertion Penalty. This paper investigates the ability of three different classes of HMM filler models, K-Means, Mean and Baum- Welch, to discriminate between IV and OOV words. The results show that using the Baum-Welch trained HMMs 97.0% accuracy is possible for keyword IV acceptance and OOV rejection. The K-Means filler models provide the highest IV acceptance score of 97.3% but lower overall accuracy. However, the computational complexity of the K- Means algorithm is significantly lower and requires no additional speech training data.