| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rampit (0) - 2 freq rampin (1) - 4 freq trampit (1) - 6 freq lampit (1) - 1 freq rappit (1) - 1 freq crampit (1) - 2 freq campit (1) - 2 freq dampit (1) - 1 freq primpit (2) - 1 freq raisit (2) - 15 freq raxit (2) - 13 freq dumpit (2) - 6 freq rakit (2) - 4 freq trappit (2) - 7 freq gampin (2) - 1 freq rampant (2) - 11 freq jampt (2) - 1 freq campie (2) - 16 freq traepit (2) - 2 freq remit (2) - 11 freq jimpit (2) - 5 freq reipit (2) - 2 freq raidit (2) - 2 freq campin (2) - 4 freq mumpit (2) - 2 freq |
rampit (0) - 2 freq dampit (2) - 1 freq armpit (2) - 1 freq crampit (2) - 2 freq campit (2) - 2 freq rampin (2) - 4 freq rappit (2) - 1 freq lampit (2) - 1 freq trampit (2) - 6 freq rappt (3) - 1 freq lumpit (3) - 1 freq rypit (3) - 4 freq ramps (3) - 2 freq jumpit (3) - 25 freq rispit (3) - 1 freq humpit (3) - 1 freq bumpit (3) - 4 freq roupit (3) - 1 freq limpit (3) - 1 freq lempit (3) - 2 freq rampan (3) - 2 freq impit (3) - 1 freq pumpit (3) - 3 freq trampt (3) - 2 freq rampur (3) - 1 freq |
SoundEx code - R513 roonaboot - 17 freq removed - 15 freq rounaboot - 8 freq rimbaud - 1 freq rounaboots - 1 freq remuived - 5 freq renivatien - 1 freq ramped - 3 freq rampit - 2 freq roonaboots - 3 freq roun-about - 2 freq renoved - 1 freq rainbowed - 1 freq runabout - 1 freq rimbaud's - 1 freq rounabout - 1 freq rinaboots - 1 freq removit - 1 freq renovatin - 1 freq romped - 1 freq r'umpteenth - 1 freq re-invadit - 1 freq renovate - 1 freq runfatboyrun - 1 freq |
MetaPhone code - RMPT ramped - 3 freq rampit - 2 freq romped - 1 freq |
RAMPIT |
| Time to execute Levenshtein function - 0.204629 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.366449 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.032559 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.038967 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.001019 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. |