| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lammer (0) - 2 freq limmer (1) - 19 freq dammer (1) - 1 freq hammer (1) - 44 freq slammer (1) - 1 freq yammer (1) - 5 freq yammert (2) - 1 freq summer (2) - 202 freq simmer (2) - 314 freq hummer (2) - 2 freq lapper (2) - 1 freq hamper (2) - 3 freq lemme (2) - 4 freq lager (2) - 39 freq hemmer (2) - 21 freq limmers (2) - 4 freq rammel (2) - 1 freq dammed (2) - 2 freq laiter (2) - 4 freq sclammer (2) - 2 freq lambeg (2) - 5 freq himmer (2) - 1 freq memmer (2) - 35 freq warmer (2) - 25 freq namer (2) - 1 freq |
lammer (0) - 2 freq limmer (1) - 19 freq slammer (2) - 1 freq yammer (2) - 5 freq hammer (2) - 44 freq dammer (2) - 1 freq haimmer (3) - 30 freq jimmer (3) - 5 freq immer (3) - 2 freq lamour (3) - 1 freq flimmer (3) - 2 freq timmer (3) - 80 freq gimmer (3) - 2 freq lammies (3) - 5 freq lammin (3) - 2 freq gemmer (3) - 1 freq lammas (3) - 8 freq glammery (3) - 1 freq nummer (3) - 336 freq lumner (3) - 1 freq vimmer (3) - 3 freq commer (3) - 1 freq glimmer (3) - 17 freq plummer (3) - 1 freq climmer (3) - 1 freq |
SoundEx code - L560 lammer - 2 freq limmer - 19 freq lamour - 1 freq linner - 2 freq l'amour - 1 freq liner - 4 freq loner - 1 freq launer - 1 freq linear - 3 freq lunar - 1 freq limnar - 1 freq lumner - 1 freq lawnmower - 1 freq lner - 1 freq |
MetaPhone code - LMR lammer - 2 freq limmer - 19 freq lamour - 1 freq lumber - 5 freq l'amour - 1 freq limber - 2 freq |
LAMMER |
| Time to execute Levenshtein function - 0.195079 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.369803 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.027067 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.037240 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.000922 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. |