| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eoghan (0) - 1 freq eoghand (1) - 1 freq ogham (2) - 2 freq bogha' (2) - 1 freq meghan (2) - 2 freq wogan (2) - 1 freq soghin (2) - 1 freq joggan (2) - 1 freq ethan (2) - 1 freq egan (2) - 3 freq hogan (2) - 1 freq heughan (2) - 1 freq englan (2) - 11 freq weyghan (2) - 1 freq meighan (2) - 11 freq foghar (2) - 1 freq loshan (2) - 1 freq loggan (2) - 1 freq ergan (2) - 1 freq lochan (2) - 26 freq afghan (2) - 1 freq logan (2) - 12 freq sighan (2) - 5 freq sooran (3) - 1 freq bohun (3) - 2 freq |
eoghan (0) - 1 freq eoghand (2) - 1 freq sighan (3) - 5 freq heughan (3) - 1 freq meighan (3) - 11 freq egan (3) - 3 freq weyghan (3) - 1 freq ethan (3) - 1 freq ogham (3) - 2 freq meghan (3) - 2 freq ghana (3) - 1 freq soghin (3) - 1 freq afghan (3) - 1 freq ythan (4) - 6 freq soughin (4) - 2 freq coughin (4) - 14 freq dhan (4) - 1 freq gaughan (4) - 8 freq gan (4) - 768 freq achan (4) - 2 freq aigan (4) - 1 freq chan (4) - 2 freq lhan (4) - 1 freq eggin (4) - 5 freq guan (4) - 11 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 - EFN even - 2669 freq eyven - 10 freq 'even - 6 freq effin - 14 freq evn - 1 freq evin - 64 freq eyvnoo - 7 freq eff-in - 1 freq evein - 3 freq ev'n - 1 freq eevin - 5 freq evan - 12 freq €˜even - 2 freq €œeven - 3 freq eoghan - 1 freq |
EOGHAN |
| Time to execute Levenshtein function - 0.247659 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.375706 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.027882 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.037636 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.000903 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. |