| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enuff (0) - 12 freq inuff (1) - 1 freq enuf (1) - 13 freq snuff (1) - 9 freq anuff (1) - 28 freq enoff (1) - 1 freq 'nuff (1) - 1 freq ruff (2) - 12 freq rebuff (2) - 2 freq buff (2) - 15 freq eneuf (2) - 1 freq anoff (2) - 6 freq couff (2) - 2 freq scuff (2) - 4 freq douff (2) - 2 freq exufc (2) - 1 freq whuff (2) - 4 freq giuff (2) - 1 freq snuffs (2) - 1 freq gluff (2) - 19 freq guff (2) - 56 freq fluff (2) - 5 freq fuff (2) - 6 freq enugh (2) - 2 freq cuff (2) - 4 freq |
enuff (0) - 12 freq enoff (1) - 1 freq inuff (1) - 1 freq anuff (1) - 28 freq naff (2) - 2 freq anoff (2) - 6 freq niff (2) - 1 freq 'nuff (2) - 1 freq enuf (2) - 13 freq snuff (2) - 9 freq yuff (3) - 1 freq tuff (3) - 6 freq eiff (3) - 1 freq puff (3) - 44 freq enof (3) - 5 freq annuff (3) - 1 freq ouff (3) - 1 freq huff (3) - 34 freq houff (3) - 3 freq nyaff (3) - 24 freq naffu (3) - 1 freq bouff (3) - 1 freq nuf (3) - 1 freq wuff (3) - 1 freq snuffy (3) - 14 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 |
ENUFF |
| Time to execute Levenshtein function - 0.170151 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.344883 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.029384 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.039249 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.000847 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. |