A collection of approximate string matching algorithms

This library contains algorithms dealing with approximate string matching. These algorithms can be used to tell the approximate difference between two strings. This is usful for a varity of things like spell checking, fuzzy search, etc.

Algorithms

• Levenshtein distance
• Damerau–Levenshtein distance
• Hamming distance
• Sift3 distance