| Trees | Indices | Help | 
 | 
|---|
|  | 
A class to calculate a similarity based on the Levenshtein distance. See http://en.wikipedia.org/wiki/Levenshtein_distance.
If available, the python-Levenshtein package will be used which will provide better performance as it is implemented natively. See http://trific.ath.cx/python/levenshtein/
| 
 | |||
| LevenshteinComparer | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 Calculates the distance for use in similarity calculation. Python version. | 
| 
 Same as python_distance in functionality. This uses the fast C version if we detected it earlier. Note that this does not support arbitrary sequence types, but only string types. | 
| 
 Same as python_distance in functionality. This uses the fast C version if we detected it earlier. Note that this does not support arbitrary sequence types, but only string types. | 
| Trees | Indices | Help | 
 | 
|---|
| Generated by Epydoc 3.0.1 on Wed Mar 26 12:49:26 2008 | http://epydoc.sourceforge.net |