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 code-book search, and uses the extended partial distortion method to compress the incomplete matching computations of widly 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.
|Number of pages||6|
|Journal||IEE Proceedings, Part I: Communications, Speech and Vision|
|Volume||136 pt 1|
|State||Published - 1 Dec 1989|