| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oats (0) - 36 freq aats (1) - 10 freq mats (1) - 8 freq ots (1) - 2 freq lats (1) - 26 freq bats (1) - 34 freq vats (1) - 2 freq oats' (1) - 1 freq ats (1) - 126 freq poats (1) - 2 freq boats (1) - 107 freq oafs (1) - 1 freq oars (1) - 25 freq gats (1) - 1 freq oaks (1) - 1 freq eats (1) - 29 freq nats (1) - 2 freq cats (1) - 122 freq tats (1) - 1 freq rats (1) - 28 freq sats (1) - 1 freq oat (1) - 12 freq orts (1) - 3 freq pats (1) - 14 freq goats (1) - 17 freq |
oats (0) - 36 freq oates (1) - 1 freq aats (1) - 10 freq eats (1) - 29 freq oots (1) - 22 freq ats (1) - 126 freq ots (1) - 2 freq outs (1) - 1 freq coats (2) - 27 freq 'ats (2) - 10 freq oaths (2) - 3 freq hats (2) - 45 freq eits (2) - 1 freq fats (2) - 2 freq loats (2) - 2 freq oath (2) - 13 freq taas (2) - 1 freq ts (2) - 41 freq ates (2) - 1 freq taes (2) - 104 freq eets (2) - 58 freq aets (2) - 11 freq yits (2) - 1 freq oaps (2) - 4 freq toays (2) - 1 freq |
SoundEx code - O320 ots - 2 freq odds - 89 freq odyssey - 6 freq oots - 22 freq oidhche - 1 freq odes - 5 freq oats - 36 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 - OTS ots - 2 freq odds - 89 freq odyssey - 6 freq oots - 22 freq odes - 5 freq oats - 36 freq oats' - 1 freq ootz - 1 freq o't's - 2 freq o'ts - 2 freq odious - 4 freq otz - 1 freq outs - 1 freq oates - 1 freq |
OATS |
| Time to execute Levenshtein function - 0.322231 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.788423 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.093339 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.102765 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.001161 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. |