| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kerfuffle (0) - 2 freq kerfuffled (1) - 1 freq carfuffle (2) - 5 freq truffle (3) - 1 freq ruffle (3) - 5 freq carfuffled (3) - 1 freq kerfuully (3) - 1 freq cafuffle (3) - 2 freq 'kerfuffle (3) - 1 freq fuffle (3) - 1 freq scruffle (3) - 1 freq ecarfuffle (3) - 1 freq shuffle (4) - 11 freq weffle (4) - 1 freq duffle (4) - 2 freq fuffie (4) - 1 freq riffle (4) - 1 freq re-shuffle (4) - 2 freq muffle (4) - 4 freq driffle (4) - 1 freq carfufflin (4) - 1 freq gruffly (4) - 2 freq kerfl (4) - 1 freq scuffle (4) - 4 freq kercle (4) - 3 freq |
kerfuffle (0) - 2 freq kerfuffled (2) - 1 freq carfuffle (3) - 5 freq ecarfuffle (4) - 1 freq fuffle (5) - 1 freq ruffle (5) - 5 freq truffle (5) - 1 freq cafuffle (5) - 2 freq carfuffled (5) - 1 freq kerfuully (5) - 1 freq gruffly (6) - 2 freq carfufflin (6) - 1 freq riffle (6) - 1 freq scruffle (6) - 1 freq 'kerfuffle (6) - 1 freq driffle (6) - 1 freq kerfl (6) - 1 freq raffle (6) - 13 freq ruffled (7) - 4 freq ferfull (7) - 2 freq karloff (7) - 2 freq freffly (7) - 1 freq kerryfail (7) - 1 freq kenfaefife (7) - 2 freq tartuffe (7) - 15 freq |
SoundEx code - K611 kerfuffle - 2 freq kerfuffled - 1 freq 'kerfuffle - 1 freq |
MetaPhone code - KRFFL carfuffle - 5 freq kerfuffle - 2 freq 'kerfuffle - 1 freq |
KERFUFFLE |
| Time to execute Levenshtein function - 0.193873 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.388452 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.027999 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.040347 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.001130 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. |