抄録
We propose a novel algorithm for connected word recognition. We introduce the overlap and split of reference patterns in matching them to portions of a test pattern. As a result, recognition errors due to coarticulation, word shortening and silence between words, which are inherent in connected speech, are reduced. Experiments with Japanese 4-digit strings (8 speakers × 350 strings) show that our method obtains better scores of recognition accuracy (as much as 7.85 %) than that obtained by Sakoe's two-level DP-matching algorithm.
