dtw alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view dtw alternatives based on common mentions on social networks and blogs.

lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing 
editdistancelinear
Levenshtein edit distance in linear memory (also turns out to be faster than C++)
CodeRabbit: AI Code Reviews for Developers
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of dtw or a related project?
Popular Comparisons
README
This module implements dynamic time warping as described on Wikipedia
Additionally 'fastDtw' is implemented as described in the paper: "FastDTW: Toward Accurate Dynamic Time Warping in Linear Time and Space" by Stan Salvador and Philip Chan.
For further information see the documentation of the Data.DTW
module.
Example
>>>  create two sample datasets
>>> let as = [ sin x  x < [0,0.1..pi] ]
>>> let bs = [ sin (x+0.1)  x < [0,0.1..pi] ]
>>>  define a cost function between two datapoints
>>> let dist x y = abs (xy)
>>>  define a function that will half the size of a dataset (see below)
>>> let shrink xs = case xs of (a:b:cs) > (a+b)/2 : shrink cs; a:[] > [a]; [] > []
>>>  calculate the cost with fastDtw and dtwMemo for comparison
>>> cost $ fastDtw dist shrink 2 as bs :: Float
>>> 0.19879311
>>> cost $ dtwMemo (\x y > abs (xy)) as bs :: Float
>>> 0.19879311