| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faffin (0) - 1 freq affin (1) - 2 freq waffin (1) - 18 freq laffin (1) - 7 freq gaffin (1) - 5 freq daffin (1) - 18 freq fuffin (1) - 2 freq flaffin (1) - 6 freq baffin (1) - 1 freq fawin (2) - 88 freq faffs (2) - 1 freq wafflin (2) - 2 freq ruffin (2) - 2 freq affen (2) - 118 freq fafnir (2) - 1 freq chaffin (2) - 2 freq fallin (2) - 48 freq affie (2) - 6 freq fa-in (2) - 1 freq barfin (2) - 1 freq farin (2) - 10 freq boffin (2) - 2 freq raffie (2) - 1 freq puffin (2) - 43 freq saufin (2) - 1 freq |
faffin (0) - 1 freq fuffin (1) - 2 freq baffin (2) - 1 freq daffin (2) - 18 freq flaffin (2) - 6 freq gaffin (2) - 5 freq waffin (2) - 18 freq affin (2) - 2 freq laffin (2) - 7 freq coffin (3) - 67 freq muffin (3) - 16 freq guffin (3) - 1 freq laffan (3) - 1 freq huffin (3) - 7 freq aff'n (3) - 1 freq doffin (3) - 2 freq fuffie (3) - 1 freq puffin (3) - 43 freq quaffin (3) - 2 freq offin (3) - 20 freq faff (3) - 3 freq soffin (3) - 1 freq geffin (3) - 1 freq boffin (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 |
FAFFIN |
| Time to execute Levenshtein function - 0.172220 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.338291 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.027174 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.037535 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.000901 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. |