| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carfuffled (0) - 1 freq carfuffle (1) - 5 freq cafuffle (2) - 2 freq kerfuffled (2) - 1 freq ecarfuffle (2) - 1 freq carfufflin (2) - 1 freq kerfuffle (3) - 2 freq ruffled (3) - 4 freq shuffled (4) - 12 freq scruffle (4) - 1 freq chuffed (4) - 85 freq baffled (4) - 4 freq reffled (4) - 2 freq raffled (4) - 2 freq waffled (4) - 1 freq ruffle (4) - 5 freq parfumed (4) - 2 freq tartuffe (4) - 15 freq argufied (4) - 1 freq crummled (4) - 1 freq crunkled (4) - 1 freq crumled (4) - 1 freq cuffed (4) - 1 freq crumbled (4) - 1 freq carbuncles (4) - 1 freq |
carfuffled (0) - 1 freq carfuffle (2) - 5 freq ecarfuffle (3) - 1 freq carfufflin (3) - 1 freq kerfuffled (3) - 1 freq cafuffle (4) - 2 freq ruffled (5) - 4 freq kerfuffle (5) - 2 freq scraffled (6) - 1 freq reffled (6) - 2 freq raffled (6) - 2 freq fuffle (7) - 1 freq carolled (7) - 1 freq crumbled (7) - 1 freq snuffled (7) - 1 freq fuffed (7) - 1 freq crumpled (7) - 5 freq criffel (7) - 5 freq cuffed (7) - 1 freq muffled (7) - 18 freq ruffles (7) - 1 freq truffle (7) - 1 freq crummled (7) - 1 freq baffled (7) - 4 freq crumled (7) - 1 freq |
SoundEx code - C611 carfuffle - 5 freq carfuffled - 1 freq carfufflin - 1 freq |
MetaPhone code - KRFFLT carfuffled - 1 freq kerfuffled - 1 freq |
CARFUFFLED |
| Time to execute Levenshtein function - 0.213687 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.400547 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.028217 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.038620 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.000904 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. |