| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enof (0) - 5 freq enuf (1) - 13 freq enoff (1) - 1 freq enoo (1) - 8 freq enow (1) - 5 freq anof (1) - 4 freq eno (1) - 9 freq enou (1) - 1 freq eiff (2) - 1 freq enj (2) - 1 freq ejo (2) - 1 freq eerf (2) - 1 freq 'not (2) - 8 freq no- (2) - 2 freq venom (2) - 13 freq nov (2) - 4 freq enns (2) - 11 freq enml (2) - 1 freq end (2) - 1198 freq ewoh (2) - 1 freq hoof (2) - 15 freq endy (2) - 8 freq meno (2) - 1 freq eros (2) - 16 freq elf (2) - 10 freq |
enof (0) - 5 freq anof (1) - 4 freq enuf (1) - 13 freq nf (2) - 2 freq eneuf (2) - 1 freq nuf (2) - 1 freq enou (2) - 1 freq eno (2) - 9 freq enoff (2) - 1 freq enoo (2) - 8 freq enow (2) - 5 freq no (3) - 10107 freq info (3) - 35 freq rof (3) - 3 freq enoug (3) - 1 freq ent (3) - 3 freq no' (3) - 54 freq uno (3) - 1 freq ooof (3) - 1 freq enda (3) - 2 freq lof (3) - 1 freq nog (3) - 3 freq not (3) - 712 freq enjoy (3) - 331 freq enin (3) - 4 freq |
SoundEx code - E510 empie - 25 freq envy - 25 freq envie - 2 freq enuf - 13 freq empy - 6 freq eneuf - 1 freq enuff - 12 freq emva - 1 freq enof - 5 freq env - 1 freq emyf - 1 freq eiemv - 1 freq enoff - 1 freq |
MetaPhone code - ENF enough - 883 freq eneugh - 49 freq envy - 25 freq envie - 2 freq enuf - 13 freq enugh - 2 freq eneuf - 1 freq enogh - 20 freq enough-a - 1 freq 'enough - 1 freq enuff - 12 freq enof - 5 freq env - 1 freq enoff - 1 freq |
ENOF |
| Time to execute Levenshtein function - 0.176823 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.318045 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.027406 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.036321 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.000768 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. |