| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| untungult (0) - 1 freq untangle (3) - 1 freq untaigelt (3) - 3 freq unrung (4) - 1 freq tumult (4) - 2 freq tingilt (4) - 1 freq unfulfilt (4) - 1 freq dangult (4) - 1 freq stumult (4) - 1 freq unroult (4) - 2 freq untellt (4) - 2 freq intult (4) - 1 freq unsung (4) - 2 freq tanglt (4) - 1 freq unfankilt (4) - 1 freq strangult (4) - 1 freq unfankelt (4) - 2 freq pungunt (4) - 1 freq antunett (4) - 1 freq unthirlt (4) - 1 freq snugglt (4) - 2 freq untul (4) - 1 freq tangelt (4) - 2 freq cunfuchult (4) - 1 freq untentit (4) - 1 freq |
untungult (0) - 1 freq untaigelt (4) - 3 freq untangle (4) - 1 freq tingilt (5) - 1 freq tanglt (5) - 1 freq tangelt (5) - 2 freq unthirlt (6) - 1 freq unfankelt (6) - 2 freq antunett (6) - 1 freq entangled (6) - 3 freq tanglet (6) - 1 freq strangult (6) - 1 freq untelt (6) - 2 freq untentit (6) - 1 freq tanglit (6) - 1 freq unfankilt (6) - 1 freq dangult (6) - 1 freq intult (6) - 1 freq untellt (6) - 2 freq stangit (7) - 1 freq singelt (7) - 1 freq ontilt (7) - 4 freq strangelt (7) - 1 freq hauntingly (7) - 1 freq untentie (7) - 2 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 - UNTNKLT untungult - 1 freq |
UNTUNGULT |
| Time to execute Levenshtein function - 0.228822 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.428183 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.028505 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.039814 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.000900 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. |