https://github.com/tliff/levenshtein

https://github.com/tliff/levenshtein

Last synced: about 2 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/tliff/levenshtein
• Owner: tliff
• License: other
• Created: 2010-02-23T11:47:20.000Z (over 14 years ago)
• Default Branch: master
• Last Pushed: 2014-01-19T12:45:45.000Z (over 10 years ago)
• Last Synced: 2024-05-02T11:13:36.112Z (5 months ago)
• Language: C
• Homepage:
• Size: 145 KB
• Stars: 7
• Watchers: 2
• 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 .