| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jotter (0) - 31 freq otter (1) - 3 freq totter (1) - 2 freq potter (1) - 29 freq sotter (1) - 34 freq cotter (1) - 3 freq jotters (1) - 23 freq hotter (1) - 8 freq gutter (2) - 33 freq wetter (2) - 4 freq totier (2) - 1 freq bottem (2) - 1 freq litter (2) - 16 freq tottier (2) - 2 freq router (2) - 1 freq dooter (2) - 3 freq witter (2) - 10 freq pooter (2) - 1 freq jolted (2) - 5 freq joaker (2) - 1 freq hottert (2) - 1 freq loiter (2) - 1 freq lottery (2) - 29 freq fother (2) - 4 freq pitter (2) - 2 freq |
jotter (0) - 31 freq hotter (2) - 8 freq otter (2) - 3 freq jittery (2) - 3 freq cotter (2) - 3 freq jotters (2) - 23 freq totter (2) - 2 freq potter (2) - 29 freq sotter (2) - 34 freq sitter (3) - 1 freq jester (3) - 4 freq fitter (3) - 5 freq cutter (3) - 5 freq tooter (3) - 4 freq letter (3) - 240 freq jottit (3) - 1 freq cottar (3) - 28 freq hoatter (3) - 1 freq watter (3) - 1033 freq mutter (3) - 10 freq jitters (3) - 1 freq atter (3) - 1 freq dottir (3) - 1 freq patter (3) - 56 freq putter (3) - 1 freq |
SoundEx code - J360 jotter - 31 freq jittery - 3 freq jooder - 1 freq jethro - 2 freq jater - 1 freq joeedwyer - 1 freq |
MetaPhone code - JTR jotter - 31 freq jittery - 3 freq jooder - 1 freq gied-owre - 1 freq gitter - 1 freq jater - 1 freq |
JOTTER |
| Time to execute Levenshtein function - 0.211240 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.359979 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.029744 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.039118 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.000928 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. |