| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| otz (0) - 1 freq ptz (1) - 1 freq ots (1) - 2 freq oto (1) - 1 freq ootz (1) - 1 freq ot (1) - 17 freq rtz (1) - 2 freq itz (1) - 2 freq oz (1) - 15 freq o'z (1) - 6 freq otq (1) - 2 freq osz (1) - 1 freq otj (1) - 1 freq ott (1) - 4 freq obz (1) - 1 freq otb (1) - 1 freq vtz (1) - 1 freq gtz (1) - 1 freq 'taz (2) - 1 freq jgz (2) - 1 freq 'ts (2) - 3 freq fjz (2) - 1 freq its (2) - 3335 freq oki (2) - 5 freq mmz (2) - 1 freq |
otz (0) - 1 freq ootz (1) - 1 freq itz (1) - 2 freq otb (2) - 1 freq vtz (2) - 1 freq obz (2) - 1 freq ott (2) - 4 freq ytzo (2) - 1 freq tzu (2) - 1 freq tiz (2) - 3 freq otj (2) - 1 freq gtz (2) - 1 freq taz (2) - 21 freq ots (2) - 2 freq oto (2) - 1 freq osz (2) - 1 freq ptz (2) - 1 freq ot (2) - 17 freq otq (2) - 2 freq rtz (2) - 2 freq o'z (2) - 6 freq oz (2) - 15 freq az (3) - 1 freq utj (3) - 1 freq atv (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 - 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 |
OTZ |
| Time to execute Levenshtein function - 0.189478 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.330858 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.027971 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.037951 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.000918 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. |