| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| odes (0) - 5 freq des (1) - 23 freq owes (1) - 4 freq odets (1) - 1 freq codes (1) - 4 freq bodes (1) - 3 freq ode (1) - 13 freq modes (1) - 2 freq oes (1) - 2 freq obes (1) - 1 freq odjs (1) - 1 freq ones (1) - 30 freq godes (1) - 2 freq odds (1) - 89 freq dides (2) - 1 freq pods (2) - 7 freq ade (2) - 3 freq raes (2) - 2 freq onee (2) - 2 freq hades (2) - 4 freq kies (2) - 1 freq 'dis (2) - 10 freq opps (2) - 1 freq pores (2) - 4 freq oxen (2) - 2 freq |
odes (0) - 5 freq des (1) - 23 freq daes (2) - 213 freq das (2) - 23 freq ideas (2) - 145 freq dees (2) - 41 freq idees (2) - 3 freq dyes (2) - 4 freq deus (2) - 17 freq deys (2) - 9 freq deis (2) - 1 freq dies (2) - 5 freq dus (2) - 24 freq dese (2) - 6 freq does (2) - 375 freq deas (2) - 1 freq desi (2) - 1 freq ds (2) - 9 freq eds (2) - 9 freq ids (2) - 63 freq dos (2) - 4 freq ads (2) - 9 freq dis (2) - 1549 freq dues (2) - 10 freq adaes (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 |
ODES |
| Time to execute Levenshtein function - 0.317801 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.505340 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.063468 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.038506 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.001082 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. |