Experimental comparison among data compression techniques in isolated word recognition

It is well known that the isolated word recognition strategy based on pattern matching gives good performance; however, in order to achieve efficient implementation it is necessary to develop techniques to reduce computational complexity and memory requirements, especially when the vocabulary size is not very small. In this work three different pattern compression techniques are compared on the basis of efficiency as well as recognition performance when applied to pattern matching by means of dynamic programming in a speaker dependent context.