| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cafuffle (0) - 2 freq carfuffle (1) - 5 freq ecarfuffle (2) - 1 freq carfuffled (2) - 1 freq fuffle (2) - 1 freq baffle (3) - 2 freq carfufflin (3) - 1 freq muffle (3) - 4 freq kerfuffle (3) - 2 freq fuffie (3) - 1 freq scruffle (3) - 1 freq ruffle (3) - 5 freq shuffle (3) - 11 freq caunle (3) - 26 freq duffle (3) - 2 freq waffle (3) - 8 freq raffle (3) - 13 freq caundle (3) - 7 freq caffe (3) - 1 freq caffee (3) - 2 freq caunnle (3) - 1 freq chuffie (3) - 3 freq truffle (3) - 1 freq scuffle (3) - 4 freq raffie (4) - 1 freq |
cafuffle (0) - 2 freq carfuffle (2) - 5 freq fuffle (3) - 1 freq ecarfuffle (3) - 1 freq carfuffled (4) - 1 freq raffle (5) - 13 freq waffle (5) - 8 freq duffle (5) - 2 freq caffe (5) - 1 freq scuffle (5) - 4 freq fuffily (5) - 1 freq chuffie (5) - 3 freq caffee (5) - 2 freq truffle (5) - 1 freq muffle (5) - 4 freq baffle (5) - 2 freq shuffle (5) - 11 freq kerfuffle (5) - 2 freq carfufflin (5) - 1 freq scruffle (5) - 1 freq ruffle (5) - 5 freq fuffie (5) - 1 freq baffel (6) - 1 freq chuffit (6) - 2 freq chuffed (6) - 85 freq |
SoundEx code - C114 capable - 25 freq capabilities - 4 freq cafuffle - 2 freq caapable - 1 freq capability - 1 freq cowboyplumber - 1 freq |
MetaPhone code - KFFL cafuffle - 2 freq |
CAFUFFLE |
| Time to execute Levenshtein function - 0.191857 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.383078 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.029411 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.042286 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.000956 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. |