Skip to main content

Substring edit distance

Project description

A C extension that uses a modified version of the Levenshtein distance algorithm to calculate fuzzy matches for substrings.

All strings used by the subdist module must be Unicode strings.

New in version 0.2

The get_score function returns match score [0.0, 1.0] of needle in haystack based on substring distance

Example

fuzzy substring distance for “bdb” in “aaa bbb ccc”

import subdist

needle = u"bdb"
haystack = u"aaa bbb ccc"
distance = subdist.substring(needle, haystack) # 1

Project details


Release history Release notifications

This version
History Node

0.2.1

History Node

0.2

History Node

0.1.1

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
subdist-0.2.1.tar.gz (2.4 kB) Copy SHA256 hash SHA256 Source None Dec 16, 2007
subdist-0.2.1.win32-py2.4.exe (64.6 kB) Copy SHA256 hash SHA256 Windows Installer 2.4 Dec 16, 2007
subdist-0.2.1.win32-py2.5.exe (65.1 kB) Copy SHA256 hash SHA256 Windows Installer 2.5 Dec 16, 2007

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page