Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
enenoo (0) - 8 freq eenoo (1) - 57 freq ayenoo (2) - 2 freq eenou (2) - 14 freq eynoo (2) - 3 freq thenoo (2) - 14 freq eyvnoo (2) - 7 freq enoo (2) - 8 freq eanoo (2) - 3 freq eenno (2) - 1 freq eenow (2) - 1 freq enno (2) - 6 freq e'noo (2) - 2 freq jeezoo (3) - 1 freq anent (3) - 516 freq ene (3) - 40 freq enof (3) - 5 freq een-a (3) - 1 freq enem (3) - 2 freq einen (3) - 1 freq enemy (3) - 37 freq anenst (3) - 52 freq meroo (3) - 1 freq uneo (3) - 1 freq anoo (3) - 7 freq |
enenoo (0) - 8 freq enno (2) - 6 freq eenoo (2) - 57 freq eenno (2) - 1 freq eenan (3) - 1 freq onno (3) - 20 freq anno (3) - 5 freq neon (3) - 7 freq ennui (3) - 1 freq enin (3) - 4 freq enn (3) - 36 freq enna (3) - 11 freq inno (3) - 197 freq anen (3) - 49 freq nen (3) - 6 freq annoy (3) - 12 freq einen (3) - 1 freq eenin (3) - 5 freq enoo (3) - 8 freq eenow (3) - 1 freq eyvnoo (3) - 7 freq eynoo (3) - 3 freq ayenoo (3) - 2 freq eenou (3) - 14 freq e'noo (3) - 2 freq |
SoundEx code - E550 e'enin - 1 freq enemy - 37 freq ennin - 2 freq een-an - 1 freq enin - 4 freq eenin - 5 freq enemie - 7 freq eomin - 1 freq eenan - 1 freq en'in - 5 freq enihin - 1 freq eenou-an - 2 freq einen - 1 freq eamin - 1 freq ehman - 1 freq enem - 2 freq enyhin - 1 freq eamonn - 9 freq enenoo - 8 freq |
MetaPhone code - ENN e'enin - 1 freq ennin - 2 freq een-an - 1 freq enin - 4 freq eenin - 5 freq eenan - 1 freq en'in - 5 freq eenou-an - 2 freq einen - 1 freq enenoo - 8 freq |
ENENOO |
Time to execute Levenshtein function - 0.193084 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.343657 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.027112 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.037454 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.000767 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. |