| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ottojizzmark (0) - 1 freq ottoman (6) - 1 freq tidemark (6) - 2 freq topiary (7) - 2 freq bizzard (7) - 1 freq oot-of-wark (7) - 1 freq tonibear (7) - 1 freq documark (7) - 3 freq blizzard (7) - 4 freq trizzure (7) - 5 freq primark (7) - 6 freq jimmack (7) - 11 freq philbinmark (7) - 1 freq wizzard (7) - 1 freq bizzare (7) - 1 freq bookmark (7) - 1 freq tattiepark (7) - 1 freq stonewark (7) - 1 freq othmar (7) - 1 freq optimal (7) - 1 freq wattermark (7) - 1 freq tidemarks (7) - 1 freq thomasm (8) - 5 freq mizzour (8) - 3 freq blizzards (8) - 1 freq |
ottojizzmark (0) - 1 freq tidemark (10) - 2 freq trizzure (11) - 5 freq ottoman (11) - 1 freq wattermark (11) - 1 freq tattiepark (11) - 1 freq othmar (12) - 1 freq jazzers (12) - 1 freq tidemarks (12) - 1 freq pitt-mirk (12) - 1 freq stonewark (12) - 1 freq pitmirk (12) - 9 freq themirk (12) - 1 freq jazzer (12) - 1 freq eastendmark (12) - 1 freq pit-mirk (12) - 3 freq attrak (12) - 1 freq tejmuk (12) - 2 freq primark (12) - 6 freq jimmack (12) - 11 freq bookmark (12) - 1 freq documark (12) - 3 freq bizzard (12) - 1 freq oot-of-wark (12) - 1 freq philbinmark (12) - 1 freq |
SoundEx code - O322 ootguessed - 1 freq ootweighs - 1 freq ootgies - 1 freq ootcasts - 1 freq oot-hooses - 1 freq odoake's - 1 freq ootsized - 1 freq outcast - 2 freq ootsize - 1 freq ootcast - 2 freq oatcakes - 22 freq odysseus - 5 freq oothooses - 3 freq oatcake - 1 freq outhouses - 1 freq ottojizzmark - 1 freq oeidsus - 1 freq |
MetaPhone code - OTJSMRK ottojizzmark - 1 freq |
OTTOJIZZMARK |
| Time to execute Levenshtein function - 0.304834 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.762902 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.031064 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.166158 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.000914 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. |