| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bopper (0) - 3 freq popper (1) - 3 freq bopped (1) - 1 freq copper (1) - 22 freq topper (1) - 12 freq whopper (2) - 3 freq dipper (2) - 3 freq poppet (2) - 8 freq cowper (2) - 2 freq poppers (2) - 2 freq gomper (2) - 3 freq dapper (2) - 4 freq oppor (2) - 1 freq sipper (2) - 6 freq boxer (2) - 28 freq cropper (2) - 3 freq bowfer (2) - 2 freq papper (2) - 1 freq boozer (2) - 36 freq couper (2) - 2 freq clopper (2) - 1 freq boppin (2) - 1 freq capper (2) - 2 freq rapper (2) - 4 freq bother (2) - 329 freq |
bopper (0) - 3 freq copper (2) - 22 freq topper (2) - 12 freq bopped (2) - 1 freq popper (2) - 3 freq vupper (3) - 1 freq kipper (3) - 5 freq tipper (3) - 14 freq supper (3) - 173 freq pepper (3) - 83 freq ripper (3) - 10 freq lipper (3) - 14 freq upper (3) - 55 freq napper (3) - 36 freq wapper (3) - 2 freq bumper (3) - 4 freq coapper (3) - 1 freq tapper (3) - 1 freq lapper (3) - 1 freq nipper (3) - 1 freq pipper (3) - 2 freq pooper (3) - 1 freq blooper (3) - 1 freq 'upper (3) - 1 freq dapper (3) - 4 freq |
SoundEx code - B160 before - 567 freq behavior - 1 freq behaviour - 59 freq beauvoir - 1 freq beaver - 5 freq bifore - 2 freq befaire - 4 freq befare - 2 freq buffer - 2 freq bowfer - 2 freq befour - 2 freq behaivyoor - 1 freq before' - 1 freq befoir - 2 freq bavarie - 1 freq bovier - 1 freq behavour - 1 freq befor - 1 freq bieber - 1 freq bavaria - 2 freq bopper - 3 freq bovver - 6 freq |
MetaPhone code - BPR bopper - 3 freq |
BOPPER |
| Time to execute Levenshtein function - 0.206237 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.370152 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.027203 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.037011 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.000857 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. |