In this paper we focus on the anti-phoneme modelling part of segment-based speech recognition, where we have to distinguish the real phonemes from anything else which may appear (like parts of phonemes, several consecutive phonemes and noise). As it has to be performed while only having samples of the correct phonemes, it is an example of one-class classification. To solve this problem, first all phonemes are modelled with a number of Gaussian distributions; then the problem is converted into a two-class classification task by generating counter-examples; this way some machine learning algorithm (like ANNs) can be used to separate the two classes. We tested two methods for a counter-example generation like this: one was a solution specific to the anti-phoneme problem, while the other used a general algorithm. By making modifications to the latter to reduce its time requirements, we were able to achieve an improvement in the recognition scores of over 60% compared to having no anti-phoneme model at all, and it performed considerably better than the other two methods.
[1]
Heekuck Oh,et al.
Neural Networks for Pattern Recognition
,
1993,
Adv. Comput..
[2]
Gábor Gosztolya,et al.
Telephone Speech Recognition via the Combination of Knowledge Sources in a Segmental Speech Model
,
2004,
Acta Cybern..
[3]
Roger K. Moore.
Computer Speech and Language
,
1986
.
[4]
Richard O. Duda,et al.
Pattern classification and scene analysis
,
1974,
A Wiley-Interscience publication.
[5]
Joost N. Kok.
Machine Learning: ECML 2007, 18th European Conference on Machine Learning, Warsaw, Poland, September 17-21, 2007, Proceedings
,
2007,
ECML.
[6]
James R. Glass.
A probabilistic framework for segment-based speech recognition
,
2003,
Comput. Speech Lang..
[7]
Bernhard Schölkopf,et al.
Estimating the Support of a High-Dimensional Distribution
,
2001,
Neural Computation.
[8]
András Kocsor,et al.
Counter-Example Generation-Based One-Class Classification
,
2007,
ECML.