Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cashier (0) - 1 freq carrier (2) - 15 freq rashie (2) - 1 freq cassie (2) - 10 freq hashter (2) - 4 freq casie (2) - 3 freq tastier (2) - 1 freq caster (2) - 2 freq cashley (2) - 2 freq crasher (2) - 1 freq asher (2) - 1 freq cathie (2) - 1 freq cadgier (2) - 1 freq castiel (2) - 1 freq cashe (2) - 1 freq callier (2) - 1 freq cashed (2) - 3 freq washer (2) - 5 freq caskie (2) - 4 freq cassies (2) - 6 freq casper (2) - 1 freq cashing (2) - 1 freq rasher (2) - 1 freq hasher (2) - 1 freq cannier (2) - 1 freq |
cashier (0) - 1 freq cashed (3) - 3 freq cashe (3) - 1 freq casper (3) - 1 freq rasher (3) - 1 freq cashin (3) - 1 freq cushie (3) - 15 freq hasher (3) - 1 freq asher (3) - 1 freq washer (3) - 5 freq crasher (3) - 1 freq cashley (3) - 2 freq caster (3) - 2 freq cipher (4) - 1 freq cash (4) - 85 freq chaer (4) - 1 freq pisher (4) - 1 freq shir (4) - 1 freq cher (4) - 6 freq castor (4) - 3 freq cushin (4) - 3 freq acher (4) - 1 freq coothier (4) - 2 freq sheer (4) - 55 freq usher (4) - 3 freq |
SoundEx code - C260 cooker - 21 freq couser - 2 freq cigar - 19 freq cheshire - 10 freq choisir - 1 freq cocker - 1 freq choaker - 7 freq chaser - 9 freq cesare - 1 freq cooser - 3 freq cashier - 1 freq cesar - 2 freq chowker - 7 freq cheugher - 1 freq cookery - 4 freq caesar - 17 freq caesarea - 1 freq checker - 5 freq choocher - 1 freq choker - 1 freq cicero - 1 freq caesura - 2 freq 'chaser' - 4 freq chaucer - 4 freq ceegar - 1 freq €˜ceegar - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq chakra - 1 freq cowzer - 1 freq chekker - 1 freq |
MetaPhone code - KXR catcher - 2 freq cashier - 1 freq gutcher - 1 freq kosher - 1 freq |
CASHIER |
Time to execute Levenshtein function - 0.236632 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.395375 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.037477 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.049975 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.001186 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. |