https://github.com/rf-/levenshtein-19
1.9-compatible version of the Levenshtein gem
https://github.com/rf-/levenshtein-19
Last synced: about 1 year ago
JSON representation
1.9-compatible version of the Levenshtein gem
- Host: GitHub
- URL: https://github.com/rf-/levenshtein-19
- Owner: rf-
- License: other
- Created: 2011-11-21T02:41:55.000Z (over 14 years ago)
- Default Branch: master
- Last Pushed: 2013-02-12T00:20:37.000Z (over 13 years ago)
- Last Synced: 2025-03-09T01:13:36.836Z (over 1 year ago)
- Language: C
- Homepage:
- Size: 105 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README
- Changelog: CHANGELOG
- License: LICENSE
Awesome Lists containing this project
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 .
NOTE: This gem was written by Erik Veenstra. I have made slight modifications
to it for compatibility with Ruby 1.9.