| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cropper (0) - 3 freq cropped (1) - 2 freq clopper (1) - 1 freq chopper (1) - 6 freq crapper (1) - 1 freq copper (1) - 22 freq propped (2) - 3 freq proaper (2) - 3 freq proppes (2) - 1 freq cooper (2) - 18 freq capper (2) - 2 freq drapper (2) - 1 freq ripper (2) - 10 freq prosper (2) - 5 freq crowped (2) - 1 freq coppers (2) - 9 freq wrapper (2) - 22 freq trooper (2) - 9 freq chopped (2) - 7 freq crooner (2) - 4 freq shopper (2) - 3 freq crapped (2) - 1 freq chipper (2) - 24 freq stopper (2) - 2 freq clipper (2) - 3 freq |
cropper (0) - 3 freq crapper (1) - 1 freq cropped (2) - 2 freq clopper (2) - 1 freq copper (2) - 22 freq chopper (2) - 6 freq clipper (3) - 3 freq chipper (3) - 24 freq crapped (3) - 1 freq cruppen (3) - 4 freq caipper (3) - 1 freq rapper (3) - 4 freq tripper (3) - 1 freq coapper (3) - 1 freq croppit (3) - 1 freq chapper (3) - 2 freq wrapper (3) - 22 freq ripper (3) - 10 freq capper (3) - 2 freq drapper (3) - 1 freq chepper (3) - 1 freq cripple (4) - 6 freq crappy (4) - 6 freq crappit (4) - 4 freq creppul (4) - 1 freq |
SoundEx code - C616 carefree - 6 freq carbrini - 1 freq cerebrum - 1 freq carberry - 2 freq caur-parks - 1 freq cerberus - 15 freq car-pairk - 3 freq corporate - 26 freq corporation - 5 freq corporations - 4 freq care-free - 1 freq crawford - 5 freq cerebral - 1 freq crapper - 1 freq cropper - 3 freq carpairk - 1 freq corporal - 22 freq cerbuird - 1 freq crafurds - 1 freq crawfurd - 1 freq creepers - 1 freq crawford's - 2 freq cerberus's - 1 freq chair-frame - 1 freq carpark - 5 freq currieboram - 1 freq carver - 14 freq corporately - 1 freq crobertsonuk - 15 freq corfuarts - 1 freq crawfor - 1 freq crowberries - 1 freq |
MetaPhone code - KRPR crapper - 1 freq cropper - 3 freq |
CROPPER |
| Time to execute Levenshtein function - 0.210097 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.392587 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.027902 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.041878 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.000990 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. |