Fuzzy Search

The function finds substrings of a reference string that match a pattern string approximately

Function fzsearch(r,p,n,case) finds the best or predetermined approximate matching between substrings of a string r (reference) and a string p (pattern). The Levenshtein distance is used as a measure of matching. Levenshtein distance is the minimum number of single-character substitutions, deletions and insertions required to convert string A to string B. It is possible to search both for case sensitive and insensitive.
Results of a search are a distance of matching and indices of the ends of reference substrings. For the best match, the function allows to determine also the substrings themselves.