| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jummle (0) - 5 freq mummle (1) - 4 freq jummled (1) - 1 freq fummle (1) - 5 freq wummle (1) - 1 freq tummle (1) - 19 freq rummle (1) - 21 freq hummle (1) - 12 freq rummlet (2) - 1 freq jumpe (2) - 1 freq jammie (2) - 2 freq tummled (2) - 4 freq brummle (2) - 1 freq mummlet (2) - 2 freq jummlin (2) - 1 freq tumble (2) - 9 freq rummlt (2) - 1 freq dummie (2) - 1 freq humble (2) - 26 freq gemmle (2) - 2 freq juggle (2) - 1 freq jumblt (2) - 1 freq fummlt (2) - 1 freq mummles (2) - 1 freq grummle (2) - 4 freq |
jummle (0) - 5 freq rummle (2) - 21 freq mummle (2) - 4 freq tummle (2) - 19 freq hummle (2) - 12 freq wummle (2) - 1 freq jummled (2) - 1 freq fummle (2) - 5 freq rammle (3) - 3 freq gemmle (3) - 2 freq demmle (3) - 2 freq jemmie (3) - 4 freq timmle (3) - 4 freq wummile (3) - 1 freq wammle (3) - 2 freq hummly (3) - 1 freq jammie (3) - 2 freq rummile (3) - 1 freq tummile (3) - 1 freq jimmie (3) - 9 freq nimmle (3) - 2 freq jummlin (3) - 1 freq ruammle (3) - 1 freq kummil (4) - 1 freq jimmys (4) - 1 freq |
SoundEx code - J540 jummle - 5 freq jameela - 2 freq jean'll - 1 freq jjconeill - 2 freq janela - 5 freq janila - 1 freq |
MetaPhone code - JML gemmle - 2 freq gemmule - 1 freq gemmel - 1 freq gemmely - 1 freq jummle - 5 freq jameela - 2 freq |
JUMMLE |
| Time to execute Levenshtein function - 0.178508 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.323997 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.027101 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.036248 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.000817 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. |