alla flaggor
jessie  ] [  stretch  ] [  buster  ] [  bullseye  ] [  sid  ]
[ Källkod: python-levenshtein  ]

Paket: python-levenshtein (0.12.0-2 och andra)

Länkar för python-levenshtein



Hämta källkodspaketet python-levenshtein:


Externa resurser:

Liknande paket:

extension for computing string similarities and edit distances

The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods.

The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another.

It is useful for spell checking, or fuzzy matching of gettext messages.

Märken: Software Development: Python Development, Implemented in: C, Role: Shared Library, Scope: scope::utility, use::measuring, Purpose: Searching, Works with: Text

Andra paket besläktade med python-levenshtein

  • beror
  • rekommenderar
  • föreslår
  • enhances

Hämta python-levenshtein

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Version Paketstorlek Installerad storlek Filer
armel 0.12.0-2+b2 33,0 kbyte125,0 kbyte [filförteckning]