| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limmers (0) - 4 freq immers (1) - 2 freq simmers (1) - 16 freq glimmers (1) - 1 freq limmer (1) - 19 freq gimmers (1) - 5 freq timmers (1) - 6 freq swimmers (2) - 2 freq immerse (2) - 3 freq simmerd (2) - 1 freq jimmer (2) - 5 freq limms (2) - 1 freq lumbers (2) - 3 freq liners (2) - 2 freq climmer (2) - 1 freq bummers (2) - 18 freq rimers (2) - 1 freq kimmer (2) - 6 freq timbers (2) - 5 freq lammer (2) - 2 freq limmy's (2) - 1 freq glimmer (2) - 17 freq lingers (2) - 5 freq gimmer (2) - 2 freq hammers (2) - 6 freq |
limmers (0) - 4 freq timmers (2) - 6 freq limmer (2) - 19 freq gimmers (2) - 5 freq glimmers (2) - 1 freq simmers (2) - 16 freq immers (2) - 2 freq vimmirs (3) - 1 freq hemmers (3) - 1 freq hammers (3) - 6 freq slummers (3) - 1 freq haimmers (3) - 1 freq emmers (3) - 4 freq summers (3) - 13 freq limmy's (3) - 1 freq nummers (3) - 110 freq memmers (3) - 41 freq yammers (3) - 3 freq lammer (3) - 2 freq limms (3) - 1 freq immerse (3) - 3 freq bummers (3) - 18 freq lumbers (3) - 3 freq timmer's (4) - 1 freq timmert (4) - 1 freq |
SoundEx code - L562 lanarkshire - 18 freq lawnmowers - 1 freq lanark - 29 freq lunmerhaugh - 1 freq limmerhaugh - 1 freq launmerks - 1 freq limmers - 4 freq lanrick - 1 freq loners - 1 freq limerick - 7 freq limericks - 1 freq lanrik - 2 freq lanrikshire - 2 freq lamarck - 1 freq lanercost - 1 freq liners - 2 freq leonrousseau - 75 freq |
MetaPhone code - LMRS lumbers - 3 freq limmers - 4 freq |
LIMMERS |
| Time to execute Levenshtein function - 0.245626 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.428125 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.030676 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.039682 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.000863 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. |