Source: python-levenshtein Section: python Priority: optional Maintainer: Sandro Tosi Uploaders: Debian Python Team , Build-Depends: debhelper-compat (= 13), dh-python, python3-all-dbg, python3-all-dev, python3-setuptools, Standards-Version: 4.5.1 Homepage: https://github.com/ztane/python-Levenshtein Vcs-Git: https://salsa.debian.org/python-team/packages/python-levenshtein.git Vcs-Browser: https://salsa.debian.org/python-team/packages/python-levenshtein Package: python3-levenshtein Architecture: any Depends: ${misc:Depends}, ${python3:Depends}, ${shlibs:Depends}, Description: extension for computing string similarities and edit distances (Python 3) 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. . This package contains Levenshtein for Python 3. Package: python3-levenshtein-dbg Section: debug Architecture: any Depends: python3-levenshtein (= ${binary:Version}), ${misc:Depends}, ${python3:Depends}, ${shlibs:Depends}, Multi-Arch: same Description: extension for computing string similarities and edit distances(py3k debug ext) 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. . This package contains the extensions built for the Python 3 debug interpreter.