| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ithirs (0) - 10 freq thirs (1) - 41 freq 'thirs (1) - 1 freq ithers (1) - 577 freq ithir (1) - 35 freq vthir (2) - 2 freq uthers (2) - 1 freq steirs (2) - 4 freq tithir (2) - 1 freq stirs (2) - 6 freq othir (2) - 1 freq ethics (2) - 3 freq iddirs (2) - 2 freq thors (2) - 1 freq thins (2) - 2 freq ither (2) - 3074 freq withir (2) - 3 freq withies (2) - 1 freq thurs (2) - 16 freq igthir (2) - 4 freq thirr (2) - 1 freq withers (2) - 5 freq theirs (2) - 44 freq thirls (2) - 5 freq ither's (2) - 13 freq |
ithirs (0) - 10 freq thirs (1) - 41 freq ithers (1) - 577 freq thers (2) - 1 freq thors (2) - 1 freq thars (2) - 2 freq thurs (2) - 16 freq theirs (2) - 44 freq thairs (2) - 14 freq aithers (2) - 7 freq ithir (2) - 35 freq 'thirs (2) - 1 freq eithers (2) - 1 freq uthers (2) - 1 freq others (2) - 59 freq thirst (3) - 22 freq thies (3) - 1 freq thir's (3) - 121 freq tharis (3) - 1 freq this (3) - 11303 freq ithers' (3) - 6 freq thries (3) - 2 freq thirds (3) - 2 freq third (3) - 211 freq uthir (3) - 1 freq |
SoundEx code - I362 ithers - 577 freq ithergaits - 9 freq itherwise - 61 freq itherwise' - 4 freq ither's - 13 freq ithergates - 13 freq ithergait - 1 freq itricht - 1 freq ithers' - 6 freq ithers'll - 1 freq itherweese - 1 freq idderwise - 4 freq idders - 40 freq idder's - 1 freq itherwyes - 2 freq itherwyss - 5 freq iddir'as - 1 freq i'tears - 1 freq ithirs - 10 freq i'dark - 1 freq iddirs - 2 freq idderwyes - 1 freq iddergaits - 1 freq itherwyce - 3 freq iddirwise - 1 freq itherwice - 2 freq itherweys - 9 freq itherwyse - 1 freq iuterestin - 1 freq ither-weys - 1 freq itherweis - 1 freq ithers - 1 freq |
MetaPhone code - I0RS ithers - 577 freq ither's - 13 freq ithers' - 6 freq itherwyss - 5 freq ithirs - 10 freq itherwyce - 3 freq itherwyse - 1 freq ithers - 1 freq |
ITHIRS |
| Time to execute Levenshtein function - 0.386337 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.592293 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.027397 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.069271 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.000897 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. |