| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fuffle (0) - 1 freq muffle (1) - 4 freq ruffle (1) - 5 freq duffle (1) - 2 freq fuffie (1) - 1 freq fufft (2) - 5 freq fuffin (2) - 2 freq suffre (2) - 1 freq fuff (2) - 6 freq fufil (2) - 2 freq raffle (2) - 13 freq cafuffle (2) - 2 freq luffly (2) - 3 freq muffled (2) - 18 freq fuffily (2) - 1 freq guffie (2) - 3 freq fummle (2) - 5 freq baffle (2) - 2 freq waffle (2) - 8 freq fustle (2) - 3 freq fussle (2) - 8 freq fule (2) - 48 freq futile (2) - 6 freq bumfle (2) - 3 freq ruffled (2) - 4 freq |
fuffle (0) - 1 freq fuffie (2) - 1 freq duffle (2) - 2 freq fuffily (2) - 1 freq muffle (2) - 4 freq ruffle (2) - 5 freq luffly (3) - 3 freq waffle (3) - 8 freq riffle (3) - 1 freq weffle (3) - 1 freq baffle (3) - 2 freq cafuffle (3) - 2 freq fuffed (3) - 1 freq fuffin (3) - 2 freq raffle (3) - 13 freq fuff (3) - 6 freq fufil (3) - 2 freq fufft (3) - 5 freq faffs (4) - 1 freq fumble (4) - 1 freq duffel (4) - 2 freq truffle (4) - 1 freq ruffles (4) - 1 freq fiff (4) - 1 freq fulfil (4) - 6 freq |
SoundEx code - F140 feeble - 10 freq feebly - 6 freq fable - 8 freq fuffle - 1 freq feable - 1 freq fuffily - 1 freq fufil - 2 freq 'feeble - 1 freq fuffle - 1 freq fooball - 1 freq |
MetaPhone code - FFL fuffle - 1 freq vievely - 1 freq fuffily - 1 freq fufil - 2 freq fuffle - 1 freq fvly - 1 freq fvl - 1 freq |
FUFFLE |
| Time to execute Levenshtein function - 0.222354 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.394707 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.029100 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.038528 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.000926 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. |