The method dates from 1999 and is an evolution of Jaro’s method (1989). Raffael Vogler gives a good overview of the different techniques available in the “stringdist” package for R. There are, of course, other methods of calculating similarity. Damereau Levenshtein similarity (the same as the distance even bounded between 0 and 1).What I like about Anatella is that unlike other ETLs, it offers you a choice of 4 methods: There are many methods for calculating the similarity between 2 entities. In the case study that I propose to you, the fuzzy matching is performed on a join key that contains country names. If, on the other hand, you are in the 2nd case (or simply curious), I wish you happy reading. If you’re in the blessed case of the first situation, please proceed, this article won’t teach you anything. Either your join key follows precisely the same nomenclature in both tables, or it does not. When you want to make a join between several tables, you have 2 solutions. As you will see, an algorithm emerges as the winner of the confrontation. In today’s article, I explore the different Fuzzy Matching algorithms available in this tool and their effects. Tableau Prep Builder did not achieve the desired result. I had then compared 2 ETL (Extract Transform Load) solutions. In a previous article, I shared with you a solution to make a fuzzy matching between 2 different tables. Posted By Pierre-Nicolas Schwab on 19 Jun, 2020