| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rump (0) - 10 freq rumb (1) - 10 freq grump (1) - 3 freq cump (1) - 1 freq bump (1) - 23 freq crump (1) - 1 freq lump (1) - 62 freq rumi (1) - 3 freq rmp (1) - 1 freq pump (1) - 29 freq rum (1) - 32 freq gump (1) - 1 freq mump (1) - 3 freq hump (1) - 15 freq romp (1) - 2 freq trump (1) - 74 freq jump (1) - 84 freq dump (1) - 30 freq ramp (1) - 13 freq sump (1) - 3 freq frump (1) - 1 freq ruik (2) - 1 freq yup (2) - 4 freq dumps (2) - 14 freq usp (2) - 1 freq |
rump (0) - 10 freq rmp (1) - 1 freq romp (1) - 2 freq ramp (1) - 13 freq mump (2) - 3 freq hump (2) - 15 freq jump (2) - 84 freq frump (2) - 1 freq sump (2) - 3 freq gump (2) - 1 freq trump (2) - 74 freq dump (2) - 30 freq grump (2) - 3 freq rum (2) - 32 freq rumb (2) - 10 freq bump (2) - 23 freq cump (2) - 1 freq rumi (2) - 3 freq pump (2) - 29 freq lump (2) - 62 freq crump (2) - 1 freq rip (3) - 55 freq rem (3) - 2 freq reums (3) - 1 freq rumse (3) - 2 freq |
SoundEx code - R510 rump - 10 freq remove - 12 freq remuive - 4 freq roon-up - 1 freq rainbow - 27 freq ramp - 13 freq run-up - 3 freq romp - 2 freq rumb - 10 freq rumb' - 1 freq rumba - 1 freq rowein-up - 1 freq rin-up - 2 freq runoff - 1 freq rin-aff - 1 freq rambo - 1 freq rmp - 1 freq ryanp - 3 freq rmf - 1 freq rmv - 1 freq rmov - 1 freq |
MetaPhone code - RMP rump - 10 freq ramp - 13 freq wramp - 1 freq romp - 2 freq rmp - 1 freq |
RUMP |
| Time to execute Levenshtein function - 0.267741 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.416609 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.027674 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.036437 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.000798 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. |