| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anyfin (0) - 8 freq anyhin (1) - 69 freq anyfink (1) - 3 freq an-in (2) - 1 freq anywan (2) - 28 freq anyhing (2) - 33 freq ajynin (2) - 1 freq onyyin (2) - 1 freq anythn (2) - 1 freq sayfin (2) - 1 freq antrin (2) - 67 freq onyin (2) - 1 freq antnin (2) - 1 freq anglin (2) - 2 freq anyun (2) - 1 freq enyhin (2) - 1 freq knypin (2) - 4 freq onyhin (2) - 23 freq affin (2) - 2 freq anyt'n (2) - 1 freq anythin (2) - 145 freq anywiy (2) - 8 freq anytime (3) - 29 freq dyein (3) - 1 freq affil (3) - 7 freq |
anyfin (0) - 8 freq anyfink (2) - 3 freq anyhin (2) - 69 freq anyun (3) - 1 freq onyin (3) - 1 freq onyhin (3) - 23 freq unifyin (3) - 1 freq sayfin (3) - 1 freq affin (3) - 2 freq enyhin (3) - 1 freq an-in (3) - 1 freq onyyin (3) - 1 freq anywan (3) - 28 freq annan (4) - 4 freq ann (4) - 105 freq foofin (4) - 1 freq angina (4) - 3 freq nin (4) - 1 freq anof (4) - 4 freq enjyin (4) - 2 freq ingin (4) - 18 freq nuin (4) - 14 freq roofin (4) - 1 freq endin (4) - 43 freq nasin (4) - 1 freq |
SoundEx code - A515 ambient - 1 freq anyfin - 8 freq ambience - 4 freq anyfink - 3 freq amabam - 2 freq amffmz - 1 freq ampandrew - 1 freq amfmon - 1 freq |
MetaPhone code - ANFN anyfin - 8 freq |
ANYFIN |
| Time to execute Levenshtein function - 0.198565 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.394438 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.028310 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039987 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000885 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |