| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootlet (0) - 4 freq ooclet (1) - 1 freq ootset (1) - 15 freq ootlat (1) - 6 freq ootlets (1) - 6 freq outlet (1) - 3 freq oolit (2) - 2 freq ootlan (2) - 1 freq rootet (2) - 1 freq oolt (2) - 1 freq poulet (2) - 1 freq houlet (2) - 9 freq motet (2) - 3 freq titlet (2) - 1 freq dooblet (2) - 2 freq ootrel (2) - 3 freq outset (2) - 1 freq ootsets (2) - 6 freq boglet (2) - 1 freq ootae (2) - 90 freq ootlats (2) - 2 freq hoolet (2) - 106 freq hoo-let (2) - 1 freq ootpit (2) - 28 freq toilet (2) - 93 freq |
ootlet (0) - 4 freq ootlat (1) - 6 freq outlet (1) - 3 freq ootlets (2) - 6 freq toilet (2) - 93 freq ootset (2) - 15 freq ooclet (2) - 1 freq ootlyn (3) - 1 freq ettlet (3) - 8 freq ootleuk (3) - 3 freq ootht (3) - 4 freq ootlin (3) - 12 freq tooslet (3) - 1 freq ootfit (3) - 12 freq outlets (3) - 1 freq tolt (3) - 138 freq toalt (3) - 1 freq toult (3) - 1 freq ootpit (3) - 28 freq ootput (3) - 2 freq ootlay (3) - 1 freq tootlt (3) - 1 freq voilet (3) - 1 freq oolt (3) - 1 freq houlet (3) - 9 freq |
SoundEx code - O343 ootlet - 4 freq outlawed - 4 freq ootwaled - 1 freq ootlat - 6 freq ootlats - 2 freq ootlets - 6 freq outlet - 3 freq outlets - 1 freq |
MetaPhone code - OTLT ootlet - 4 freq ootlat - 6 freq outlet - 3 freq |
OOTLET |
| Time to execute Levenshtein function - 0.583221 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.794294 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.078497 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.037667 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.000907 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. |