Phonetic Matching is the process of matching data using Algorithms / functions that have been created focusing on how a word is pronounced rather than how it is spelt. Most of the popular phonetic matching algorithms are designed to work with the English language and do not perform as well with foreign languages. The other… Read More »
String Comparison Logic is used to analyse strings and determine how different these two strings are and what changes would be required to convert 1 string into the other. Two of the most popular string comparison functions are: Jaro-Winkler Levenshtein Distance These functions can be helpful to identify typing errors where letters are typed in… Read More »
Useful Links Wikipedia on Jaro-Winkler.
Metaphone is a much more modern phoentic algorithm for matching words based upon there English pronunciation, and is a significant advancement on Soundex. There has since been several iterations to the Metaphone Algorithm including Double Metaphone and MetaPhone 3. Again as with the Soundex example I will focus on real examples of using the Metaphone… Read More »
The Levenshtein Distance algorithm measures the amount of changes required to transform one string into another, essentially comparing 2 strings and returning a number representative of the number of characters needed to make both strings equal. For instance if you implemented a function Levenshtein(“American”, “American”) you would get the return value = 1. Useful Links Wikipedia on Levenshtein… Read More »
Soundex is a function designed to return a Phonetic Key for terms that are passed. I will not dwell too much on its heritage only to say that early incarnations were developed to assist in the matching of Peoples Names. See the Useful links below for more information about Soundex. Soundex is a very easy… Read More »