| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-fun (0) - 1 freq ill-luk (2) - 1 freq ill-fed (2) - 1 freq ill-wul (2) - 1 freq ill-turn (2) - 1 freq ill-teen (3) - 1 freq ill-dain (3) - 1 freq ill-omen (3) - 1 freq willfu (3) - 1 freq hill-men (3) - 7 freq ell-wan (3) - 1 freq ill-end (3) - 1 freq '-fun (3) - 1 freq ill-ddin (3) - 1 freq hill-man (3) - 1 freq ill- (3) - 2 freq ill-lik (3) - 1 freq ill-luck (3) - 2 freq hilltoun (3) - 7 freq ill-faurt (3) - 1 freq ill-got (3) - 1 freq ill-ane (3) - 1 freq ill-aff (3) - 6 freq ill-set (3) - 4 freq ill-wull (3) - 5 freq |
ill-fun (0) - 1 freq ill-fed (3) - 1 freq ill-taen (4) - 2 freq ell-wan (4) - 1 freq ill-aff (4) - 6 freq ill-ane (4) - 1 freq ill-omen (4) - 1 freq ill-luk (4) - 1 freq ill-wul (4) - 1 freq ill-turn (4) - 1 freq ill-dain (4) - 1 freq ill-teen (4) - 1 freq ill-faurt (5) - 1 freq ill-got (5) - 1 freq ill-set (5) - 4 freq ill-lik (5) - 1 freq ill-daein (5) - 7 freq '-fun (5) - 1 freq hill-men (5) - 7 freq ill-ddin (5) - 1 freq ill-end (5) - 1 freq hill-man (5) - 1 freq ill- (5) - 2 freq seil-fu (6) - 1 freq ill-faured (6) - 9 freq |
SoundEx code - I415 ill-fun - 1 freq ile-pintin - 1 freq ill-vaandit - 3 freq ilovemaalies - 1 freq ilovenature - 1 freq ielpnlcqka - 1 freq |
MetaPhone code - ILFN ill-fun - 1 freq |
ILL-FUN |
| Time to execute Levenshtein function - 0.244741 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.379036 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.026937 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.037131 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.000865 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. |