| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itherwyes (0) - 2 freq itherwyss (1) - 5 freq itherwye (1) - 1 freq itherwyse (2) - 1 freq idderwyes (2) - 1 freq itherweys (2) - 9 freq itherweis (2) - 1 freq itherwyce (2) - 3 freq itherweese (2) - 1 freq ither-weys (3) - 1 freq etherwaves (3) - 4 freq otherweys (3) - 1 freq itherwise (3) - 61 freq mitherweel (3) - 1 freq ithers (3) - 577 freq ither's (3) - 13 freq theres (3) - 110 freq ithergates (3) - 13 freq therties (3) - 1 freq itherwice (3) - 2 freq ithers (3) - 1 freq itherwhiles (3) - 2 freq itherwise' (3) - 4 freq mithers (4) - 5 freq cherges (4) - 2 freq |
itherwyes (0) - 2 freq itherweys (2) - 9 freq itherweis (2) - 1 freq itherweese (2) - 1 freq itherwyss (2) - 5 freq itherwyse (2) - 1 freq itherwye (2) - 1 freq itherwise (3) - 61 freq otherweys (3) - 1 freq itherwyce (3) - 3 freq therties (4) - 1 freq idderwyes (4) - 1 freq itherwice (4) - 2 freq itherwise' (4) - 4 freq theres (4) - 110 freq ither's (4) - 13 freq etherwaves (4) - 4 freq ither-weys (4) - 1 freq otherwise (4) - 19 freq ithers (4) - 577 freq thrades (5) - 1 freq thraws (5) - 14 freq threes (5) - 11 freq thirties (5) - 17 freq other's (5) - 10 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 - I0RYS itherwyes - 2 freq |
ITHERWYES |
| Time to execute Levenshtein function - 0.347263 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.533641 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.028580 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.040814 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.001135 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. |