jfjlaros / dict-trie Goto Github PK

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 :)

Is there a way to retrieve all keys matching a prefix?

I see there's a has_prefix method and a private _find method for doing general searching, but there's no way to access it to get the keys found in has_prefix. Am I missing something?