Substring edit distance
Project description
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
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
subdist-0.2.1.tar.gz
(2.4 kB
view hashes)
Built Distributions
subdist-0.2.1.win32-py2.5.exe
(65.1 kB
view hashes)
subdist-0.2.1.win32-py2.4.exe
(64.6 kB
view hashes)