| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ginormous (0) - 4 freq normous (2) - 2 freq enormous (2) - 15 freq sonorous (3) - 2 freq glorious (3) - 58 freq generous (3) - 21 freq timorous (3) - 13 freq rigorous (3) - 1 freq infamous (3) - 7 freq vigorous (3) - 1 freq dormous (3) - 39 freq venomous (3) - 1 freq g-nomes (4) - 2 freq tumorous (4) - 2 freq ginos (4) - 1 freq timerous (4) - 2 freq synonymous (4) - 2 freq gorgeous (4) - 68 freq victorious (4) - 3 freq hilarious (4) - 18 freq gordons (4) - 16 freq humorous (4) - 5 freq armous (4) - 1 freq giros (4) - 1 freq norms (4) - 5 freq |
ginormous (0) - 4 freq enormous (3) - 15 freq normous (3) - 2 freq ignoramus (4) - 1 freq generous (4) - 21 freq genomes (5) - 1 freq gorms (5) - 2 freq gnomes (5) - 2 freq 'ignoramus (5) - 1 freq norms (5) - 5 freq venomous (5) - 1 freq dormous (5) - 39 freq glorious (5) - 58 freq infamous (5) - 7 freq sonorous (5) - 2 freq kinross (6) - 6 freq georgeous (6) - 1 freq anonymous (6) - 25 freq goners (6) - 1 freq dormouse (6) - 1 freq normo (6) - 1 freq generals (6) - 2 freq germs (6) - 4 freq grooms (6) - 2 freq gunrays (6) - 1 freq |
SoundEx code - G565 ginormous - 4 freq gameramus - 1 freq gginaahernbyrne - 2 freq |
MetaPhone code - JNRMS ginormous - 4 freq |
GINORMOUS |
| Time to execute Levenshtein function - 0.206543 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.367725 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.027664 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.038071 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.001126 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. |