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