| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-wysin (0) - 1 freq ill-dain (3) - 1 freq ill-döin (3) - 2 freq ill-daein (3) - 7 freq ill-wishin' (3) - 2 freq ill-ddin (3) - 1 freq hill-walkin (4) - 2 freq ill-boden (4) - 1 freq ill-luikin (4) - 1 freq ill-uised (4) - 1 freq ill-omen (4) - 1 freq ill-best (4) - 1 freq ilawson (4) - 8 freq ill-lik (4) - 1 freq illworkin (4) - 1 freq ill-likit (4) - 1 freq illusion (4) - 9 freq ell-wan (4) - 1 freq ill-lookin (4) - 3 freq wysin (4) - 1 freq ill-taen (4) - 2 freq ill-used (4) - 1 freq ill-fittin (4) - 3 freq ill-daeins (4) - 2 freq pillowin (4) - 1 freq |
ill-wysin (0) - 1 freq ell-wan (5) - 1 freq ill-wishin' (5) - 2 freq ill-ddin (5) - 1 freq ill-daein (5) - 7 freq ill-dain (5) - 1 freq lowsin (6) - 47 freq ill-yaise (6) - 1 freq ill-teen (6) - 1 freq ill-turn (6) - 1 freq ill-used (6) - 1 freq ill-set (6) - 4 freq ill-wul (6) - 1 freq ill-willy (6) - 3 freq ill-willie (6) - 4 freq ill-fun (6) - 1 freq allowin (6) - 6 freq ill-less (6) - 1 freq ill-taen (6) - 2 freq ill-will (6) - 6 freq ill-wull (6) - 5 freq ill-omen (6) - 1 freq ill-best (6) - 1 freq ill-uised (6) - 1 freq ill-luikin (6) - 1 freq |
SoundEx code - I425 illusion - 9 freq ilkane - 51 freq ill-contrivit - 1 freq illusions - 4 freq ill-kyndit - 3 freq ill-wishin' - 2 freq ill-contriven - 1 freq ill-lookin - 3 freq ill-considered - 1 freq ilk'ane - 6 freq ilkeen - 5 freq ilkkeen - 1 freq 'ilkane' - 1 freq ileskins - 2 freq ill-luikin - 1 freq ilkane's - 1 freq ilk-anither - 2 freq ilkanither - 3 freq ilk-ane - 1 freq illusionary - 1 freq ill-wysin - 1 freq ill-kindit - 1 freq iywlijmw - 1 freq iewilson - 1 freq ilkyin - 1 freq ilawson - 8 freq |
MetaPhone code - ILSN ill-wysin - 1 freq ilawson - 8 freq |
ILL-WYSIN |
| Time to execute Levenshtein function - 0.468806 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.738695 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.069459 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.037066 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.000772 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. |