Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ellonwill (0) - 2 freq ill-will (3) - 6 freq ellons (4) - 1 freq allowing (4) - 5 freq cooncill (4) - 1 freq bellshill (4) - 2 freq ellon (4) - 19 freq ellon's (4) - 1 freq elbowin (4) - 4 freq allowin (4) - 6 freq doonhill (4) - 6 freq ill-willy (4) - 3 freq oneill (4) - 2 freq ontill (4) - 3 freq colonial (4) - 8 freq jjconeill (4) - 2 freq 'goodwill (4) - 1 freq ull-wull (4) - 2 freq goodwill (4) - 3 freq toonhill (4) - 1 freq wellhill (4) - 1 freq ill-wull (4) - 5 freq newtonhill (4) - 1 freq elcouncil (4) - 5 freq linmill (4) - 3 freq |
ellonwill (0) - 2 freq ill-will (4) - 6 freq ull-wull (5) - 2 freq ill-wull (5) - 5 freq ill-willy (5) - 3 freq uilliewall (6) - 1 freq ill-willie (6) - 4 freq linmill (6) - 3 freq allwullie (7) - 6 freq greenwell (7) - 1 freq balloon'll (7) - 1 freq lefnoll (7) - 1 freq cornwall (7) - 9 freq ladywell (7) - 2 freq alsweill (7) - 1 freq ellemcelle (7) - 1 freq loonie'll (7) - 1 freq caldwell (7) - 1 freq lexwell (7) - 7 freq elcouncil (7) - 5 freq allanerly (7) - 1 freq millwall (7) - 1 freq veillonella (7) - 1 freq ill-wul (7) - 1 freq allowing (7) - 5 freq |
SoundEx code - E454 ellonwill - 2 freq elainealba - 1 freq |
MetaPhone code - ELNWL ellonwill - 2 freq |
ELLONWILL |
Time to execute Levenshtein function - 0.223353 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.385950 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.028182 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.044525 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.000895 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. |