Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flufferin (0) - 1 freq flafferin (1) - 3 freq fluffer (2) - 3 freq flutterin (2) - 4 freq bufferin (2) - 1 freq flusterin (2) - 1 freq sufferin (2) - 36 freq sifferin (3) - 3 freq fleerin (3) - 4 freq flaffin (3) - 6 freq blunderin (3) - 1 freq awfferin (3) - 1 freq sufferan (3) - 2 freq fusperin (3) - 1 freq sufferit (3) - 1 freq flickerin (3) - 18 freq suffrin (3) - 1 freq clutterin (3) - 2 freq differin (3) - 6 freq flicherin (3) - 1 freq pluffin (3) - 2 freq pluffert (3) - 2 freq flouerin (3) - 2 freq flaunterin (3) - 1 freq €˜sufferin (3) - 1 freq |
flufferin (0) - 1 freq flafferin (1) - 3 freq fluffer (3) - 3 freq flaffer (4) - 3 freq flaffin (4) - 6 freq sufferin (4) - 36 freq flusterin (4) - 1 freq flutterin (4) - 4 freq bufferin (4) - 1 freq flatterin (5) - 1 freq flinderin (5) - 1 freq pluffen (5) - 4 freq profferin (5) - 1 freq oafferin (5) - 1 freq deifferin (5) - 1 freq bluffin (5) - 1 freq flooerin (5) - 4 freq fluffed (5) - 1 freq fuffin (5) - 2 freq pluffer (5) - 7 freq bluffert (5) - 1 freq offerin (5) - 65 freq flidderin (5) - 1 freq flitterin (5) - 2 freq awfferin (5) - 1 freq |
SoundEx code - F416 flavour - 27 freq flippers - 15 freq flipper - 2 freq flappers - 5 freq flapper - 5 freq fluffer - 3 freq flafferin - 3 freq foul-breathing - 1 freq flavourin - 1 freq flebbergestit - 1 freq foolproof - 1 freq flayvur - 1 freq flavoured - 1 freq flufferin - 1 freq flaffer - 3 freq filever - 1 freq filbert - 3 freq flavouring - 1 freq foulie-formed - 1 freq full-frontal - 1 freq flavours - 3 freq flabbergastit - 1 freq flabbergasted - 1 freq fielfriday - 2 freq |
MetaPhone code - FLFRN flafferin - 3 freq flavourin - 1 freq flufferin - 1 freq |
FLUFFERIN |
Time to execute Levenshtein function - 0.226668 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.440020 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.028662 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.039362 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.000903 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. |