| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rummelin (0) - 1 freq rummelin' (1) - 1 freq rummlin (1) - 24 freq rummellin (1) - 1 freq rummilin (1) - 1 freq trummelin (1) - 1 freq tummelin (1) - 1 freq bummelin (1) - 1 freq fummlin (2) - 4 freq pummellin (2) - 1 freq trummlin (2) - 1 freq mummlin (2) - 7 freq grummlin (2) - 7 freq crummlin (2) - 8 freq rummeled (2) - 2 freq grummilin (2) - 1 freq rummagin (2) - 1 freq rumlin (2) - 1 freq jummlin (2) - 1 freq rumblin (2) - 12 freq rummelinto (2) - 6 freq nummerin (2) - 6 freq bummlin (2) - 2 freq rummelt (2) - 7 freq rumplin (2) - 1 freq |
rummelin (0) - 1 freq rummilin (1) - 1 freq rummlin (1) - 24 freq rummlan (2) - 1 freq rammlin (2) - 2 freq rummelin' (2) - 1 freq bummelin (2) - 1 freq rummellin (2) - 1 freq tummelin (2) - 1 freq trummelin (2) - 1 freq rummelt (3) - 7 freq bummlin (3) - 2 freq rummelinto (3) - 6 freq rumplin (3) - 1 freq rummel (3) - 6 freq rumblin (3) - 12 freq tummlin (3) - 26 freq mummilin (3) - 1 freq rummels (3) - 2 freq wummlin (3) - 1 freq grummlin (3) - 7 freq mummlin (3) - 7 freq fummlin (3) - 4 freq jummlin (3) - 1 freq crummlin (3) - 8 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 - RMLN rumblin - 12 freq ramblin - 4 freq rummlin - 24 freq rummlan - 1 freq rumlin - 1 freq rummelin - 1 freq rumlan - 1 freq rumblan - 1 freq rammlin - 2 freq rummellin - 1 freq rummilin - 1 freq rummelin' - 1 freq |
RUMMELIN |
| Time to execute Levenshtein function - 0.231491 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.407401 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.029954 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.041197 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.000876 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. |