| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oots (0) - 23 freq o'ts (1) - 2 freq ootd (1) - 2 freq poots (1) - 3 freq oohs (1) - 1 freq oors (1) - 357 freq wots (1) - 3 freq doots (1) - 35 freq cots (1) - 2 freq lots (1) - 80 freq pots (1) - 46 freq moots (1) - 3 freq oota (1) - 54 freq oot (1) - 13916 freq oot' (1) - 4 freq outs (1) - 1 freq ots (1) - 2 freq ooty (1) - 21 freq ootz (1) - 1 freq tots (1) - 4 freq rots (1) - 4 freq jots (1) - 5 freq ooto (1) - 85 freq nots (1) - 2 freq oats (1) - 37 freq |
oots (0) - 23 freq outs (1) - 1 freq oats (1) - 37 freq ots (1) - 2 freq roots (2) - 68 freq bots (2) - 4 freq orts (2) - 3 freq toots (2) - 4 freq coots (2) - 1 freq oos (2) - 1 freq boots (2) - 92 freq oops (2) - 18 freq ts (2) - 44 freq hots (2) - 1 freq yits (2) - 1 freq eets (2) - 58 freq toys (2) - 45 freq aits (2) - 21 freq eats (2) - 30 freq ats (2) - 126 freq aats (2) - 10 freq toes (2) - 48 freq eits (2) - 1 freq its (2) - 3335 freq tos (2) - 3 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 - OTS ots - 2 freq odds - 91 freq odyssey - 6 freq oots - 23 freq odes - 5 freq oats - 37 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 |
OOTS |
| Time to execute Levenshtein function - 0.315646 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.467273 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.029054 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.038135 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.000899 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. |