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:
These functions can be helpful to identify typing errors where letters are typed in the wrong sequence, for example ‘Micorsoft’ versus ‘Microsoft’.
String comparison functions are often complex, and may require intensive processing so can slow down the performance of any matching solution when used on significant volumes of data.
Note that using this type of algorithm on smaller strings can be problematic for example ‘Sean’ would be very similar to ‘Saen’ which could be a typo but it also could be very similar to ‘Dean’ which is not.
Phonetic Matching Algorithms are often preferred because they focus on pronunciation.