Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ill-wull (0) - 5 freq ill-wul (1) - 1 freq ill-will (1) - 6 freq ull-wull (1) - 2 freq ill-willy (2) - 3 freq ill-wulled (2) - 1 freq ill-turn (3) - 1 freq ill-fun (3) - 1 freq till-till (3) - 1 freq millwall (3) - 1 freq ill-luk (3) - 1 freq ill-luck (3) - 2 freq ill-willie (3) - 4 freq illegal (4) - 31 freq caldwell (4) - 1 freq guid-wull (4) - 1 freq ill-ane (4) - 1 freq ellonwill (4) - 2 freq ill-omen (4) - 1 freq she-wulf (4) - 1 freq €œwull (4) - 2 freq -well (4) - 2 freq €˜wull (4) - 1 freq ill-lik (4) - 1 freq ill-dain (4) - 1 freq |
ill-wull (0) - 5 freq ill-will (1) - 6 freq ull-wull (1) - 2 freq ill-willy (2) - 3 freq ill-wul (2) - 1 freq ill-wulled (3) - 1 freq ill-willie (3) - 4 freq uilliewall (5) - 1 freq ellonwill (5) - 2 freq ill-luk (5) - 1 freq allwullie (5) - 6 freq till-till (5) - 1 freq millwall (5) - 1 freq do-well (6) - 2 freq ill-wysin (6) - 1 freq ill-lik (6) - 1 freq pell-mell (6) - 2 freq illegally (6) - 2 freq w-will (6) - 1 freq ill-waured (6) - 1 freq will-willan (6) - 1 freq lexwell (6) - 7 freq rop-will (6) - 1 freq caldwell (6) - 1 freq -well (6) - 2 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-WULL |
Time to execute Levenshtein function - 0.365274 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.374834 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.027236 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.036998 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.000875 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. |