| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-aff (0) - 6 freq tirl-aff (2) - 1 freq ill-ane (2) - 1 freq ill-got (3) - 1 freq ill-laek (3) - 2 freq ill-lik (3) - 1 freq ill-set (3) - 4 freq flaff (3) - 5 freq far-aff (3) - 6 freq wan-aff (3) - 1 freq sclaff (3) - 4 freq ill-wul (3) - 1 freq ill-fun (3) - 1 freq rip-aff (3) - 3 freq ill-fed (3) - 1 freq ill-afford (3) - 1 freq ill-end (3) - 1 freq rin-aff (3) - 1 freq ill-luk (3) - 1 freq one-aff (3) - 1 freq laff (3) - 7 freq ill-made (3) - 2 freq blaff (3) - 2 freq ill-taen (3) - 2 freq tap-aff (3) - 1 freq |
ill-aff (0) - 6 freq ill-fun (4) - 1 freq weel-aff (4) - 28 freq tirl-aff (4) - 1 freq ill-ane (4) - 1 freq ill-fed (4) - 1 freq blaff (5) - 2 freq one-aff (5) - 1 freq ill-taen (5) - 2 freq ill-made (5) - 2 freq ane-aff (5) - 4 freq ill-dain (5) - 1 freq play-off (5) - 1 freq ill- (5) - 2 freq yin-aff (5) - 1 freq ill-luk (5) - 1 freq tap-aff (5) - 1 freq laff (5) - 7 freq rin-aff (5) - 1 freq far-aff (5) - 6 freq ill-set (5) - 4 freq ill-lik (5) - 1 freq ill-got (5) - 1 freq ill-laek (5) - 2 freq wan-aff (5) - 1 freq |
SoundEx code - I410 ill-aff - 6 freq i'love - 4 freq i'life - 7 freq i'lobby - 1 freq ilive - 1 freq ilyp - 1 freq ilev - 1 freq |
MetaPhone code - ILF ill-aff - 6 freq i'love - 4 freq i'life - 7 freq ilive - 1 freq ilev - 1 freq |
ILL-AFF |
| Time to execute Levenshtein function - 0.176514 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.369021 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.027149 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.037457 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.000827 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. |