| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undantit (0) - 1 freq unwantit (1) - 2 freq undauntit (1) - 2 freq unlandit (2) - 1 freq updaetit (2) - 2 freq unplantit (2) - 1 freq updatit (2) - 13 freq untentit (2) - 1 freq unmankit (2) - 1 freq unwintit (2) - 3 freq unfankilt (3) - 1 freq dentit (3) - 3 freq chantit (3) - 8 freq dauntit (3) - 3 freq dautit (3) - 1 freq inventit (3) - 23 freq endytit (3) - 1 freq unpatentit (3) - 1 freq underfit (3) - 1 freq unwarkit (3) - 1 freq undaein (3) - 2 freq plantit (3) - 35 freq unwashit (3) - 1 freq unlamentit (3) - 1 freq anointit (3) - 2 freq |
undantit (0) - 1 freq undauntit (1) - 2 freq unwantit (2) - 2 freq untentit (3) - 1 freq unwintit (3) - 3 freq endytit (4) - 1 freq anyntit (4) - 1 freq anointit (4) - 2 freq undilutit (4) - 1 freq invintit (4) - 1 freq dauntit (4) - 3 freq dintit (4) - 3 freq inventit (4) - 23 freq updatit (4) - 13 freq unplantit (4) - 1 freq updaetit (4) - 2 freq unlandit (4) - 1 freq duntit (4) - 25 freq unmankit (4) - 1 freq dentit (4) - 3 freq antit (5) - 1 freq datit (5) - 6 freq enchantit (5) - 1 freq grantit (5) - 30 freq rantit (5) - 1 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 - UNTNTT undauntit - 2 freq unatendid - 1 freq unattended - 1 freq untentit - 1 freq undantit - 1 freq |
UNDANTIT |
| Time to execute Levenshtein function - 0.787688 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.611027 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.031793 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.040111 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.000868 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. |