| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| untwist (0) - 3 freq intrist (2) - 1 freq twist (2) - 48 freq unkist (2) - 2 freq unwise (2) - 1 freq tist (3) - 1 freq gnawit (3) - 1 freq insist (3) - 10 freq unwasht (3) - 1 freq unjest (3) - 1 freq twisty (3) - 2 freq unit (3) - 42 freq twixt (3) - 3 freq muntit (3) - 3 freq unis (3) - 2 freq uist (3) - 15 freq ngist (3) - 2 freq wneist (3) - 1 freq dintist (3) - 3 freq unwind (3) - 5 freq neist (3) - 561 freq unrest (3) - 6 freq uncast (3) - 1 freq luntit (3) - 3 freq untidy (3) - 1 freq |
untwist (0) - 3 freq intrist (3) - 1 freq twist (3) - 48 freq entrust (4) - 1 freq aintist (4) - 1 freq twyst (4) - 1 freq twisty (4) - 2 freq newest (4) - 15 freq unkist (4) - 2 freq intrest (4) - 10 freq unwise (4) - 1 freq untruss (5) - 1 freq twise (5) - 11 freq twit (5) - 9 freq 'twis (5) - 32 freq enlist (5) - 1 freq unstfest (5) - 1 freq wist (5) - 3 freq inmaist (5) - 2 freq trist (5) - 3 freq in-twist- (5) - 1 freq twists (5) - 10 freq dentist (5) - 46 freq twilt (5) - 2 freq unitit (5) - 29 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 - UNTWST untwist - 3 freq |
UNTWIST |
| Time to execute Levenshtein function - 0.199350 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.383917 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.031773 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.038310 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.001077 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. |