| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ramfeezled (0) - 3 freq ramfoozled (2) - 1 freq ramfeezlin (2) - 2 freq ramfoozle (3) - 1 freq enfeebled (4) - 1 freq feezed (4) - 1 freq embezzled (4) - 1 freq rasseled (4) - 1 freq rummeled (4) - 2 freq rampled (4) - 1 freq bamboozled (4) - 5 freq reeled (4) - 6 freq reesled (4) - 1 freq rummelled (4) - 3 freq raivelled (4) - 7 freq raffled (4) - 2 freq wheezled (4) - 1 freq reffelled (4) - 1 freq ramfeizilt (4) - 1 freq mizzled (5) - 1 freq refettle (5) - 1 freq recleeved (5) - 1 freq realeesed (5) - 1 freq mayfield (5) - 4 freq a-meesed (5) - 1 freq |
ramfeezled (0) - 3 freq ramfoozled (2) - 1 freq ramfeezlin (3) - 2 freq ramfoozle (4) - 1 freq ramfeizilt (5) - 1 freq rummelled (6) - 3 freq raffled (6) - 2 freq ramfoozelt (6) - 1 freq reffelled (6) - 1 freq bamboozled (6) - 5 freq rummeled (6) - 2 freq rampled (6) - 1 freq rummiled (7) - 1 freq rummled (7) - 3 freq mayfield (7) - 4 freq ruffled (7) - 4 freq rumpled (7) - 2 freq renfield (7) - 2 freq bamaboozled (7) - 1 freq bumfled (7) - 1 freq reffled (7) - 2 freq wheezled (7) - 1 freq reesled (7) - 1 freq reeled (7) - 6 freq rasseled (7) - 1 freq |
SoundEx code - R512 rampaging - 1 freq rampage - 3 freq roun-faced - 1 freq rampaged - 1 freq ramfoozled - 1 freq rampagin - 5 freq rainbows - 2 freq rumpus - 1 freq ramfeezled - 3 freq ramfeezlin - 2 freq rambust - 1 freq ramfoozle - 1 freq ramps - 2 freq removes - 2 freq ramfoozelt - 1 freq reinvigorate - 1 freq ramfeizilt - 1 freq rainbow's - 1 freq rinpoche - 8 freq rinpoche's - 1 freq 'rinpoche - 1 freq ramifications - 4 freq reinvigoratin - 1 freq rnifhksrsx - 1 freq rainbowsr - 6 freq rainfuckof - 1 freq reunification - 1 freq rainbows' - 1 freq |
MetaPhone code - RMFSLT ramfoozled - 1 freq ramfeezled - 3 freq ramfoozelt - 1 freq ramfeizilt - 1 freq |
RAMFEEZLED |
| Time to execute Levenshtein function - 0.883904 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 - 1.310804 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.097890 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.108553 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.000918 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. |