| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rumlin (0) - 1 freq rummlin (1) - 24 freq rumlan (1) - 1 freq crumlin (1) - 3 freq rumplin (1) - 1 freq rulin (1) - 6 freq rumblin (1) - 12 freq tumlin (1) - 1 freq grumlin (1) - 1 freq trimlin (2) - 1 freq cuilin (2) - 1 freq ruggin (2) - 15 freq ruisin (2) - 2 freq surlin (2) - 1 freq jumpin (2) - 61 freq tumblin (2) - 5 freq curlin (2) - 17 freq tremlin (2) - 2 freq rmnin (2) - 1 freq gumlie (2) - 4 freq rivlin (2) - 5 freq fummlin (2) - 4 freq rowlin (2) - 4 freq rummilin (2) - 1 freq grumlie (2) - 1 freq |
rumlin (0) - 1 freq rumlan (1) - 1 freq tumlin (2) - 1 freq grumlin (2) - 1 freq rulin (2) - 6 freq rumblin (2) - 12 freq rummlin (2) - 24 freq crumlin (2) - 3 freq rumplin (2) - 1 freq rellin (3) - 1 freq rummelin (3) - 1 freq kremlin (3) - 1 freq murmlin (3) - 2 freq remain (3) - 40 freq rammlin (3) - 2 freq roullin (3) - 3 freq rumblan (3) - 1 freq roulin (3) - 2 freq reelin (3) - 16 freq gremlin (3) - 4 freq rumiling (3) - 1 freq ramblin (3) - 4 freq riflin (3) - 1 freq rimplin (3) - 1 freq roilin (3) - 1 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 |
RUMLIN |
| Time to execute Levenshtein function - 0.227653 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.404160 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.029639 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.042230 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.001001 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. |