Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ill-willy (0) - 3 freq ill-will (1) - 6 freq ill-willie (2) - 4 freq ill-wull (2) - 5 freq will-willan (3) - 1 freq willy-nilly (3) - 2 freq ill-wul (3) - 1 freq till-till (3) - 1 freq illegally (3) - 2 freq ull-wull (3) - 2 freq ill-wulled (3) - 1 freq millwall (4) - 1 freq ellonwill (4) - 2 freq 'willy (4) - 1 freq willy (4) - 12 freq ill-lik (4) - 1 freq willinly (4) - 2 freq eild-ills (4) - 1 freq ill-likit (4) - 1 freq rop-will (4) - 1 freq ill-wysin (4) - 1 freq w-will (4) - 1 freq ill-luk (4) - 1 freq hollywills (4) - 2 freq ill-uised (4) - 1 freq |
ill-willy (0) - 3 freq ill-will (1) - 6 freq ill-wull (2) - 5 freq ill-willie (2) - 4 freq ull-wull (3) - 2 freq ill-wul (4) - 1 freq ill-wulled (4) - 1 freq ellonwill (5) - 2 freq illegally (5) - 2 freq will-willan (5) - 1 freq willy-nilly (5) - 2 freq till-till (5) - 1 freq rop-will (6) - 1 freq ill-wysin (6) - 1 freq w-will (6) - 1 freq peely-wally (6) - 19 freq ill-luk (6) - 1 freq millwall (6) - 1 freq uilliewall (6) - 1 freq allwullie (6) - 6 freq ill-lik (6) - 1 freq guid-will (7) - 1 freq ill-claed (7) - 1 freq rope-will (7) - 2 freq ill-waured (7) - 1 freq |
SoundEx code - I440 ill-willie - 4 freq ill-will - 6 freq ill-wull - 5 freq ill-wul - 1 freq ill-willy - 3 freq |
MetaPhone code - ILWL ill-willie - 4 freq ill-will - 6 freq ill-wull - 5 freq ill-wul - 1 freq ill-willy - 3 freq |
ILL-WILLY |
Time to execute Levenshtein function - 0.569569 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 - 1.004822 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.027744 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.095353 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. |