Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
undefeated (0) - 1 freq underrated (2) - 2 freq undeflected (2) - 1 freq defeated (2) - 7 freq deflated (3) - 9 freq unelected (3) - 1 freq unaffected (3) - 2 freq understated (3) - 2 freq underwater (3) - 3 freq undeterred (3) - 7 freq unrelated (3) - 2 freq underneath (4) - 22 freq deflected (4) - 2 freq understate (4) - 1 freq uneducated (4) - 2 freq indicated (4) - 3 freq detested (4) - 1 freq infested (4) - 1 freq unmolested (4) - 1 freq underpeyed (4) - 1 freq undersized (4) - 2 freq unfazed (4) - 1 freq unreserved (4) - 1 freq unexpected (4) - 16 freq demented (4) - 8 freq |
undefeated (0) - 1 freq defeated (3) - 7 freq underrated (4) - 2 freq undeflected (4) - 1 freq unrelated (5) - 2 freq indicated (5) - 3 freq undoubted (5) - 1 freq unaffected (5) - 2 freq deflated (5) - 9 freq unelected (5) - 1 freq uneducated (5) - 2 freq defeatit (6) - 5 freq deleted (6) - 5 freq federated (6) - 1 freq negated (6) - 2 freq defamed (6) - 1 freq underpaid (6) - 1 freq inflated (6) - 3 freq moderated (6) - 1 freq undettered (6) - 1 freq undecided (6) - 2 freq debated (6) - 3 freq undulate (6) - 1 freq defeat (6) - 30 freq unmerited (6) - 1 freq |
SoundEx code - U531 undevaulin - 3 freq undeflected - 1 freq undoubted - 1 freq untape - 1 freq undividit - 1 freq untappit - 1 freq undoubtedly - 3 freq unhidebound - 1 freq unmutable - 1 freq undevalin - 1 freq undefeated - 1 freq untappd - 1 freq |
MetaPhone code - UNTFTT undividit - 1 freq undefeated - 1 freq |
UNDEFEATED |
Time to execute Levenshtein function - 0.274454 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.504398 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.039485 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.049740 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.000907 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. |