| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carfufflin (0) - 1 freq carfuffle (2) - 5 freq carfuffled (2) - 1 freq ecarfuffle (3) - 1 freq cafuffle (3) - 2 freq crunklin (4) - 2 freq confuddlin (4) - 1 freq carousin (4) - 2 freq snufflin (4) - 4 freq crumplin (4) - 2 freq bafflin (4) - 1 freq paraffin (4) - 28 freq wafflin (4) - 2 freq hauflin (4) - 14 freq scufflin (4) - 1 freq carlin (4) - 6 freq scrafflin (4) - 1 freq fuffin (4) - 2 freq jufflin (4) - 1 freq kerfuffled (4) - 1 freq crumblin (4) - 3 freq carefullie (4) - 1 freq crummlin (4) - 8 freq mufflin (4) - 2 freq crumlin (4) - 3 freq |
carfufflin (0) - 1 freq carfuffled (3) - 1 freq carfuffle (3) - 5 freq ecarfuffle (4) - 1 freq cafuffle (5) - 2 freq kerfuffle (6) - 2 freq kerfuffled (6) - 1 freq scrafflin (6) - 1 freq carefullie (7) - 1 freq crumblin (7) - 3 freq crummlin (7) - 8 freq ruffling (7) - 1 freq triffilin (7) - 1 freq jufflin (7) - 1 freq ruffin (7) - 2 freq crumlin (7) - 3 freq mufflin (7) - 2 freq shufflin (7) - 6 freq crumplin (7) - 2 freq snufflin (7) - 4 freq confuddlin (7) - 1 freq fuffin (7) - 2 freq bafflin (7) - 1 freq crunklin (7) - 2 freq carlin (7) - 6 freq |
SoundEx code - C611 carfuffle - 5 freq carfuffled - 1 freq carfufflin - 1 freq |
MetaPhone code - KRFFLN carfufflin - 1 freq |
CARFUFFLIN |
| Time to execute Levenshtein function - 0.222356 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.398106 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.028702 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.037932 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.000949 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. |