| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ramped (0) - 3 freq camped (1) - 6 freq rammed (1) - 8 freq rampled (1) - 1 freq cramped (1) - 2 freq rasped (1) - 3 freq ramed (1) - 2 freq raped (1) - 5 freq tamped (1) - 1 freq raiped (1) - 5 freq romped (1) - 1 freq lamped (1) - 2 freq rapped (1) - 4 freq tramped (1) - 11 freq gaeped (2) - 1 freq rained (2) - 13 freq ranted (2) - 4 freq damper (2) - 3 freq happed (2) - 35 freq dramed (2) - 2 freq pumped (2) - 15 freq brammed (2) - 1 freq rimed (2) - 1 freq crammed (2) - 7 freq rumpled (2) - 2 freq |
ramped (0) - 3 freq romped (1) - 1 freq raiped (2) - 5 freq tamped (2) - 1 freq lamped (2) - 2 freq tramped (2) - 11 freq raped (2) - 5 freq rapped (2) - 4 freq camped (2) - 6 freq ramed (2) - 2 freq rampled (2) - 1 freq rammed (2) - 8 freq rasped (2) - 3 freq cramped (2) - 2 freq dumped (3) - 21 freq risped (3) - 1 freq rapid (3) - 15 freq rampur (3) - 1 freq trampid (3) - 1 freq roped (3) - 1 freq ramp (3) - 13 freq roamed (3) - 3 freq crimped (3) - 1 freq mumped (3) - 1 freq rampin (3) - 4 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 |
RAMPED |
| Time to execute Levenshtein function - 0.193632 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.353006 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.027204 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.036460 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.000793 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. |