| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remove (0) - 13 freq remote (1) - 27 freq removed (1) - 17 freq removes (1) - 2 freq remover (1) - 3 freq removit (2) - 1 freq revote (2) - 1 freq recover (2) - 7 freq temote (2) - 1 freq revolve (2) - 2 freq repone (2) - 68 freq revive (2) - 7 freq rmov (2) - 1 freq renoved (2) - 1 freq 'move (2) - 2 freq remo (2) - 1 freq remade (2) - 1 freq reeve (2) - 1 freq remede (2) - 1 freq remuive (2) - 4 freq rove (2) - 2 freq rewoke (2) - 1 freq remine (2) - 2 freq move (2) - 314 freq relive (2) - 1 freq |
remove (0) - 13 freq rmov (2) - 1 freq remover (2) - 3 freq remuive (2) - 4 freq remote (2) - 27 freq removes (2) - 2 freq removed (2) - 17 freq remede (3) - 1 freq remine (3) - 2 freq rove (3) - 2 freq move (3) - 314 freq relive (3) - 1 freq remake (3) - 3 freq rmv (3) - 1 freq reive (3) - 5 freq removin (3) - 5 freq reeve (3) - 1 freq remade (3) - 1 freq removal (3) - 10 freq removit (3) - 1 freq 'move (3) - 2 freq revive (3) - 7 freq remo (3) - 1 freq rumour (4) - 21 freq rave (4) - 10 freq |
SoundEx code - R510 rump - 10 freq remove - 13 freq remuive - 4 freq roon-up - 1 freq rainbow - 27 freq ramp - 13 freq run-up - 3 freq romp - 2 freq rumb - 10 freq rumb' - 1 freq rumba - 1 freq rowein-up - 1 freq rin-up - 2 freq runoff - 1 freq rin-aff - 1 freq rambo - 1 freq rmp - 1 freq ryanp - 3 freq rmf - 1 freq rmv - 1 freq rmov - 1 freq |
MetaPhone code - RMF remove - 13 freq remuive - 4 freq rmf - 1 freq rmv - 1 freq rmov - 1 freq |
REMOVE |
| Time to execute Levenshtein function - 0.204216 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.350643 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.027443 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.036824 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.000909 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. |