| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undescendit (0) - 1 freq descendit (2) - 11 freq condescendit (2) - 1 freq descendin (3) - 11 freq condescendin (3) - 5 freq undecidit (3) - 1 freq undecidtit (4) - 1 freq interceedit (4) - 1 freq descends (4) - 9 freq unneedit (4) - 1 freq defendit (4) - 2 freq descent (4) - 13 freq dependit (4) - 10 freq condescend (4) - 3 freq descend (4) - 14 freq transcendit (4) - 3 freq unheedit (4) - 1 freq descending (4) - 3 freq descended (4) - 6 freq descendent (4) - 4 freq understandin (4) - 18 freq undeservin (4) - 1 freq descendant (4) - 3 freq ascendit (4) - 3 freq indecent (4) - 1 freq |
undescendit (0) - 1 freq descendit (3) - 11 freq condescendit (3) - 1 freq undecidit (5) - 1 freq condescendin (5) - 5 freq descendin (5) - 11 freq descend (6) - 14 freq indecent (6) - 1 freq ascendit (6) - 3 freq condescend (6) - 3 freq descendent (6) - 4 freq descended (6) - 6 freq descendant (6) - 3 freq condescended (6) - 1 freq descends (6) - 9 freq descent (6) - 13 freq nascent (7) - 3 freq discardit (7) - 3 freq undertandin (7) - 2 freq unnerfundit (7) - 1 freq abscondit (7) - 1 freq iridescent (7) - 1 freq interceedit (7) - 1 freq unneedit (7) - 1 freq defendit (7) - 2 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 - UNTSNTT undescendit - 1 freq |
UNDESCENDIT |
| Time to execute Levenshtein function - 0.238662 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.425962 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.031960 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.046997 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.000870 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. |