Description: This algorithm is based on the idea of dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, in simple terms, is by building an adjacency matrix, find the shortest path and.
To Search:
File list (Check if you may need any files):
dtw.c
Download