| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| removed (0) - 15 freq renoved (1) - 1 freq remover (1) - 3 freq removes (1) - 2 freq remove (1) - 12 freq reeved (2) - 2 freq remuived (2) - 5 freq revived (2) - 6 freq revolved (2) - 1 freq removin (2) - 4 freq remotes (2) - 1 freq removit (2) - 1 freq reponed (2) - 60 freq recover (2) - 7 freq remaned (2) - 1 freq beloved (2) - 25 freq rehomed (2) - 1 freq remord (2) - 2 freq remote (2) - 27 freq moved (2) - 189 freq remote' (2) - 1 freq remixed (2) - 1 freq resolved (2) - 8 freq reived (2) - 5 freq removal (2) - 10 freq |
removed (0) - 15 freq remuived (2) - 5 freq removes (2) - 2 freq remove (2) - 12 freq renoved (2) - 1 freq remover (2) - 3 freq remord (3) - 2 freq moved (3) - 189 freq reived (3) - 5 freq remutved (3) - 1 freq remaned (3) - 1 freq removal (3) - 10 freq remixed (3) - 1 freq revived (3) - 6 freq removin (3) - 4 freq reeved (3) - 2 freq removit (3) - 1 freq rouved (4) - 1 freq rived (4) - 20 freq resaived (4) - 2 freq remead (4) - 2 freq maved (4) - 1 freq meeved (4) - 22 freq rammed (4) - 8 freq remeid (4) - 7 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 - RMFT removed - 15 freq remuived - 5 freq hrumphed - 1 freq removit - 1 freq |
REMOVED |
| Time to execute Levenshtein function - 0.223784 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.401548 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.029404 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.037810 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.001180 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. |