| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rampant (0) - 11 freq rampart (1) - 2 freq rampan (1) - 2 freq remant (2) - 1 freq rampit (2) - 2 freq radiant (2) - 5 freq trampan (2) - 1 freq rampantfm (2) - 5 freq rampin (2) - 4 freq raspan (2) - 1 freq rampage (2) - 3 freq tampan (2) - 1 freq remnant (2) - 7 freq lampan (2) - 1 freq ramparts (2) - 2 freq compact (3) - 7 freq wamman (3) - 1 freq meant (3) - 461 freq repaet (3) - 1 freq lambast (3) - 1 freq ramsay (3) - 48 freq rammage (3) - 1 freq pant (3) - 3 freq trampit (3) - 6 freq raport (3) - 1 freq |
rampant (0) - 11 freq rampan (2) - 2 freq rampart (2) - 2 freq rampin (3) - 4 freq remnant (3) - 7 freq rampit (3) - 2 freq remant (3) - 1 freq raiment (4) - 2 freq rumplet (4) - 1 freq remeent (4) - 2 freq rumpelt (4) - 1 freq remaint (4) - 1 freq rompin (4) - 2 freq rimpelt (4) - 1 freq repent (4) - 17 freq repint (4) - 3 freq raspan (4) - 1 freq rampantfm (4) - 5 freq trampan (4) - 1 freq radiant (4) - 5 freq tampan (4) - 1 freq rampage (4) - 3 freq ramparts (4) - 2 freq lampan (4) - 1 freq raspin (5) - 5 freq |
SoundEx code - R515 rampant - 11 freq removin - 5 freq reinvent - 3 freq reinventin - 1 freq rompin - 2 freq rampin - 4 freq re-inventin - 2 freq reinvention - 1 freq rampan - 2 freq reinvented - 1 freq rampantfm - 5 freq |
MetaPhone code - RMPNT rampant - 11 freq |
RAMPANT |
| Time to execute Levenshtein function - 0.697692 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.824211 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.071559 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.088040 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.000996 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. |