| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enormous (0) - 15 freq normous (1) - 2 freq ginormous (2) - 4 freq dormous (2) - 39 freq venomous (2) - 1 freq mormons (3) - 2 freq armous (3) - 1 freq enxious (3) - 4 freq dormouse (3) - 1 freq normo (3) - 1 freq norms (3) - 5 freq anonymous (3) - 25 freq eebrous (3) - 3 freq undemous (3) - 6 freq eponymous (3) - 4 freq generous (3) - 21 freq sonorous (3) - 2 freq amorous (3) - 3 freq infamous (3) - 7 freq decorous (3) - 2 freq noxious (3) - 2 freq normans (3) - 3 freq envious (3) - 2 freq enormity (3) - 3 freq nervous (3) - 73 freq |
enormous (0) - 15 freq normous (1) - 2 freq norms (3) - 5 freq dormous (3) - 39 freq ginormous (3) - 4 freq normans (4) - 3 freq enormity (4) - 3 freq enorm (4) - 11 freq undemous (4) - 6 freq onerous (4) - 1 freq nervous (4) - 73 freq infamous (4) - 7 freq dormouse (4) - 1 freq normo (4) - 1 freq armous (4) - 1 freq anonymous (4) - 25 freq venomous (4) - 1 freq ignoramus (5) - 1 freq anoraks (5) - 2 freq norm (5) - 10 freq erms (5) - 42 freq norns (5) - 7 freq informs (5) - 8 freq norma (5) - 2 freq nemos (5) - 1 freq |
SoundEx code - E565 enormous - 15 freq emerent - 1 freq emerant - 9 freq enorm - 11 freq enormity - 3 freq enormobibliotosspotificant - 1 freq enairmit - 1 freq emerants - 1 freq |
MetaPhone code - ENRMS enormous - 15 freq |
ENORMOUS |
| Time to execute Levenshtein function - 0.456382 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.540334 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.058450 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.038078 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.000840 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. |