| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remove (0) - 12 freq remover (1) - 3 freq remote (1) - 27 freq removes (1) - 2 freq removed (1) - 15 freq recover (2) - 7 freq emoe (2) - 1 freq memore (2) - 3 freq remake (2) - 3 freq rove (2) - 2 freq remede (2) - 1 freq removin (2) - 4 freq 'move (2) - 2 freq revive (2) - 7 freq resolve (2) - 10 freq relive (2) - 1 freq temote (2) - 1 freq remotes (2) - 1 freq reeve (2) - 1 freq move (2) - 307 freq remote' (2) - 1 freq remo (2) - 1 freq rewoke (2) - 1 freq removal (2) - 10 freq remorse (2) - 5 freq |
remove (0) - 12 freq remuive (2) - 4 freq rmov (2) - 1 freq remover (2) - 3 freq removed (2) - 15 freq remote (2) - 27 freq removes (2) - 2 freq removal (3) - 10 freq remade (3) - 1 freq rmv (3) - 1 freq remo (3) - 1 freq removit (3) - 1 freq move (3) - 307 freq remine (3) - 2 freq reive (3) - 5 freq reeve (3) - 1 freq removin (3) - 4 freq remede (3) - 1 freq rove (3) - 2 freq remake (3) - 3 freq revive (3) - 7 freq 'move (3) - 2 freq relive (3) - 1 freq remit (4) - 11 freq remeid (4) - 7 freq |
SoundEx code - R510 rump - 10 freq remove - 12 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 - 12 freq remuive - 4 freq rmf - 1 freq rmv - 1 freq rmov - 1 freq |
REMOVE |
| Time to execute Levenshtein function - 0.300258 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.598581 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.029773 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.074665 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.000861 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. |