Minimum Edit Distance
Minimum Edit Distance in Cython
This provides String Distance functions in Cython.
With these metrics smaller is better.
levenshtein(1 for insert, 1 for delete, and 1 for substitution)
levenshtein_no_sub(1 for insert, 1 for delete, 2 for substitution)
brew(0.1 for insert, 15 for delete, and 1 for substitution)
dameran_levenshtein(1 for insert, 1 for delete, 1 for substitution, 1 for transposition)
With these metrics Larger is better.
Extending and rolling your own cost functions
There are 2 kinds of functions used to define costs for the dynamic programming minimum edit distance algorithm. The first is
ctypedef int (*cmp_func)(int c1, int c2) which is used to compare two characters and return a cost. The second is
ctypedef int (*char_func)(int c1, int c2). By implementing your own versions of these functions (I would recommned doing it in cost.pxd and inline'ing the function) you can pass them to the distance solver to implement your own weighting scheme. The
cmp_func can be used to weight a substitution (for example a low cost to letter next to each other on the keyboard like
e and high cost to far keys like
char_func can can be used to weight the insert or delete, for example you could weight inserts by their scabble scores.
Release history Release notifications | RSS feed
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size string_distance-1.0.0.tar.gz (495.3 kB)||File type Source||Python version None||Upload date||Hashes View|