IEE Proceedings I Communications Speech and Vision · 1989 · 32 citations · 13 references
ComputingComputer ScienceComputational LinguisticsMachine LearningNatural Language ProcessingData CompressionPattern RecognitionSearching AlgorithmsSpeech RecognitionMatching With Incomplete InformationMemory SpaceSpeech Pattern RecognitionVector Quantization
This paper presents a fast search algorithm for vector quantisation (VQ)-based recognition of isolated words. It incorporates the property of high correlation between speech feature vectors of consecutive frames with the method of triangular inequality elimination to relieve the computational burden of vector-quantising the test feature vectors by full codebook search, and uses the extended partial distortion method to compress the incomplete matching computations of wildly mismatched words. Overall computational load can therefore be drastically reduced while the recognition performance of full search can be retained. Experimental results show that about 93% of multiplications and additions can be saved with a little increase of both comparisons and memory space.
13
An introduction to hidden Markov models
L. R. Rabiner, Biing‐Hwang Juang · IEEE ASSP Magazine · 1986 · 4.8K citations
Robert M. Gray · Elsevier eBooks · 1984 · 2.4K citations · Full text