| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rumlan (0) - 1 freq rumlin (1) - 1 freq rummlan (1) - 1 freq rumblan (1) - 1 freq roilan (2) - 1 freq bunlan (2) - 1 freq rummlin (2) - 23 freq rumblin (2) - 12 freq tummlan (2) - 1 freq cumoan (2) - 2 freq umman (2) - 15 freq wuman (2) - 40 freq crumlin (2) - 3 freq human (2) - 315 freq runan (2) - 1 freq rollan (2) - 2 freq rustlan (2) - 1 freq ruzla (2) - 1 freq rouman (2) - 2 freq hurlan (2) - 4 freq cuman (2) - 2 freq sumwan (2) - 8 freq mullan (2) - 2 freq curlan (2) - 2 freq rulin (2) - 6 freq |
rumlan (0) - 1 freq rumlin (1) - 1 freq rumblan (2) - 1 freq rummlan (2) - 1 freq grumlin (3) - 1 freq rumplin (3) - 1 freq rampan (3) - 2 freq rulin (3) - 6 freq rumle (3) - 1 freq reelan (3) - 3 freq tumlin (3) - 1 freq rollan (3) - 2 freq roman (3) - 76 freq rouman (3) - 2 freq crumlin (3) - 3 freq rumblin (3) - 12 freq rummlin (3) - 23 freq roilan (3) - 1 freq roslin (4) - 1 freq rollon (4) - 1 freq rollin (4) - 58 freq rawlin (4) - 1 freq hamelan (4) - 1 freq rumiling (4) - 1 freq relyan (4) - 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 |
RUMLAN |
| Time to execute Levenshtein function - 0.229768 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.394304 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.027976 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.038430 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.000851 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. |