| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| umpteen (0) - 15 freq ympteen (1) - 1 freq uptaen (2) - 1 freq upgeen (2) - 1 freq umpteenth (2) - 9 freq dumpleen (2) - 1 freq conteen (3) - 3 freq aiteen (3) - 1 freq sumeen (3) - 1 freq upsteer (3) - 3 freq lumpen (3) - 1 freq seteen (3) - 1 freq teen (3) - 461 freq mideen (3) - 1 freq unsteek (3) - 3 freq sumtheen (3) - 2 freq setteen (3) - 2 freq fitteen (3) - 1 freq makeen (3) - 1 freq ooteen (3) - 1 freq sateen (3) - 1 freq uptoon (3) - 1 freq kisteen (3) - 1 freq emptie (3) - 1 freq emptiet (3) - 1 freq |
umpteen (0) - 15 freq ympteen (1) - 1 freq emptyin (3) - 6 freq uptaen (3) - 1 freq uptoon (4) - 1 freq capten (4) - 3 freq mitten (4) - 15 freq amputee (4) - 2 freq competeen (4) - 1 freq empties (4) - 6 freq emptiet (4) - 1 freq emptie (4) - 1 freq emptied (4) - 20 freq empien (4) - 1 freq meeteen (4) - 5 freq gumption (4) - 12 freq dumpleen (4) - 1 freq upgeen (4) - 1 freq umpteenth (4) - 9 freq motien (4) - 2 freq mantein (5) - 1 freq empty (5) - 213 freq implyin (5) - 3 freq omittin (5) - 1 freq mitton (5) - 1 freq |
SoundEx code - U513 unbathert - 1 freq unbidden - 6 freq unbuttonin - 1 freq unevytable - 2 freq umpteenth - 9 freq umpteen - 15 freq unbooed - 1 freq unboadied - 1 freq unfaddomed - 1 freq unfathomably - 1 freq unbitter - 1 freq unbeatable - 2 freq unpattrened - 2 freq unfaddomable - 1 freq unbuttoned - 4 freq unfettered - 2 freq unfaithful - 2 freq unbodie't - 3 freq unavoydable - 1 freq unbutton - 2 freq unpatentit - 1 freq unhappt - 1 freq unbowed - 1 freq unmouped - 1 freq unavoidable - 3 freq unmapped - 1 freq unified - 3 freq unbothered - 1 freq unbiddan - 1 freq unpaid - 3 freq unfit - 1 freq |
MetaPhone code - UMPTN umpteen - 15 freq |
UMPTEEN |
| Time to execute Levenshtein function - 0.201108 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.387008 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.030831 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.038111 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.000947 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. |