Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uneddicate (0) - 1 freq uneddicatit (2) - 1 freq uneducated (3) - 2 freq dedicate (3) - 8 freq predicate (3) - 11 freq indicate (3) - 9 freq eddicatin (4) - 1 freq eradicate (4) - 3 freq eddicatit (4) - 9 freq inordinate (4) - 1 freq unreddit (4) - 1 freq sneddit (4) - 11 freq syndicate (4) - 1 freq educate (4) - 15 freq unethical (4) - 1 freq dedicated (4) - 20 freq intricate (4) - 13 freq meditate (4) - 6 freq indicated (4) - 4 freq delicate (4) - 21 freq predicates (4) - 3 freq predicated (4) - 2 freq undulate (4) - 1 freq indicates (4) - 13 freq dedicat (4) - 3 freq |
uneddicate (0) - 1 freq uneddicatit (3) - 1 freq dedicate (4) - 8 freq indicate (4) - 9 freq dedicat (5) - 3 freq indelicate (5) - 2 freq predicate (5) - 11 freq uneducated (5) - 2 freq indicater (6) - 1 freq abdicate (6) - 1 freq undulate (6) - 1 freq indicates (6) - 13 freq indict (6) - 1 freq undercut (6) - 1 freq delicate (6) - 21 freq addict (6) - 1 freq uneducatit (6) - 2 freq neddie (6) - 1 freq noddit (6) - 122 freq unreddit (6) - 1 freq sneddit (6) - 11 freq eradicate (6) - 3 freq inordinate (6) - 1 freq indicated (6) - 4 freq educate (6) - 15 freq |
SoundEx code - U532 untwist - 3 freq untouched - 6 freq untaigelt - 3 freq untouchable - 3 freq unites - 4 freq undique - 1 freq undisturbed - 3 freq undeservin - 1 freq untiques - 3 freq undies - 3 freq undesirable - 1 freq ummidius - 2 freq undescendit - 1 freq untucked - 2 freq units - 21 freq unthack - 1 freq undistinguishable - 1 freq undisguisit - 1 freq unnoticed - 3 freq un-educatit - 1 freq uneducatit - 2 freq unthocht - 2 freq unmatchin - 1 freq unmatched - 1 freq undignifeed - 1 freq unethical - 1 freq undesirables - 1 freq undecidit - 1 freq undecidtit - 1 freq uneddicate - 1 freq uneddicatit - 1 freq uneducated - 2 freq undecided - 2 freq uunhddaky - 1 freq undisclosed - 2 freq |
MetaPhone code - UNTKT untucked - 2 freq uneddicate - 1 freq |
UNEDDICATE |
Time to execute Levenshtein function - 0.206758 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.396723 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.028108 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.037441 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.000901 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. |