| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootgie (0) - 5 freq ootgies (1) - 1 freq bootie (2) - 1 freq lottie (2) - 2 freq coggie (2) - 5 freq totie (2) - 18 freq moothie (2) - 4 freq bogie (2) - 24 freq oossie (2) - 1 freq ootgate (2) - 1 freq coothie (2) - 4 freq footie (2) - 2 freq pottie (2) - 10 freq joggie (2) - 2 freq forgie (2) - 92 freq boggie (2) - 4 freq ologie (2) - 1 freq ootae (2) - 90 freq fogie (2) - 1 freq boygie (2) - 2 freq oozie (2) - 1 freq gorgie (2) - 3 freq ootgane (2) - 1 freq oottae (2) - 1 freq vogie (2) - 3 freq |
ootgie (0) - 5 freq ootgies (2) - 1 freq ootwi (3) - 17 freq ootgoin (3) - 1 freq ootgaen (3) - 1 freq logie (3) - 12 freq oottae (3) - 1 freq ootgane (3) - 1 freq cogie (3) - 6 freq vogie (3) - 3 freq ootin (3) - 5 freq ootdae (3) - 5 freq tgi (3) - 1 freq ootbye (3) - 98 freq dougie (3) - 125 freq boygie (3) - 2 freq ootgait (3) - 1 freq doogie (3) - 1 freq boogie (3) - 3 freq fogie (3) - 1 freq ootgate (3) - 1 freq bogie (3) - 24 freq ologie (3) - 1 freq totie (3) - 18 freq ootae (3) - 90 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 - OTJ ootgie - 5 freq odige - 1 freq otj - 1 freq |
OOTGIE |
| Time to execute Levenshtein function - 0.179004 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.343307 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.027515 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.038266 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.000913 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. |