| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carfuffle (0) - 5 freq cafuffle (1) - 2 freq carfuffled (1) - 1 freq ecarfuffle (1) - 1 freq kerfuffle (2) - 2 freq carfufflin (2) - 1 freq tartuffe (3) - 15 freq fuffle (3) - 1 freq truffle (3) - 1 freq kerfuffled (3) - 1 freq ruffle (3) - 5 freq scruffle (3) - 1 freq ruffles (4) - 1 freq carlisle (4) - 4 freq carlyle (4) - 17 freq baffle (4) - 2 freq fuffie (4) - 1 freq raffle (4) - 13 freq carefully (4) - 40 freq carefuul (4) - 1 freq riffle (4) - 1 freq carle (4) - 8 freq caunle (4) - 26 freq shuffle (4) - 11 freq capsule (4) - 2 freq |
carfuffle (0) - 5 freq ecarfuffle (1) - 1 freq carfuffled (2) - 1 freq cafuffle (2) - 2 freq carfufflin (3) - 1 freq kerfuffle (3) - 2 freq scruffle (5) - 1 freq ruffle (5) - 5 freq kerfuffled (5) - 1 freq truffle (5) - 1 freq fuffle (5) - 1 freq cardiff (6) - 1 freq driffle (6) - 1 freq criffel (6) - 5 freq careful (6) - 43 freq cairfully (6) - 4 freq carefil (6) - 1 freq carefullie (6) - 1 freq riffle (6) - 1 freq gruffly (6) - 2 freq carefuul (6) - 1 freq raffle (6) - 13 freq tartuffe (6) - 15 freq carefully (6) - 40 freq crieffy (7) - 1 freq |
SoundEx code - C611 carfuffle - 5 freq carfuffled - 1 freq carfufflin - 1 freq |
MetaPhone code - KRFFL carfuffle - 5 freq kerfuffle - 2 freq 'kerfuffle - 1 freq |
CARFUFFLE |
| Time to execute Levenshtein function - 0.208440 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.389535 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.028827 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.038747 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.000990 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. |