| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eoghand (0) - 1 freq eoghan (1) - 1 freq england (2) - 224 freq €˜grand (3) - 1 freq eggheid (3) - 1 freq ergan (3) - 1 freq holland (3) - 17 freq ghandi (3) - 1 freq 'grand (3) - 6 freq moggans (3) - 1 freq logans (3) - 1 freq soghin (3) - 1 freq lochans (3) - 8 freq poland (3) - 10 freq soumand (3) - 1 freq loshan (3) - 1 freq logan (3) - 12 freq ethan (3) - 1 freq foghar (3) - 1 freq onand (3) - 1 freq afghan (3) - 1 freq hand (3) - 319 freq merchand (3) - 4 freq eland (3) - 1 freq lochan (3) - 26 freq |
eoghand (0) - 1 freq eoghan (2) - 1 freq ghandi (3) - 1 freq shand (4) - 11 freq hand (4) - 319 freq coohaund (4) - 1 freq grand (4) - 363 freq ghana (4) - 1 freq england (4) - 224 freq hund (5) - 1 freq graand (5) - 4 freq meghan (5) - 2 freq nearhand (5) - 2 freq meighan (5) - 11 freq eyland (5) - 2 freq johann (5) - 4 freq dabhand (5) - 1 freq errand (5) - 5 freq highland (5) - 31 freq sighan (5) - 5 freq ‘hand (5) - 1 freq agrund (5) - 3 freq ootland (5) - 5 freq heughan (5) - 1 freq weyghan (5) - 1 freq |
SoundEx code - E253 ecountry - 1 freq essentially - 6 freq essential - 47 freq eccentrics - 1 freq eccentric - 2 freq ex-model - 1 freq ezentn - 1 freq eccent - 4 freq 'essential - 1 freq essentials - 3 freq exeunt - 4 freq ecantrip - 1 freq essentiallie - 1 freq ee-candy - 1 freq eiss-shintie - 1 freq €œessential - 1 freq essention - 1 freq exeemed - 1 freq eecmdqqi - 1 freq eoghand - 1 freq ex-meadow - 1 freq eqomtfhgto - 1 freq ekxmduy - 1 freq ekeinootmorehoursfaedaday - 1 freq |
MetaPhone code - EFNT event - 103 freq eyvind - 2 freq evened - 1 freq eoghand - 1 freq |
EOGHAND |
| Time to execute Levenshtein function - 0.213898 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.404807 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.031120 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.040885 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.001273 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. |