Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Our (modified) version of the levenshtein gem for calculating edit distance
C Ruby
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
ext/levenshtein
lib
test
CHANGELOG
Gemfile
Gemfile.lock
LICENSE
README
VERSION
levenshtein.gemspec

README

The Levenshtein distance is a metric for measuring the amount of difference
between two sequences (i.e., the so called edit distance). The Levenshtein
distance between two sequences is given by the minimum number of operations
needed to transform one sequence into the other, where an operation is an
insertion, deletion, or substitution of a single element.

The two sequences can be two strings, two arrays, or two other objects.
Strings, arrays and arrays of strings are handled with optimized (very fast) C
code. All other sequences are handled with generic (fast) C code.

More information about the Levenshtein distance algorithm:
http://en.wikipedia.org/wiki/Levenshtein_distance .
Something went wrong with that request. Please try again.