| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rummelling (0) - 1 freq rummellin (1) - 1 freq rummelin (2) - 1 freq pummellin (2) - 1 freq rummelin' (2) - 1 freq rummilin (3) - 1 freq bummelin (3) - 1 freq rumbling (3) - 1 freq smelling (3) - 4 freq tummelin (3) - 1 freq grummillin (3) - 1 freq rummelinto (3) - 6 freq rumiling (3) - 1 freq rummelled (3) - 3 freq rummlin (3) - 24 freq compelling (3) - 1 freq trummelin (3) - 1 freq grummlin (4) - 7 freq swelling (4) - 1 freq crumbling (4) - 3 freq snivelling (4) - 1 freq humbling (4) - 1 freq bumming (4) - 2 freq travelling (4) - 10 freq crummlin (4) - 8 freq |
rummelling (0) - 1 freq rummellin (2) - 1 freq pummellin (4) - 1 freq rummelin' (4) - 1 freq rummelin (4) - 1 freq rummelinto (5) - 6 freq rumiling (5) - 1 freq compelling (5) - 1 freq grummillin (5) - 1 freq rummlin (5) - 24 freq rummelled (5) - 3 freq rumbling (5) - 1 freq rummilin (5) - 1 freq smelling (5) - 4 freq rambling (6) - 3 freq mumbling (6) - 1 freq rummlan (6) - 1 freq milling (6) - 1 freq tummelin (6) - 1 freq bummelin (6) - 1 freq trummelin (6) - 1 freq rammlin (6) - 2 freq rolling (6) - 7 freq rumplin (7) - 1 freq revellin (7) - 3 freq |
SoundEx code - R545 rummlin - 24 freq runnlin - 1 freq rummlan - 1 freq rumlin - 1 freq rummelin - 1 freq rumlan - 1 freq rammlin - 2 freq rummellin - 1 freq rummilin - 1 freq rumiling - 1 freq rummelin' - 1 freq rummelinto - 6 freq rummelling - 1 freq reannelamont - 2 freq |
MetaPhone code - RMLNK rumbling - 1 freq rumiling - 1 freq rambling - 3 freq rummelling - 1 freq |
RUMMELLING |
| Time to execute Levenshtein function - 0.225362 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.397968 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.030824 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.040395 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.000871 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. |