Fuzzy searching, Name Variant and Metaphone options for name fields
Fuzzy searching compares each word in the name searched for with each word in the names in the index using the Levenshtein distance formula. A score of half the number of letters in the word or greater is considered a match. The Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance). It is often used in applications that need to determine how similar, or different, two strings are.
We are now able to offer a name variants thesaurus based on the NameX library. Metaphone options are available as standard libraries specifically developed for name matching and are also utilised.