| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| odysseus (0) - 5 freq odyssey (2) - 6 freq odyssean (2) - 2 freq oysters (3) - 2 freq dyshes (3) - 1 freq dosses (3) - 2 freq dossers (3) - 3 freq ulysses (3) - 1 freq desses (3) - 1 freq grasses (4) - 8 freq offysers (4) - 1 freq dysel (4) - 13 freq offyshes (4) - 1 freq advisers (4) - 2 freq 'missus (4) - 2 freq dykes (4) - 44 freq losses (4) - 15 freq glesses (4) - 96 freq odets (4) - 1 freq blisses (4) - 3 freq prossess (4) - 1 freq disters (4) - 1 freq tassels (4) - 1 freq onyane's (4) - 1 freq plisses (4) - 4 freq |
odysseus (0) - 5 freq dosses (3) - 2 freq desses (3) - 1 freq odyssean (3) - 2 freq odyssey (3) - 6 freq ulysses (4) - 1 freq dossers (4) - 3 freq dyshes (4) - 1 freq desers (5) - 1 freq pisses (5) - 4 freq fesses (5) - 1 freq dossed (5) - 1 freq kisses (5) - 29 freq basses (5) - 2 freq bosses (5) - 9 freq asses (5) - 2 freq uisses (5) - 2 freq wusses (5) - 1 freq lasses (5) - 69 freq oeidsus (5) - 1 freq kyisses (5) - 1 freq wisses (5) - 4 freq guesses (5) - 6 freq advises (5) - 2 freq daseis (5) - 1 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.191504 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.336881 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.027441 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.037107 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.000903 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. |