GitHub - vibes/levenshtein: Our (modified) version of the levenshtein gem for calculating edit distance

vibes / levenshtein Public

Notifications You must be signed in to change notification settings
Fork 1
Star 1

Our (modified) version of the levenshtein gem for calculating edit distance

Notifications

Name		Name	Last C5DC commit message	Last commit date
Latest commit History 2 Commits
ext/levenshtein		ext/levenshtein
lib		lib
test		test
CHANGELOG		CHANGELOG
Gemfile		Gemfile
Gemfile.lock		Gemfile.lock
LICENSE		LICENSE
README		README
VERSION		VERSION
levenshtein.gemspec		levenshtein.gemspec

Repository files navigation

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 .