| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chests (0) - 7 freq chists (1) - 1 freq crests (1) - 2 freq chest (1) - 101 freq cheats (1) - 2 freq chess (1) - 4 freq chesty (1) - 2 freq chest's (1) - 2 freq chansts (2) - 31 freq gests (2) - 2 freq cheins (2) - 2 freq chefs (2) - 2 freq thesps (2) - 1 freq casts (2) - 19 freq clefts (2) - 1 freq cheyns (2) - 1 freq bests (2) - 2 freq jests (2) - 2 freq cheels (2) - 2 freq celts (2) - 9 freq charts (2) - 8 freq tests (2) - 28 freq cheeps (2) - 2 freq chases (2) - 7 freq cheist (2) - 3 freq |
chests (0) - 7 freq chists (1) - 1 freq chest's (2) - 2 freq chess (2) - 4 freq chesty (2) - 2 freq crests (2) - 2 freq cheats (2) - 2 freq chest (2) - 101 freq chmets (3) - 1 freq chester (3) - 1 freq chesters (3) - 4 freq chist (3) - 68 freq wheests (3) - 1 freq whists (3) - 1 freq ghosts (3) - 23 freq chaste (3) - 1 freq cheeses (3) - 1 freq chits (3) - 1 freq cheust (3) - 150 freq coasts (3) - 4 freq chunts (3) - 4 freq chats (3) - 3 freq costs (3) - 46 freq choss (3) - 2 freq heysts (3) - 1 freq |
SoundEx code - C232 cushie-doos - 11 freq casts - 19 freq chests - 7 freq costs - 46 freq cushats - 1 freq chastise - 1 freq chastisement - 1 freq coastguard's - 1 freq casuities - 1 freq coasts - 4 freq chest's - 2 freq castigate - 1 freq coastguairds - 1 freq 'costs - 1 freq cushat's - 1 freq chiocchetti's - 1 freq coastgaird - 1 freq costies - 8 freq choctaws - 1 freq castocks - 1 freq castaways - 1 freq costgaird - 1 freq cicadas - 1 freq chasteised - 1 freq cushiedoos - 2 freq chists - 1 freq cystic - 1 freq cactus - 2 freq cxizudkvyu - 1 freq coqxtj - 1 freq castkegate - 1 freq cjcheckouteaston - 1 freq cyjddzht - 1 freq coqwdqs - 1 freq cheesedick - 1 freq cgogdqr - 1 freq checkoutgirl - 2 freq chgtsyv - 1 freq checkoots - 1 freq |
MetaPhone code - XSTS chests - 7 freq chastise - 1 freq chest's - 2 freq chists - 1 freq |
CHESTS |
| Time to execute Levenshtein function - 0.203828 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.356295 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.027075 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.037467 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.000888 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. |