This paper extends the use of weighted cepstral distance measures to speaker independent word recognizers based on vector quantization. Recognition results were obtained for two recognition methods: dynamic timewarping of vector codes and hidden Markov modeling. The experiments were carried out on a vocabulary of the ten digits and the word "oh". Two kinds of spectral analysis were considered: LPC, and a recently proposed, low dimensional, perceptually based representation (PLP). The effects of analysis order and varying degrees of quantization in the spectral representation were also considered. Recognition experiments indicate that the performance of the weighted cepstral distance with vector quantized spectral data is considerably different from that previously reported for unquantized data. Comparison of recognition rates shows wide variations due to interaction of the distance measure with the analysis technique and with vector quantization. The best recognition scores were obtained by the combination of weighted cepstral distance and low order PLP analysis. This combination maintained good recognition rates down to very low (16 or 8 codes) codebook sizes.
[1]
S. C. Glinski.
On the use of vector quantization for connected-digit recognition
,
1985,
AT&T Technical Journal.
[2]
Brian A. Hanson,et al.
Spectral slope distance measures with linear prediction analysis for word recognition in noise
,
1987,
IEEE Trans. Acoust. Speech Signal Process..
[3]
Hynek Hermansky,et al.
Low-dimensional representation of vowels based on all-pole modeling in the psychophysical domain
,
1985,
Speech Commun..
[4]
S. Furui,et al.
Isolated word recognition using strings of phoneme-like templates (SPLIT)
,
1984
.
[5]
Kuldip K. Paliwal,et al.
On the performance of the quefrency-weighted cepstral coefficients in vowel recognition
,
1982,
Speech Commun..
[6]
T.H. Crystal,et al.
Linear prediction of speech
,
1977,
Proceedings of the IEEE.