Not Logged In
subdist 0.2.1
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
| File | Type | Py Version | Uploaded on | Size | # downloads |
|---|---|---|---|---|---|
| subdist-0.2.1.win32-py2.4.exe (md5) | MS Windows installer | 2.4 | 2007-12-16 08:34:59 | 63KB | 67 |
| subdist-0.2.1.win32-py2.5.exe (md5) | MS Windows installer | 2.5 | 2007-12-16 08:35:25 | 63KB | 101 |
|
subdist-0.2.1.tar.gz
(md5)
Includes unit tests |
Source | 2007-12-16 08:35:47 | 2KB | 168 | |
- Author: Ryan Ginstrom <software at ginstrom com>
- Home Page: http://www.ginstrom.com/code/subdist.html
- Download URL: http://ginstrom.com/code/subdist-0.2.1.tar.gz
- Keywords: Levenshtein distance substring fuzzy
- License: MIT
- Categories
- Package Index Owner: ginstrom
- DOAP record: subdist-0.2.1.xml
Log in to rate this package.