The module does pretty much exactly that: https://github.com/readbeyond/aeneas/blob/master/aeneas/dtw.py
It finds the best path for DTW, but I'm quite unfamiliar with Python... What's a straightforward way of extracting a distance score using this module?
EDIT: I've adapted the script to output the sum of min. cost at each step in the cost matrix. The results appear sensible (file against itself very low cost score, again random different word very high cost) but I wonder if it's the correct approach.