| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| untentit (0) - 1 freq untentie (1) - 2 freq contentit (2) - 24 freq unstintit (2) - 1 freq stentit (2) - 9 freq unwantit (2) - 2 freq eontentit (2) - 1 freq unwintit (2) - 3 freq tentit (2) - 8 freq uneytit (2) - 1 freq unpatentit (2) - 1 freq intendit (2) - 25 freq undantit (2) - 1 freq untenty (2) - 1 freq inventit (2) - 23 freq unlamentit (3) - 1 freq pentit (3) - 44 freq investit (3) - 3 freq unkennt (3) - 3 freq unsteikit (3) - 1 freq testit (3) - 10 freq anyntit (3) - 1 freq unatendid (3) - 1 freq attendit (3) - 28 freq extendit (3) - 9 freq |
untentit (0) - 1 freq untentie (2) - 2 freq eontentit (2) - 1 freq unpatentit (3) - 1 freq undantit (3) - 1 freq inventit (3) - 23 freq untenty (3) - 1 freq tentit (3) - 8 freq intendit (3) - 25 freq contentit (3) - 24 freq stentit (3) - 9 freq unstintit (3) - 1 freq unwantit (3) - 2 freq unwintit (3) - 3 freq intensity (4) - 7 freq stuntit (4) - 1 freq inventet (4) - 2 freq intent (4) - 37 freq entent (4) - 1 freq intonit (4) - 1 freq tintit (4) - 3 freq anointit (4) - 2 freq antunett (4) - 1 freq intently (4) - 10 freq intents (4) - 2 freq |
SoundEx code - U535 untimeous - 1 freq undaein - 2 freq undeimous - 8 freq unwittin - 1 freq undeemous - 23 freq undauntit - 2 freq unatendid - 1 freq untungult - 1 freq unattended - 2 freq undeniable - 2 freq untimely - 5 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 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 - UNTNTT undauntit - 2 freq unatendid - 1 freq unattended - 2 freq untentit - 1 freq undantit - 1 freq |
UNTENTIT |
| Time to execute Levenshtein function - 0.201523 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.408381 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.028067 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.037548 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.000930 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. |