| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flimmer (0) - 2 freq limmer (1) - 19 freq glimmer (1) - 17 freq climmer (1) - 1 freq suimmer (2) - 1 freq haimmer (2) - 30 freq climmed (2) - 13 freq fairmer (2) - 65 freq shimmer (2) - 4 freq lammer (2) - 2 freq gimmer (2) - 2 freq trimmer (2) - 1 freq flipper (2) - 2 freq slammer (2) - 1 freq limmers (2) - 4 freq grimmer (2) - 1 freq 'simmer (2) - 1 freq flinger (2) - 1 freq slummer (2) - 3 freq flamer (2) - 1 freq glimmert (2) - 2 freq himmer (2) - 1 freq vimmer (2) - 3 freq limber (2) - 2 freq glimer (2) - 1 freq |
flimmer (0) - 2 freq glimmer (2) - 17 freq climmer (2) - 1 freq limmer (2) - 19 freq flamer (3) - 1 freq slummer (3) - 3 freq slammer (3) - 1 freq lammer (3) - 2 freq plummer (3) - 1 freq firmer (4) - 4 freq kimmer (4) - 6 freq simmer (4) - 314 freq flitter (4) - 1 freq climmen (4) - 1 freq flicker (4) - 13 freq jimmer (4) - 5 freq flemmin (4) - 2 freq flummox (4) - 1 freq glammery (4) - 1 freq swimmer (4) - 3 freq timmer (4) - 80 freq immer (4) - 2 freq skimmer (4) - 7 freq zimmer (4) - 3 freq flier (4) - 1 freq |
SoundEx code - F456 flamer - 1 freq flinrichen - 1 freq flame-haired - 1 freq flimmer - 2 freq fulmars - 2 freq fellow-mortal - 1 freq feelin-herted - 1 freq fulmart - 1 freq fulmartis - 1 freq flamarrion - 1 freq feliamort - 1 freq fulmar - 2 freq |
MetaPhone code - FLMR flamer - 1 freq flimmer - 2 freq fulmar - 2 freq |
FLIMMER |
| Time to execute Levenshtein function - 0.233906 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.408436 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.028934 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.045216 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.001060 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. |