A COMPARATIVE-STUDY OF SEVERAL DYNAMIC TIME-WARPING ALGORITHMS FOR CONNECTED-WORD RECOGNITION
A COMPARATIVE-STUDY OF SEVERAL DYNAMIC TIME-WARPING ALGORITHMS FOR CONNECTED-WORD RECOGNITION
复制标题
DOI：
10.1002/j.1538-7305.1981.tb00272.x
复制
发表时间：
1981-01-01
影响因子：
--
通讯作者：
RABINER, LR
中科院分区：
文献类型：
--
作者：
MYERS, CS;RABINER, LR
Several different algorithms have been proposed for time registering a test pattern and a concatenated (isolated word) sequence of reference patterns for automatic connected‐word recognition. These algorithms include the two‐level, dynamic programming algorithm, the sampling approach and the level‐building approach. In this paper, we discuss the theoretical differences and similarities among the various algorithms. An experimental comparison of these algorithms for a connected‐digit recognition task is also given. The comparison shows that for typical applications, the level‐building algorithm performs better than either the two‐leveldp‐matching or the sampling algorithm.
