| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itherwhiles (0) - 2 freq itherwhaurs (3) - 1 freq itherwice (3) - 2 freq itherweis (3) - 1 freq itherwyes (3) - 2 freq itherwise (3) - 61 freq itherwise' (3) - 4 freq theophilus (4) - 3 freq atweenwhiles (4) - 1 freq itherweys (4) - 9 freq ithergates (4) - 13 freq itherweese (4) - 1 freq itherairts (4) - 1 freq otherwise (4) - 19 freq itherworld (4) - 1 freq itherwyse (4) - 1 freq itherwyss (4) - 5 freq itherwye (4) - 1 freq therapies (4) - 2 freq itherwarld (4) - 3 freq etherwaves (4) - 4 freq itherwhaur (4) - 2 freq itherwyce (4) - 3 freq withershins (4) - 5 freq ithergaits (4) - 9 freq |
itherwhiles (0) - 2 freq itherwhaurs (4) - 1 freq itherwyes (5) - 2 freq itherwise (5) - 61 freq itherweis (5) - 1 freq itherwyse (6) - 1 freq itherwhaur (6) - 2 freq itherwyss (6) - 5 freq itherwarld (6) - 3 freq itherworld (6) - 1 freq etherwaves (6) - 4 freq otherwise (6) - 19 freq itherwise' (6) - 4 freq itherwice (6) - 2 freq atweenwhiles (6) - 1 freq theophilus (6) - 3 freq itherweese (6) - 1 freq itherweys (6) - 9 freq thornhill (7) - 4 freq thrummles (7) - 1 freq motherwells (7) - 1 freq thrissles (7) - 16 freq thristles (7) - 3 freq thersels (7) - 2 freq thrapples (7) - 18 freq |
SoundEx code - I364 itherwhiles - 2 freq ither'll - 1 freq iterally - 1 freq |
MetaPhone code - I0RHLS itherwhiles - 2 freq |
ITHERWHILES |
| Time to execute Levenshtein function - 0.257283 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.534335 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.059976 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.038215 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.000912 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. |