Skip to main content

pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.

Project description

pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. Courtesy Wikipedia:

In information theory and computer science, the Damerau-Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a “distance” (string metric) between two strings, i.e., finite sequence of symbols, given by counting the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters.

This implementation is based on Michael Homer’s pure Python implementation. It runs in O(N*M) time using O(M) space. It supports unicode characters.

For more information on pyxDamerauLevenshtein, visit the GitHub project page.

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

pyxDamerauLevenshtein-1.3.2.tar.gz (51.4 kB view details)

Uploaded Source

File details

Details for the file pyxDamerauLevenshtein-1.3.2.tar.gz.

File metadata

File hashes

Hashes for pyxDamerauLevenshtein-1.3.2.tar.gz
Algorithm Hash digest
SHA256 83f342e2841fdbfadd8eef20631bd4d40a29ab9f92b066e51e6d20dacea7798e
MD5 0e4f6cd43611232f6a30b6453d315c89
BLAKE2b-256 bcdcc59436e1b7657fd3491347b2dcbd58eaf95fef449f3b9994d3ae40bd883c

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page