| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jotter (0) - 28 freq cotter (1) - 3 freq totter (1) - 2 freq otter (1) - 3 freq potter (1) - 24 freq jotters (1) - 23 freq sotter (1) - 34 freq hotter (1) - 8 freq softer (2) - 4 freq plotter (2) - 1 freq bitter (2) - 109 freq tatter (2) - 1 freq trotter (2) - 5 freq hoatter (2) - 1 freq jooder (2) - 1 freq pottery (2) - 5 freq gitter (2) - 1 freq latter (2) - 24 freq bottem (2) - 1 freq dottert (2) - 1 freq pitter (2) - 2 freq mutter (2) - 10 freq souter (2) - 9 freq dowter (2) - 8 freq potters (2) - 12 freq |
jotter (0) - 28 freq hotter (2) - 8 freq jittery (2) - 3 freq cotter (2) - 3 freq jotters (2) - 23 freq sotter (2) - 34 freq totter (2) - 2 freq potter (2) - 24 freq otter (2) - 3 freq setter (3) - 4 freq gutter (3) - 32 freq butter (3) - 129 freq patter (3) - 53 freq mitter (3) - 1 freq netter (3) - 6 freq totier (3) - 1 freq nutter (3) - 5 freq etter (3) - 2 freq atter (3) - 1 freq metter (3) - 53 freq jester (3) - 4 freq jottit (3) - 1 freq jetted (3) - 1 freq titter (3) - 1 freq yitter (3) - 1 freq |
SoundEx code - J360 jotter - 28 freq jittery - 3 freq jooder - 1 freq jethro - 2 freq jater - 1 freq joeedwyer - 1 freq |
MetaPhone code - JTR jotter - 28 freq jittery - 3 freq jooder - 1 freq gied-owre - 1 freq gitter - 1 freq jater - 1 freq |
JOTTER |
| Time to execute Levenshtein function - 0.196274 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.325539 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.027184 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.036374 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.000790 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. |