| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gemmle (0) - 2 freq gemme (1) - 105 freq gemmule (1) - 1 freq demmle (1) - 2 freq tremmle (2) - 5 freq gemmin (2) - 1 freq gimme (2) - 4 freq hemme (2) - 2 freq nemme (2) - 9 freq gemma (2) - 18 freq wummle (2) - 1 freq gemmies (2) - 1 freq rammle (2) - 3 freq mummle (2) - 4 freq jummle (2) - 5 freq gentle (2) - 81 freq gamble (2) - 13 freq timmle (2) - 4 freq fummle (2) - 5 freq gemmer (2) - 1 freq gemmes (2) - 74 freq jemmie (2) - 4 freq hummle (2) - 12 freq gemmely (2) - 1 freq tummle (2) - 19 freq |
gemmle (0) - 2 freq gemmule (1) - 1 freq gemmel (2) - 1 freq gemmely (2) - 1 freq demmle (2) - 2 freq gemme (2) - 105 freq tummle (3) - 19 freq wammle (3) - 2 freq gemmes (3) - 74 freq gemmer (3) - 1 freq hummle (3) - 12 freq nimmle (3) - 2 freq gemms (3) - 14 freq grummle (3) - 4 freq rummle (3) - 21 freq gemmelt (3) - 1 freq fummle (3) - 5 freq gemm (3) - 53 freq gammie (3) - 4 freq gemma (3) - 18 freq wummle (3) - 1 freq timmle (3) - 4 freq gimme (3) - 4 freq gemmin (3) - 1 freq rammle (3) - 3 freq |
SoundEx code - G540 gunnel - 2 freq gunnul - 2 freq gemmle - 2 freq gunnal - 1 freq gumlie - 4 freq gemmule - 1 freq gemmel - 1 freq gemmely - 1 freq goeen'll - 1 freq gmail - 1 freq gunhill - 2 freq gun-ile - 1 freq genial - 2 freq gqnlu - 1 freq gamell - 1 freq |
MetaPhone code - JML gemmle - 2 freq gemmule - 1 freq gemmel - 1 freq gemmely - 1 freq jummle - 5 freq jameela - 2 freq |
GEMMLE |
| Time to execute Levenshtein function - 0.227034 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.406907 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.031925 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.042706 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.001027 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. |