Fuzzy Matching
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).
Do you need to finding records in a data set that refer to the same entity across different data sources?
Fuzzy String Matching is the process of performing a human-like estimation of the similarity of two words or phrases. In many cases, it involves identifying words or phrases which are most similar to each other.More about Levenshtein distance and Soundex.
It’s free to repeatedly export up to 250 rows!
Join Tables based on approximately matching values (Levenshtein Distance)
Join Tables based on matching names by sound (Soundex)
