| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fuffin (0) - 2 freq ruffin (1) - 2 freq huffin (1) - 7 freq muffin (1) - 16 freq guffin (1) - 1 freq fuffie (1) - 1 freq faffin (1) - 1 freq puffin (1) - 43 freq furein (2) - 1 freq fuckin (2) - 1032 freq scuffin (2) - 2 freq skuffin (2) - 1 freq effin (2) - 14 freq puffing (2) - 2 freq fulfil (2) - 6 freq flaffin (2) - 6 freq furmin (2) - 1 freq puffan (2) - 1 freq offin (2) - 20 freq siffin (2) - 1 freq coffin (2) - 67 freq puffit (2) - 3 freq fuffle (2) - 1 freq fufft (2) - 5 freq guffan (2) - 1 freq |
fuffin (0) - 2 freq faffin (1) - 1 freq fuffie (2) - 1 freq guffin (2) - 1 freq puffin (2) - 43 freq ruffin (2) - 2 freq huffin (2) - 7 freq muffin (2) - 16 freq soffin (3) - 1 freq quaffin (3) - 2 freq boffin (3) - 2 freq bouffin (3) - 1 freq waffin (3) - 18 freq laffin (3) - 7 freq fuffed (3) - 1 freq fuffily (3) - 1 freq daffin (3) - 18 freq fuff (3) - 6 freq doffin (3) - 2 freq guffan (3) - 1 freq gaffin (3) - 5 freq baffin (3) - 1 freq geffin (3) - 1 freq affin (3) - 2 freq foofin (3) - 1 freq |
SoundEx code - F150 fuffin - 2 freq fobbin - 3 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq fabiani - 5 freq fee-pyin - 1 freq fee-peyin - 1 freq feibn - 1 freq |
MetaPhone code - FFN fuffin - 2 freq faffin - 1 freq foofin - 1 freq fifin' - 1 freq viviane - 4 freq fvn - 1 freq |
FUFFIN |
| Time to execute Levenshtein function - 0.362377 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.731954 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.074667 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.037300 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.000930 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. |