Word extracts based on Damerau Levenshtein Distance

[acerock6]

Hi, Thanks for the Trie implementation in Python along with string matching based on Hamming and Levenshtein distance. Wonderful (since couldn't find a simpler way to get string matches using Trie)
Is it possible to also include Damerau-Levenshtein distance measure with a parameter for edit distance, since almost all the spell correct solutions use DL distance measure to get suggestion candidates from a dictionary?
Happy to work on it if needed :)

[jfjlaros]

I am not sure this will fit.

What worries me is that it is possible to edit the same substring more than once when using the DL distance. It seems to me that this is only possible by altering the trie or by forwarding some information in the recursive trie traversal.

I will give it some more thought.