Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fluffy (0) - 20 freq fluff (1) - 5 freq pluffy (1) - 1 freq gluffy (1) - 2 freq duffy (2) - 52 freq bluff (2) - 4 freq uffy (2) - 1 freq scuffy (2) - 1 freq gluff (2) - 19 freq stuffy (2) - 3 freq tuffy (2) - 1 freq fuff (2) - 6 freq fluffer (2) - 3 freq flushy (2) - 1 freq huffy (2) - 5 freq glufft (2) - 2 freq guffy (2) - 2 freq flurry (2) - 16 freq cliffy (2) - 1 freq pluff (2) - 4 freq fufty (2) - 6 freq snuffy (2) - 14 freq puffy (2) - 5 freq fufft (2) - 5 freq luff (2) - 4 freq |
fluffy (0) - 20 freq fluff (1) - 5 freq flaff (2) - 5 freq gluffy (2) - 2 freq pluffy (2) - 1 freq luff (3) - 4 freq fuff (3) - 6 freq fluffer (3) - 3 freq pluff (3) - 4 freq fluffed (3) - 1 freq cliffy (3) - 1 freq gluff (3) - 19 freq bluff (3) - 4 freq liff (4) - 2 freq funff (4) - 1 freq faff (4) - 3 freq flaffin (4) - 6 freq blaff (4) - 2 freq cliff (4) - 28 freq pluffie (4) - 1 freq flaffed (4) - 2 freq loff (4) - 2 freq laff (4) - 7 freq flaffer (4) - 3 freq liffey (4) - 2 freq |
SoundEx code - F410 flip - 9 freq flap - 32 freq floppy - 5 freq fluffy - 20 freq flype - 3 freq flyp - 3 freq flaff - 5 freq flab - 2 freq flee-up - 2 freq follae-up - 4 freq follow-up - 2 freq flop - 4 freq fluff - 5 freq fleep - 1 freq flyb - 1 freq flava - 1 freq flav - 1 freq flp - 2 freq |
MetaPhone code - FLF fluffy - 20 freq flaff - 5 freq valve - 1 freq philiphaugh - 2 freq philiphaw - 1 freq fluff - 5 freq vallvé - 1 freq vulva - 1 freq vlv - 1 freq flava - 1 freq flav - 1 freq volvo - 2 freq |
FLUFFY |
Time to execute Levenshtein function - 0.181645 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.354737 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.038055 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.038942 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.001004 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. |