Interactively join rows across files or sheets using fuzzy matching rules.
join rows using Levenshtein Distance
Levenshtein Distance (or edit distance) between two strings is the number of single-character deletions, insertions, or substitutions required to transform source string into target string.
identify homophones with Soundex
Soundex phonetic algorithm indexes strings based on their English pronunciation. The algorithm is used to identify homophones (words that are pronounced the same, but spelled differently).