Isolated word recognition using the weighted Levenshtein distance

The use of dynamic programming in isolated word recognition is interpreted in terms of symbols-string processing. The use of the weighted Levenshtein distance (WLD) is discussed. A modification of the WLD gives insensitivity to overall word duration while automatically discriminating against warping functions having excessively steep and excessively gentle portions.