| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rummlin (0) - 23 freq mummlin (1) - 7 freq rummilin (1) - 1 freq rammlin (1) - 2 freq grummlin (1) - 7 freq rumlin (1) - 1 freq trummlin (1) - 1 freq fummlin (1) - 4 freq jummlin (1) - 1 freq rummlan (1) - 1 freq rummelin (1) - 1 freq crummlin (1) - 8 freq wummlin (1) - 1 freq tummlin (1) - 25 freq bummlin (1) - 2 freq rumblin (1) - 12 freq rumplin (1) - 1 freq whummlin (2) - 2 freq mummilin (2) - 1 freq cummin (2) - 30 freq rammin (2) - 3 freq rustlin (2) - 9 freq bummin (2) - 20 freq rummlet (2) - 1 freq crumplin (2) - 2 freq |
rummlin (0) - 23 freq rummlan (1) - 1 freq rummelin (1) - 1 freq rammlin (1) - 2 freq rummilin (1) - 1 freq crummlin (2) - 8 freq wummlin (2) - 1 freq rumplin (2) - 1 freq bummlin (2) - 2 freq tummlin (2) - 25 freq rumblin (2) - 12 freq mummlin (2) - 7 freq jummlin (2) - 1 freq rumlin (2) - 1 freq grummlin (2) - 7 freq trummlin (2) - 1 freq fummlin (2) - 4 freq rummellin (3) - 1 freq trimmlin (3) - 30 freq rummled (3) - 3 freq mummlan (3) - 2 freq wammlin (3) - 6 freq ramblin (3) - 4 freq grummilin (3) - 1 freq rumblan (3) - 1 freq |
SoundEx code - R545 rummlin - 23 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 - 23 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 |
RUMMLIN |
| Time to execute Levenshtein function - 0.170944 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.319222 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.027069 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.037039 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.000874 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. |