| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oaths (0) - 3 freq oats (1) - 37 freq oates (1) - 1 freq baths (1) - 35 freq paths (1) - 32 freq maths (1) - 35 freq oath (1) - 13 freq matha (2) - 2 freq path's (2) - 5 freq loathe (2) - 2 freq sats (2) - 1 freq othe (2) - 4 freq fat's (2) - 6 freq vath (2) - 1 freq nats (2) - 2 freq mates (2) - 90 freq oots (2) - 23 freq outs (2) - 1 freq kyths (2) - 6 freq cath (2) - 4 freq nat's (2) - 1 freq bathes (2) - 1 freq datfs (2) - 1 freq vats (2) - 2 freq ots (2) - 2 freq |
oaths (0) - 3 freq ths (2) - 5 freq aiths (2) - 3 freq youths (2) - 6 freq oath (2) - 13 freq oats (2) - 37 freq maths (2) - 35 freq baths (2) - 35 freq oates (2) - 1 freq paths (2) - 32 freq lathes (3) - 1 freq fahs (3) - 2 freq thos (3) - 1 freq daiths (3) - 10 freq liths (3) - 2 freq pathos (3) - 5 freq thas (3) - 2 freq myths (3) - 18 freq ates (3) - 1 freq eat's (3) - 1 freq atho (3) - 3 freq mooths (3) - 76 freq this (3) - 11303 freq ooohs (3) - 1 freq thys (3) - 1 freq |
SoundEx code - O320 ots - 2 freq odds - 91 freq odyssey - 6 freq oots - 23 freq oidhche - 1 freq odes - 5 freq oats - 37 freq oats' - 1 freq outch - 1 freq oothoose - 10 freq ootz - 1 freq ootac - 1 freq o't's - 2 freq oaths - 3 freq otago - 2 freq ootgie - 5 freq o'ts - 2 freq odoak' - 1 freq odious - 4 freq oot-tak - 1 freq oot-hoose - 1 freq oottake - 1 freq odxx - 1 freq otz - 1 freq outs - 1 freq odjs - 1 freq o'those - 1 freq o'thise - 1 freq ohdogoaway - 2 freq odige - 1 freq ottzs - 1 freq otq - 2 freq oates - 1 freq otj - 1 freq |
MetaPhone code - O0S oothoose - 10 freq oaths - 3 freq o'those - 1 freq o'thise - 1 freq |
OATHS |
| Time to execute Levenshtein function - 0.205452 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.525042 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.030102 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.081663 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.000866 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. |