Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gimmer (0) - 2 freq immer (1) - 2 freq jimmer (1) - 5 freq grimmer (1) - 1 freq glimmer (1) - 17 freq simmer (1) - 314 freq gimme (1) - 4 freq vimmer (1) - 3 freq kimmer (1) - 6 freq limmer (1) - 19 freq gemmer (1) - 1 freq himmer (1) - 1 freq zimmer (1) - 3 freq timmer (1) - 80 freq gimmers (1) - 5 freq swimmer (2) - 3 freq gither (2) - 69 freq gemmes (2) - 74 freq glimmert (2) - 2 freq dimmed (2) - 5 freq limmers (2) - 4 freq summer (2) - 202 freq lammer (2) - 2 freq timmers (2) - 6 freq wimmen (2) - 39 freq |
gimmer (0) - 2 freq gemmer (1) - 1 freq limmer (2) - 19 freq zimmer (2) - 3 freq timmer (2) - 80 freq gimmers (2) - 5 freq kimmer (2) - 6 freq himmer (2) - 1 freq jimmer (2) - 5 freq vimmer (2) - 3 freq immer (2) - 2 freq glimmer (2) - 17 freq grimmer (2) - 1 freq gimme (2) - 4 freq simmer (2) - 314 freq nummer (3) - 336 freq suimmer (3) - 1 freq yammer (3) - 5 freq glimer (3) - 1 freq simmir (3) - 1 freq gomper (3) - 3 freq grammer (3) - 3 freq bummer (3) - 21 freq hummer (3) - 2 freq commer (3) - 1 freq |
SoundEx code - G560 gonorrhoea - 1 freq gemmer - 1 freq gomorrah - 2 freq gimmer - 2 freq gunnar - 6 freq goner - 4 freq genre - 9 freq ganner - 1 freq gener - 1 freq gonner - 1 freq geynear - 2 freq gunner - 2 freq gamrie - 5 freq gey-near - 1 freq gnar - 1 freq gonhorrea - 1 freq gwenmairi - 1 freq |
MetaPhone code - JMR gemmer - 1 freq gimmer - 2 freq jimmer - 5 freq jimmoray - 1 freq joemurray - 1 freq |
GIMMER |
Time to execute Levenshtein function - 0.177598 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.340858 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.027884 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.039435 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.000920 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. |