| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remover (0) - 3 freq recover (1) - 7 freq remove (1) - 12 freq removed (1) - 15 freq removes (1) - 2 freq remote' (2) - 1 freq recovery (2) - 13 freq rover (2) - 12 freq rekiver (2) - 1 freq remote (2) - 27 freq mover (2) - 1 freq renoved (2) - 1 freq recovers (2) - 1 freq reiver (2) - 22 freq removin (2) - 4 freq removit (2) - 1 freq removal (2) - 10 freq revolver (2) - 1 freq recovert (2) - 10 freq remotes (2) - 1 freq reever (2) - 2 freq moder (3) - 2 freq dover (3) - 15 freq rove (3) - 2 freq reidder (3) - 2 freq |
remover (0) - 3 freq removed (2) - 15 freq removes (2) - 2 freq remove (2) - 12 freq recover (2) - 7 freq reiver (3) - 22 freq removit (3) - 1 freq mover (3) - 1 freq removin (3) - 4 freq rover (3) - 12 freq recovery (3) - 13 freq removal (3) - 10 freq rekiver (3) - 1 freq reever (3) - 2 freq receever (4) - 1 freq rimer (4) - 1 freq rmov (4) - 1 freq receiver (4) - 4 freq rumour (4) - 21 freq recoverie (4) - 1 freq riever (4) - 2 freq revere (4) - 1 freq rymour (4) - 1 freq rymer (4) - 1 freq revoir (4) - 5 freq |
SoundEx code - R516 rampart - 2 freq rainforest - 5 freq rainforests - 1 freq reinforcements - 2 freq reinforce - 6 freq reimbursed - 1 freq rembrandt - 4 freq rembrancer - 1 freq renfra - 10 freq renfrew - 8 freq renfrewshire - 6 freq renfra's - 1 freq remover - 3 freq room-fresh' - 1 freq reinforcement - 2 freq ramversit - 1 freq ramparts - 2 freq reinforced - 1 freq reinforces - 2 freq remberance - 1 freq ranforced - 1 freq reinforcin - 1 freq rhiannaparade - 5 freq rampur - 1 freq |
MetaPhone code - RMFR remover - 3 freq |
REMOVER |
| Time to execute Levenshtein function - 0.359417 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.440097 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.064628 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.037704 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.000796 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. |