In coding, when ever you want to be smarter than comparing if 2 strings are perfectly equal ( “abc” == “abd” ? ) … like how much is the first string different from the 2nd (like if the user entered something with a typo) , you have the choices between several algorithms, each with pros and cons or made for special cases.
Well, this site is exactly for this: provide two sample strings and it will apply several algorithms and tell you the differences. Depending on the strings you want to identify,, in a couple of tests, you know the best algorithm and threshold to apply for your case. It tests all of these in one go and return a strings similarity percentage:
- Levenshtein
- NeedlemanWunch
- Smith-Waterman
- Smith-Waterman Gotoh
- Smith-Waterman Gotoh Windowed Affine
- Jaro
- Jaro Winkler
- QGrams Distance
- Block Distance
- Cosine Similarity
- Euclidean Distance
- Chapman Length Deviation
- Overlap Coefficient
(some being directly integrated in your favorite language, some needed external libraries or be coded by you)
Note: the site is behind a bot-blocking wall, Cloudflare-like, annoying, but nothing very special (except the ugly screenshot for us)
