Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lesser (0) - 29 freq yesser (1) - 1 freq lessen (1) - 10 freq glesses (2) - 96 freq sesse (2) - 1 freq sester (2) - 2 freq less' (2) - 1 freq ledger (2) - 1 freq plester (2) - 2 freq leader (2) - 58 freq lossen (2) - 1 freq yessers (2) - 2 freq aesier (2) - 13 freq fessed (2) - 5 freq leer (2) - 4 freq fesses (2) - 1 freq elosser (2) - 1 freq clessed (2) - 1 freq gessed (2) - 1 freq vessel (2) - 7 freq closser (2) - 13 freq fessen (2) - 1 freq leifer (2) - 2 freq laser (2) - 4 freq lessens (2) - 1 freq |
lesser (0) - 29 freq elosser (2) - 1 freq lessen (2) - 10 freq yesser (2) - 1 freq kisser (3) - 5 freq laser (3) - 4 freq leesur (3) - 1 freq looser (3) - 2 freq wasser (3) - 1 freq nasser (3) - 1 freq losses (3) - 15 freq lissen (3) - 10 freq lasses (3) - 69 freq sasser (3) - 11 freq slessor (3) - 4 freq closser (3) - 13 freq lesson (3) - 107 freq lossen (3) - 1 freq tosser (3) - 2 freq leister (3) - 2 freq dosser (3) - 1 freq less' (3) - 1 freq less (3) - 539 freq lister (3) - 6 freq leisur (3) - 4 freq |
SoundEx code - L260 leisure - 26 freq luxury - 16 freq lesser - 29 freq liquor - 7 freq liker - 9 freq lookir - 1 freq laugher - 1 freq looker - 8 freq laicher - 5 freq lager - 38 freq leesure - 4 freq lecher - 1 freq lycra - 2 freq lacquer - 2 freq locker - 3 freq loser - 4 freq luxurie - 1 freq luckier - 5 freq le'sure - 1 freq lugar - 4 freq leesuir - 1 freq liqueur - 2 freq ligger - 1 freq laser - 4 freq loccery - 1 freq looser - 2 freq leisur - 4 freq leesur - 1 freq logger - 1 freq lyker - 2 freq luxure - 1 freq look-owre - 1 freq luk-ower - 4 freq lxr - 1 freq licker - 1 freq lzra - 1 freq lgr - 1 freq lukeyhear - 1 freq lgaur - 1 freq lswhr - 1 freq |
MetaPhone code - LSR leisure - 26 freq lesser - 29 freq leesure - 4 freq loser - 4 freq le'sure - 1 freq leesuir - 1 freq laser - 4 freq looser - 2 freq leisur - 4 freq leesur - 1 freq lzra - 1 freq lswhr - 1 freq |
LESSER |
Time to execute Levenshtein function - 0.703158 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 - 1.010317 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.092710 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.103713 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.001080 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. |