| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| renoved (0) - 1 freq removed (1) - 17 freq removes (2) - 2 freq renshed (2) - 1 freq reponed (2) - 60 freq reneged (2) - 1 freq remover (2) - 3 freq venomed (2) - 1 freq beloved (2) - 25 freq revived (2) - 6 freq rented (2) - 5 freq renewed (2) - 12 freq renowned (2) - 4 freq renamed (2) - 5 freq rehomed (2) - 1 freq revolved (2) - 1 freq reeved (2) - 2 freq resolved (2) - 8 freq reived (2) - 5 freq remove (2) - 13 freq recover (2) - 7 freq roed (3) - 1 freq meowed (3) - 1 freq brenned (3) - 1 freq reined (3) - 2 freq |
renoved (0) - 1 freq removed (2) - 17 freq rented (3) - 5 freq revived (3) - 6 freq renamed (3) - 5 freq reived (3) - 5 freq renewed (3) - 12 freq reeved (3) - 2 freq reneged (3) - 1 freq ranked (4) - 1 freq renovate (4) - 1 freq ranted (4) - 4 freq rouved (4) - 1 freq received (4) - 53 freq snooved (4) - 3 freq reinged (4) - 5 freq resaived (4) - 2 freq ringed (4) - 7 freq erved (4) - 1 freq snouved (4) - 1 freq snuved (4) - 3 freq ranced (4) - 1 freq reenged (4) - 8 freq remuived (4) - 5 freq ranged (4) - 1 freq |
SoundEx code - R513 roonaboot - 17 freq removed - 17 freq rounaboot - 8 freq rimbaud - 1 freq rounaboots - 1 freq remuived - 5 freq renivatien - 1 freq roomptetoo - 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 - RNFT rnght - 1 freq renoved - 1 freq renovate - 1 freq |
RENOVED |
| Time to execute Levenshtein function - 0.314232 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.685503 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.067114 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.038868 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.000877 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. |