| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eugene (0) - 1 freq gene (2) - 2 freq eugenic (2) - 1 freq quene (2) - 12 freq engine (2) - 50 freq serene (3) - 2 freq reuken (3) - 1 freq luge (3) - 1 freq eaten (3) - 31 freq eager (3) - 27 freq sene (3) - 3 freq suede (3) - 2 freq somene (3) - 4 freq eterne (3) - 2 freq juggle (3) - 1 freq eense (3) - 16 freq amene (3) - 1 freq essence (3) - 12 freq pertene (3) - 1 freq eyne (3) - 5 freq erenn (3) - 1 freq augeas (3) - 7 freq sueno (3) - 1 freq edges (3) - 32 freq bugle (3) - 2 freq |
eugene (0) - 1 freq gene (2) - 2 freq gune (3) - 1 freq agane (3) - 334 freq gane (3) - 270 freq gone (3) - 292 freq egan (3) - 3 freq gena (3) - 1 freq gen (3) - 11 freq genie (3) - 7 freq egon (3) - 1 freq engine (3) - 50 freq agen (3) - 12 freq eugenic (3) - 1 freq quene (3) - 12 freq even (4) - 2669 freq edgin (4) - 3 freq buena (4) - 1 freq gean (4) - 10 freq gener (4) - 1 freq buyen (4) - 1 freq gent (4) - 10 freq une (4) - 4 freq bigeene (4) - 2 freq grene (4) - 15 freq |
SoundEx code - E250 ecannae - 2 freq eyes-an - 3 freq echo-in - 3 freq ehicken - 1 freq eesome - 2 freq eikin - 29 freq eskimo - 3 freq echoin - 14 freq exam - 19 freq eggin - 5 freq easin - 11 freq ecn - 2 freq equine - 3 freq egon - 1 freq eskin - 2 freq ehuckin - 1 freq eushion - 1 freq eekin - 1 freq echoan - 2 freq eugene - 1 freq ehucken - 1 freq eesin - 1 freq essoyne - 1 freq esson - 1 freq eisin - 1 freq eschewin - 1 freq eaqm - 1 freq euaazem - 1 freq exxm - 1 freq egan - 3 freq eoghan - 1 freq essayin - 1 freq ezqcn - 1 freq exne - 1 freq |
MetaPhone code - EJN edgin - 3 freq eugene - 1 freq aegean - 4 freq aegin - 1 freq |
EUGENE |
| Time to execute Levenshtein function - 0.523933 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.783589 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.030387 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.079074 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.000905 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. |