| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chokkers (0) - 1 freq chakkers (1) - 2 freq chokes (2) - 2 freq choker (2) - 1 freq conkers (2) - 3 freq chukkens (2) - 3 freq chekker (2) - 1 freq choosers (2) - 1 freq chuckers (2) - 1 freq choppers (2) - 1 freq chollers (2) - 1 freq chirkers (2) - 2 freq chowker (2) - 7 freq hookers (2) - 2 freq clockers (2) - 6 freq choaker (2) - 7 freq howkers (2) - 1 freq chocked (3) - 3 freq chokkin (3) - 1 freq crooners (3) - 2 freq cheers (3) - 218 freq stonkers (3) - 2 freq shooers (3) - 17 freq shooders (3) - 132 freq chesters (3) - 4 freq |
chokkers (0) - 1 freq chakkers (1) - 2 freq chuckers (3) - 1 freq chekker (3) - 1 freq chirkers (3) - 2 freq chukkens (3) - 3 freq clockers (4) - 6 freq chukkies (4) - 2 freq choaker (4) - 7 freq chakks (4) - 1 freq chikks (4) - 6 freq hookers (4) - 2 freq howkers (4) - 1 freq choker (4) - 1 freq chowker (4) - 7 freq conkers (4) - 3 freq chokes (4) - 2 freq choosers (4) - 1 freq choppers (4) - 1 freq chollers (4) - 1 freq wheekers (5) - 1 freq chanters (5) - 8 freq crackers (5) - 15 freq cokkis (5) - 1 freq chambers (5) - 8 freq |
SoundEx code - C262 cheshire-cat - 25 freq cheshire-cats - 4 freq cheshire-cheetie - 2 freq cucaracha' - 1 freq cigars - 5 freq cheesers - 2 freq caesar's - 4 freq chakkers - 2 freq cowsers - 1 freq choosers - 1 freq cockroaches - 3 freq cucuracha - 1 freq coosers - 1 freq chuckers - 1 freq cookiris - 4 freq cxejerkcg - 1 freq chokkers - 1 freq chaseyerself - 1 freq |
MetaPhone code - XKRS shakers - 2 freq chakkers - 2 freq chuckers - 1 freq chokkers - 1 freq shaggers - 2 freq |
CHOKKERS |
| Time to execute Levenshtein function - 0.216548 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.396679 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.027160 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.037456 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.001110 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. |