| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yamils (0) - 1 freq mails (2) - 3 freq kamile (2) - 37 freq ails (2) - 9 freq wails (2) - 6 freq kamil (2) - 1 freq hamilt (2) - 1 freq yalls (2) - 2 freq hamil (2) - 2 freq damies (2) - 1 freq yais (2) - 1 freq camels (2) - 4 freq amids (2) - 1 freq amiss (2) - 16 freq yakies (2) - 1 freq family (2) - 329 freq fabils (2) - 2 freq yammas (2) - 1 freq yaila (2) - 1 freq rails (2) - 16 freq hails (2) - 6 freq pails (2) - 14 freq tamil (2) - 1 freq nails (2) - 80 freq fails (2) - 20 freq |
yamils (0) - 1 freq mails (2) - 3 freq pails (3) - 14 freq hails (3) - 6 freq yammas (3) - 1 freq nails (3) - 80 freq rails (3) - 16 freq jails (3) - 1 freq mls (3) - 2 freq muils (3) - 2 freq tails (3) - 54 freq miles (3) - 173 freq fails (3) - 20 freq sails (3) - 39 freq emails (3) - 14 freq wails (3) - 6 freq yalls (3) - 2 freq ails (3) - 9 freq camels (3) - 4 freq amiss (3) - 16 freq amids (3) - 1 freq mills (4) - 33 freq miss (4) - 956 freq gauls (4) - 2 freq amyl (4) - 1 freq |
SoundEx code - Y542 yamils - 1 freq ymljxfzgus - 1 freq ymlqrchu - 1 freq |
MetaPhone code - YMLS yamils - 1 freq |
YAMILS |
| Time to execute Levenshtein function - 0.364240 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.695988 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.028838 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.090473 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.000933 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. |