subdist Substring edit distance A C extension that uses a modified version of the Levenshtein distance algorithm to calculate fuzzy matches for substrings. All strings used by the subdist module must be Unicode strings. New in version 0.2 ------------------- The get_score function returns match score [0.0, 1.0] of needle in haystack based on substring distance Example ------------------ **fuzzy substring distance for "bdb" in "aaa bbb ccc"** :: import subdist needle = u"bdb" haystack = u"aaa bbb ccc" distance = subdist.substring(needle, haystack) # 1 http://ginstrom.com/code/subdist-0.2.1.tar.gz Ryan Ginstrom ffffb3e02726f4b1501b71fe302a12d693ea966b 0.2.1