data structures - Way to implement "Get all strings with Levenshtein distance less than X" -
i'm wondering whether there's efficient data structure perform "retrieve strings levenshtein distance less x".
few things i'm interested in:
- explanation of algorithm.
- is there existing implementation in existing database / programming langauge?
- paper / article can refer to?
this nearest neighborer search in metric space levenshtein distance metric (or distance) function
a vp-tree 1 of ways of solving problem
this python vp-tree implementation working demo shows how vp-tree works run on word list provides interactive shell type word , returns words in list no more x distance word typed
Comments
Post a Comment