| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| odysseus (0) - 5 freq odyssean (2) - 2 freq odyssey (2) - 6 freq ulysses (3) - 1 freq desses (3) - 1 freq dosses (3) - 2 freq oysters (3) - 1 freq dyshes (3) - 1 freq dossers (3) - 3 freq dywnes (4) - 1 freq onsets (4) - 2 freq vlisses (4) - 2 freq owerseys (4) - 8 freq reassess (4) - 1 freq dysted (4) - 1 freq oorsels (4) - 140 freq presses (4) - 23 freq dykes (4) - 44 freq messes (4) - 1 freq discus (4) - 1 freq odgers (4) - 1 freq odoake's (4) - 1 freq tossels (4) - 1 freq glosses (4) - 2 freq assets (4) - 14 freq |
odysseus (0) - 5 freq dosses (3) - 2 freq desses (3) - 1 freq odyssean (3) - 2 freq odyssey (3) - 6 freq dyshes (4) - 1 freq ulysses (4) - 1 freq dossers (4) - 3 freq doses (5) - 9 freq wisses (5) - 4 freq dresses (5) - 18 freq assess (5) - 7 freq busses (5) - 18 freq masses (5) - 12 freq dosser (5) - 1 freq pusses (5) - 6 freq oeidsus (5) - 1 freq dossiers (5) - 1 freq pisses (5) - 4 freq lasses (5) - 69 freq disaises (5) - 5 freq casses (5) - 1 freq wusses (5) - 1 freq kyisses (5) - 1 freq guesses (5) - 6 freq |
SoundEx code - O322 ootguessed - 1 freq ootweighs - 1 freq ootgies - 1 freq ootcasts - 1 freq oot-hooses - 1 freq odoake's - 1 freq ootsized - 1 freq outcast - 2 freq ootsize - 1 freq ootcast - 2 freq oatcakes - 22 freq odysseus - 5 freq oothooses - 3 freq oatcake - 1 freq outhouses - 1 freq ottojizzmark - 1 freq oeidsus - 1 freq |
MetaPhone code - OTSS ootsize - 1 freq odysseus - 5 freq ottzs - 1 freq oeidsus - 1 freq |
ODYSSEUS |
| Time to execute Levenshtein function - 0.190474 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.369529 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.027943 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.038558 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.000850 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. |