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.2.tar.gz (27.3 kB view details)

Uploaded Source

File details

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

File metadata

File hashes

Hashes for pyxDamerauLevenshtein-1.2.tar.gz
Algorithm Hash digest
SHA256 ee7eec3bc311e3a7ff48883d36094d3947c5901add0efc389228f01c81e9996b
MD5 004926f47544100734fe18194e556b23
BLAKE2b-256 11c165f7e8523a000661143b5b0fa9cf7263a1fc6b1ae7b791fd74eb2a0082eb

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