This repository hosts implementations of two fuzzy search algorithms. One of them is based on the Levenshtein distance metric, a well-known algorithm for measuring the difference between two sequences.
The second algorithm, which is detailed in an accompanying article, offers a generic approach to fuzzy searching. You can find the article explaining its implementation here.
