| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itherwhaur (0) - 2 freq itherwhaurs (1) - 1 freq itherhaun (2) - 1 freq iverywhaur (3) - 1 freq ivverywhaur (3) - 2 freq therefur (4) - 1 freq ontewhaur (4) - 1 freq itherroads (4) - 1 freq ilkawhaur (4) - 1 freq mitherlaun (4) - 1 freq itherweese (4) - 1 freq itherwyes (4) - 2 freq itherweis (4) - 1 freq itherwise (4) - 61 freq itherwyss (4) - 5 freq onie-whaur (4) - 1 freq itherwyce (4) - 3 freq somewhaur (4) - 72 freq itherwhiles (4) - 2 freq everywhaur (4) - 6 freq thesaur (4) - 2 freq innywhaur (4) - 1 freq thehaar (4) - 1 freq itherwice (4) - 2 freq iverywhar (4) - 2 freq |
itherwhaur (0) - 2 freq itherwhaurs (2) - 1 freq itherhaun (4) - 1 freq ivverywhaur (5) - 2 freq iverywhaur (5) - 1 freq iverywhar (6) - 2 freq itherwice (6) - 2 freq thehaar (6) - 1 freq itherwhiles (6) - 2 freq itherwye (6) - 1 freq itherwyse (6) - 1 freq iverywhur (6) - 1 freq itherweys (6) - 9 freq itherwyce (6) - 3 freq itherwise' (6) - 4 freq everywhaur (6) - 6 freq itherweis (6) - 1 freq itherwyes (6) - 2 freq itherweese (6) - 1 freq therefur (6) - 1 freq itherwise (6) - 61 freq itherwyss (6) - 5 freq thrower (7) - 1 freq everywhar (7) - 1 freq everywhair (7) - 1 freq |
SoundEx code - I366 itherwarld - 3 freq itherworld - 1 freq itherwhaur - 2 freq itherwhaurs - 1 freq idder-wirdly - 1 freq itherwardlie - 1 freq ither-wardly - 1 freq itherairts - 1 freq |
MetaPhone code - I0RHR itherwhaur - 2 freq |
ITHERWHAUR |
| Time to execute Levenshtein function - 0.254014 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.444962 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.035966 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.090681 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.000890 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. |