| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puffan (0) - 1 freq puffin (1) - 43 freq puffa (1) - 1 freq guffan (1) - 1 freq puttan (2) - 3 freq puffing (2) - 2 freq puffins (2) - 5 freq puffit (2) - 3 freq pluffin (2) - 2 freq puffie (2) - 2 freq pufft (2) - 3 freq ruffin (2) - 2 freq fuffin (2) - 2 freq purran (2) - 3 freq puffed (2) - 18 freq huffin (2) - 7 freq laffan (2) - 1 freq pluffen (2) - 4 freq pullan (2) - 6 freq uffa (2) - 3 freq guffin (2) - 1 freq puskan (2) - 1 freq puff (2) - 43 freq pushan (2) - 3 freq guffaw (2) - 1 freq |
puffan (0) - 1 freq puffin (1) - 43 freq guffan (2) - 1 freq puffa (2) - 1 freq pluffen (3) - 4 freq laffan (3) - 1 freq huffin (3) - 7 freq guffin (3) - 1 freq puffy (3) - 5 freq puffs (3) - 8 freq puffed (3) - 18 freq puffer (3) - 1 freq muffin (3) - 16 freq puff (3) - 43 freq pluffin (3) - 2 freq puffit (3) - 3 freq puffins (3) - 5 freq puffie (3) - 2 freq puffing (3) - 2 freq fuffin (3) - 2 freq ruffin (3) - 2 freq pufft (3) - 3 freq effin (4) - 14 freq doffin (4) - 2 freq saffen (4) - 1 freq |
SoundEx code - P150 pappin - 7 freq peepin - 6 freq puffin - 43 freq pipin - 8 freq 'poppin - 1 freq poppin - 22 freq pappen - 1 freq pawphone - 2 freq peepan - 3 freq pavin - 4 freq pevin - 1 freq puffan - 1 freq papeno - 1 freq pipin' - 1 freq payphone - 1 freq paven - 1 freq €˜paw-phone - 1 freq paw-phone - 1 freq peepin' - 1 freq papin - 2 freq pwfon - 1 freq poopin - 1 freq |
MetaPhone code - PFN puffin - 43 freq pawphone - 2 freq pavin - 4 freq pevin - 1 freq puffan - 1 freq payphone - 1 freq paven - 1 freq peghin - 1 freq €˜paw-phone - 1 freq paw-phone - 1 freq pwfon - 1 freq pfonw - 1 freq |
PUFFAN |
| Time to execute Levenshtein function - 0.462190 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.804402 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.092447 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.104715 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.000880 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. |