| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oots (0) - 22 freq dots (1) - 7 freq moots (1) - 3 freq orts (1) - 3 freq lots (1) - 76 freq ots (1) - 2 freq jots (1) - 5 freq ootd (1) - 2 freq oats (1) - 36 freq poots (1) - 3 freq roots (1) - 67 freq cots (1) - 2 freq oos (1) - 1 freq oors (1) - 353 freq pots (1) - 44 freq oohs (1) - 1 freq oot- (1) - 1 freq oot' (1) - 4 freq coots (1) - 1 freq ooto (1) - 85 freq tots (1) - 4 freq outs (1) - 1 freq ootz (1) - 1 freq nots (1) - 2 freq hots (1) - 1 freq |
oots (0) - 22 freq oats (1) - 36 freq ots (1) - 2 freq outs (1) - 1 freq ooty (2) - 21 freq o'ts (2) - 2 freq aits (2) - 21 freq ts (2) - 41 freq oot (2) - 13735 freq boots (2) - 89 freq rots (2) - 4 freq hoots (2) - 9 freq oates (2) - 1 freq bots (2) - 4 freq oops (2) - 18 freq eits (2) - 1 freq toys (2) - 42 freq aats (2) - 10 freq eats (2) - 29 freq ats (2) - 126 freq aets (2) - 11 freq toes (2) - 48 freq wots (2) - 3 freq tos (2) - 3 freq yits (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 |
OOTS |
| Time to execute Levenshtein function - 0.253441 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.594801 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.063869 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.044862 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.000832 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. |