Skip to main content
This is a pre-production deployment of Warehouse. Changes made here affect the production instance of PyPI (
Help us improve Python packaging - Donate today!

Limited-but-faster computation of Levenshtein distance

Project Description

The fastcomp is an efficient algorithm for computing (Damerau-) Levenshtein distance up to two.

Given two strings of length m and n (m <= n), the computation requires O(1) space and O(n) time, which is much smaller and faster than well-known Wagner-Fisher algorithm.

Release History

This version
History Node


History Node


Download Files

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

Filename, Size & Hash SHA256 Hash Help File Type Python Version Upload Date
(1.6 kB) Copy SHA256 Hash SHA256
Source None Aug 24, 2016

Supported By

Elastic Elastic Search Pingdom Pingdom Monitoring Dyn Dyn DNS Sentry Sentry Error Logging CloudAMQP CloudAMQP RabbitMQ Heroku Heroku PaaS Kabu Creative Kabu Creative UX & Design Fastly Fastly CDN DigiCert DigiCert EV Certificate Google Google Cloud Servers