| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eekin (0) - 1 freq beekin (1) - 10 freq eekit (1) - 6 freq eein (1) - 7 freq aekin (1) - 1 freq eikin (1) - 29 freq sekin (1) - 2 freq eetin (1) - 3 freq peekin (1) - 3 freq eevin (1) - 5 freq eskin (1) - 2 freq keekin (1) - 126 freq eesin (1) - 1 freq reekin (1) - 45 freq eerin (1) - 2 freq eenin (1) - 5 freq seekin (1) - 100 freq deekin (1) - 2 freq weyin (2) - 3 freq mein (2) - 2 freq seeking (2) - 6 freq eltin (2) - 1 freq sleekin (2) - 5 freq evin (2) - 64 freq ettin (2) - 13 freq |
eekin (0) - 1 freq eikin (1) - 29 freq aekin (1) - 1 freq kin (2) - 1383 freq keyin (2) - 1 freq akin (2) - 12 freq seekin (2) - 100 freq yokin (2) - 24 freq kein (2) - 1 freq yeken (2) - 1 freq yeukin (2) - 1 freq aakin (2) - 3 freq eenin (2) - 5 freq ookin (2) - 1 freq deekin (2) - 2 freq peekin (2) - 3 freq eerin (2) - 2 freq eekit (2) - 6 freq eetin (2) - 3 freq eein (2) - 7 freq sekin (2) - 2 freq eevin (2) - 5 freq eskin (2) - 2 freq eesin (2) - 1 freq beekin (2) - 10 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 - EKN ecannae - 2 freq eikin - 29 freq eggin - 5 freq ecn - 2 freq equine - 3 freq egon - 1 freq aekin - 1 freq eekin - 1 freq egan - 3 freq |
EEKIN |
| Time to execute Levenshtein function - 0.179060 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.381620 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.027890 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.037731 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.000937 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. |