Re: [RFR] python-levenshtein Description [ITP]
Nicolas François wrote:
> I would appreciate if you could review the python-levenshtein Description:
>
> Description: Python extension computing string distances and similarities
Description: Python extension for computing edit distances
I'm assuming that "similarities" follow automatically.
> Levenshtein computes Levenshtein distances, similarity ratios, generalized
"Levenshtein" in this context doesn't mean Vladimir Iosifovich
himself, so:
The Levenshtein {extension,module,library} computes [...]
> medians and set medians of Strings and Unicodes. Because it's implemented
This is probably obvious to Pythonists, but are "Strings" and
"Unicodes" Python entities of some sort, or do you mean something
like "of ASCII or Unicode strings"?
Also: I happen to be familiar with Levenshtein algorithms and so on,
but most users aren't, and I'm not sure about developers. Would it
be worth mentioning that these are useful for spellcheckers and so
on?
> in C, it's much faster than corresponding Python library functions and
> methods. ^
"Than the corresponding".
--
JBR with qualifications in linguistics, experience as a Debian
sysadmin, and probably no clue about this particular package
Reply to: