| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-daein (0) - 7 freq ill-dain (1) - 1 freq ill-daeins (1) - 2 freq ill-daers (2) - 1 freq ill-taen (2) - 2 freq ill-döin (2) - 2 freq ill-deeins (2) - 12 freq ill-ddin (2) - 1 freq ill-teen (3) - 1 freq ill-omen (3) - 1 freq ill-laek (3) - 2 freq a-daein (3) - 1 freq ill-deeds (3) - 2 freq weel-daein (3) - 6 freq illdeeins (3) - 1 freq ill-wysin (3) - 1 freq ull-deeins (3) - 2 freq ill-deedie (3) - 2 freq ill-doers (3) - 1 freq ill-fittin (4) - 3 freq folloaein (4) - 2 freq ill-yokit (4) - 1 freq ill-shakkin (4) - 1 freq laein (4) - 9 freq ill-made (4) - 2 freq |
ill-daein (0) - 7 freq ill-dain (1) - 1 freq ill-daeins (2) - 2 freq ill-ddin (3) - 1 freq ill-deeins (3) - 12 freq ill-taen (3) - 2 freq ill-deedie (4) - 2 freq weel-daein (4) - 6 freq ull-deeins (4) - 2 freq ill-omen (4) - 1 freq ill-daers (4) - 1 freq ill-döin (4) - 2 freq ill-teen (4) - 1 freq ill-boden (5) - 1 freq ill-ane (5) - 1 freq ell-wan (5) - 1 freq weel-daean (5) - 1 freq ull-deer (5) - 4 freq ill-fun (5) - 1 freq illdeeins (5) - 1 freq a-daein (5) - 1 freq ill-doers (5) - 1 freq ill-laek (5) - 2 freq ill-wysin (5) - 1 freq ill-deeds (5) - 2 freq |
SoundEx code - I435 ill-daein - 7 freq ill-taen - 2 freq ill-dain - 1 freq ill-deeins - 12 freq illdeeins - 1 freq ill-döin - 2 freq ill-ddin - 1 freq ill-daeins - 2 freq ill-tongued - 1 freq ill-teen - 1 freq |
MetaPhone code - ILTN ill-daein - 7 freq ill-taen - 2 freq ill-dain - 1 freq ill-döin - 2 freq ill-ddin - 1 freq ill-teen - 1 freq |
ILL-DAEIN |
| Time to execute Levenshtein function - 0.263871 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.351367 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.027562 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.037982 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.000843 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. |