| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undemous (0) - 6 freq undeemous (1) - 21 freq undeimous (1) - 8 freq ondeemous (2) - 1 freq demos (3) - 2 freq murderous (3) - 5 freq thunderous (3) - 5 freq undercut (3) - 1 freq demoss (3) - 1 freq undeun (3) - 1 freq hideous (3) - 7 freq demons (3) - 35 freq ulcerous (3) - 1 freq podemos (3) - 4 freq infamous (3) - 7 freq 'demons (3) - 1 freq unctuous (3) - 1 freq undemotic (3) - 1 freq underdogs (3) - 3 freq ponderous (3) - 2 freq normous (3) - 2 freq onerous (3) - 1 freq underdug (3) - 1 freq unanimous (3) - 2 freq nemos (3) - 1 freq |
undemous (0) - 6 freq undeimous (1) - 8 freq undeemous (1) - 21 freq ondeemous (2) - 1 freq normous (4) - 2 freq unanimous (4) - 2 freq enormous (4) - 15 freq podemos (4) - 4 freq untimeous (4) - 1 freq nemos (4) - 1 freq infamous (4) - 7 freq demos (4) - 2 freq andes (5) - 1 freq naems (5) - 16 freq inemies (5) - 3 freq enemies (5) - 36 freq andews (5) - 1 freq anders (5) - 1 freq undies (5) - 3 freq endeens (5) - 4 freq neems (5) - 7 freq enders (5) - 2 freq undeeman (5) - 2 freq deimos (5) - 1 freq indoors (5) - 9 freq |
SoundEx code - U535 untimeous - 1 freq undaein - 2 freq undeimous - 8 freq unwittin - 1 freq undeemous - 21 freq undauntit - 2 freq unatendid - 1 freq untungult - 1 freq untimely - 5 freq undeniable - 1 freq undaen - 1 freq untangle - 1 freq undone - 4 freq unthinkable - 3 freq uneaten - 1 freq untentie - 2 freq undeun - 1 freq undeeman - 2 freq unattended - 1 freq unidentified - 1 freq untenty - 1 freq undoan - 2 freq undon - 1 freq untentit - 1 freq unwittinly - 1 freq undain - 1 freq undauntoned - 1 freq undemous - 6 freq unduin - 1 freq undoin - 1 freq undemotic - 1 freq undemocratic - 2 freq untamed - 1 freq undantit - 1 freq umteenth - 2 freq unitin - 2 freq unidentifiable - 1 freq |
MetaPhone code - UNTMS untimeous - 1 freq undeimous - 8 freq undeemous - 21 freq undemous - 6 freq |
UNDEMOUS |
| Time to execute Levenshtein function - 0.217083 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.383986 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.027364 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.036972 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.000799 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. |