No abstract

No abstract

No abstract

The technique of dynamic time warping for time registration of a reference and test utterance has found widespread use in the area of discrete word recognition. As originally proposed, the algorithm placed strong constraints on the possible set of dynamic paths—namely, it was assumed that the initial and final frames of both the test and reference utterances were in exact time synchrony. Because of inherent practical difficulties with satisfying the assumptions under which the above constraints are valid, we have considered some modifications to the dynamic time-warping algorithm. In particular an algorithm in which an uncertainty exists in the registration both for initial and final frames was studied. Another modification constrains the dynamic path to follow (within a given range) the path which is locally minimum at each frame. This modification tends to work well when the location of the final frame of the test utterance is significantly in error due to breath noise, etc. To test the different time warping algorithms a set of 10 isolated words spoken by 100 speakers was used. Several different comparisons between the algorithms were made and will be described in the talk.

No abstract