| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fuffin (0) - 2 freq muffin (1) - 16 freq guffin (1) - 1 freq huffin (1) - 7 freq ruffin (1) - 2 freq fuffie (1) - 1 freq faffin (1) - 1 freq puffin (1) - 33 freq fuftie (2) - 4 freq puffan (2) - 1 freq fumin (2) - 8 freq fulin (2) - 2 freq stuffin (2) - 9 freq culfin (2) - 1 freq siffin (2) - 1 freq ruifin (2) - 2 freq soffin (2) - 1 freq fullin (2) - 29 freq pluffin (2) - 2 freq furin (2) - 1 freq fuffle (2) - 1 freq foofin (2) - 1 freq fuffed (2) - 1 freq fussin (2) - 6 freq fungin (2) - 1 freq |
fuffin (0) - 2 freq faffin (1) - 1 freq fuffie (2) - 1 freq ruffin (2) - 2 freq puffin (2) - 33 freq huffin (2) - 7 freq muffin (2) - 16 freq guffin (2) - 1 freq fuff (3) - 6 freq flaffin (3) - 6 freq quaffin (3) - 2 freq guffan (3) - 1 freq gaffin (3) - 5 freq coffin (3) - 65 freq effin (3) - 14 freq fuffily (3) - 1 freq affin (3) - 2 freq fufft (3) - 5 freq daffin (3) - 18 freq boffin (3) - 2 freq geffin (3) - 1 freq bouffin (3) - 1 freq doffin (3) - 2 freq laffin (3) - 7 freq waffin (3) - 18 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.574496 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.889602 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.028400 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.073734 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.000821 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. |