Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gemmer (0) - 1 freq memmer (1) - 35 freq hemmer (1) - 21 freq gemme (1) - 102 freq gemmes (1) - 74 freq gemmel (1) - 1 freq gimmer (1) - 2 freq bummer (2) - 21 freq hammer (2) - 44 freq gomper (2) - 3 freq gimme (2) - 4 freq gimmers (2) - 3 freq gemma (2) - 18 freq kimmer (2) - 6 freq grammer (2) - 3 freq himmer (2) - 1 freq nummer (2) - 336 freq grimmer (2) - 1 freq gemmely (2) - 1 freq gremmar (2) - 52 freq gender (2) - 19 freq glimer (2) - 1 freq hemme (2) - 2 freq hummer (2) - 2 freq gemmin (2) - 1 freq |
gemmer (0) - 1 freq gimmer (1) - 2 freq gemmes (2) - 74 freq gemmel (2) - 1 freq hemmer (2) - 21 freq memmer (2) - 35 freq gemme (2) - 102 freq limmer (3) - 19 freq jimmer (3) - 5 freq lammer (3) - 2 freq immer (3) - 2 freq zimmer (3) - 3 freq yammer (3) - 5 freq simmer (3) - 309 freq gemms (3) - 14 freq wummer (3) - 1 freq gemiler (3) - 3 freq glimmer (3) - 15 freq gemmies (3) - 1 freq dammer (3) - 1 freq timmer (3) - 77 freq summer (3) - 196 freq gemm (3) - 53 freq vimmer (3) - 3 freq gemmle (3) - 2 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 |
GEMMER |
Time to execute Levenshtein function - 0.188189 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.387113 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.032132 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.043580 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.000945 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. |