| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caster (0) - 2 freq aster (1) - 1 freq waster (1) - 13 freq coaster (1) - 18 freq caste (1) - 2 freq master (1) - 19 freq carter (1) - 3 freq casted (1) - 2 freq casters (1) - 2 freq faster (1) - 77 freq casper (1) - 1 freq catter (1) - 16 freq coster (1) - 1 freq castel (1) - 8 freq casten (1) - 2 freq cater (1) - 5 freq canter (1) - 3 freq castor (1) - 3 freq easter (1) - 41 freq clister (2) - 1 freq water (2) - 252 freq paste (2) - 10 freq caper (2) - 14 freq ster (2) - 3 freq chaste (2) - 1 freq |
caster (0) - 2 freq coster (1) - 1 freq coaster (1) - 18 freq castor (1) - 3 freq easter (2) - 41 freq catter (2) - 16 freq castel (2) - 8 freq casten (2) - 2 freq cater (2) - 5 freq casper (2) - 1 freq canter (2) - 3 freq caste (2) - 2 freq aster (2) - 1 freq faster (2) - 77 freq master (2) - 19 freq waster (2) - 13 freq casted (2) - 2 freq casters (2) - 2 freq carter (2) - 3 freq captur (3) - 1 freq oyster (3) - 23 freq coste (3) - 1 freq maister (3) - 216 freq castit (3) - 1 freq cuiter (3) - 1 freq |
SoundEx code - C236 custart - 4 freq cistercian - 1 freq coasters - 4 freq coaster - 18 freq castrate - 2 freq custard - 15 freq chak-strenthened - 1 freq casters - 2 freq castor-oil - 1 freq cast-iron - 1 freq castration - 1 freq custurt - 1 freq 'castor - 1 freq cheuchter - 1 freq 'castor' - 1 freq coquetry - 1 freq cistern - 5 freq castrated - 1 freq castor - 3 freq caster - 2 freq chester - 1 freq chustdoowaer - 1 freq cash-tray - 1 freq custrin - 1 freq castrati - 1 freq castrato - 1 freq chesthairs - 1 freq coster - 1 freq chesters - 4 freq |
MetaPhone code - KSTR coaster - 18 freq gowster - 2 freq gowsterie - 1 freq gouster - 5 freq 'castor - 1 freq 'castor' - 1 freq castor - 3 freq caster - 2 freq gousterie - 1 freq coster - 1 freq gazetteer - 1 freq gowsteri - 1 freq |
CASTER |
| Time to execute Levenshtein function - 0.304739 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.544965 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.060921 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.037459 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.000773 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. |