| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pipin (0) - 8 freq papin (1) - 2 freq pitin (1) - 1 freq piping (1) - 5 freq pilin (1) - 7 freq wipin (1) - 15 freq piain (1) - 1 freq ripin (1) - 3 freq pipin' (1) - 1 freq piyin (1) - 2 freq pipit (1) - 6 freq appin (2) - 2 freq minin (2) - 26 freq iyin (2) - 1 freq wi'in (2) - 37 freq typin (2) - 14 freq pinpint (2) - 1 freq pacin (2) - 11 freq ridin (2) - 59 freq pippins (2) - 1 freq pittin (2) - 392 freq mopin (2) - 1 freq pouin (2) - 32 freq pavin (2) - 4 freq sikin (2) - 2 freq |
pipin (0) - 8 freq papin (1) - 2 freq appin (2) - 2 freq pipit (2) - 6 freq uppin (2) - 1 freq piyin (2) - 2 freq poopin (2) - 1 freq yippin (2) - 1 freq oppin (2) - 4 freq peepin (2) - 6 freq wipin (2) - 15 freq pilin (2) - 7 freq piping (2) - 5 freq pitin (2) - 1 freq pipin' (2) - 1 freq piain (2) - 1 freq ripin (2) - 3 freq pupil (3) - 15 freq pumpin (3) - 17 freq sypin (3) - 12 freq gypin (3) - 3 freq paplin (3) - 1 freq pizen (3) - 3 freq dupin (3) - 1 freq spin (3) - 64 freq |
SoundEx code - P150 pappin - 7 freq peepin - 6 freq puffin - 33 freq pipin - 8 freq 'poppin - 1 freq pappen - 1 freq poppin - 20 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 - PPN pappin - 7 freq peepin - 6 freq pipin - 8 freq 'poppin - 1 freq pappen - 1 freq poppin - 20 freq peepan - 3 freq papeno - 1 freq pipin' - 1 freq p-pain - 1 freq peepin' - 1 freq papin - 2 freq poopin - 1 freq |
PIPIN |
| Time to execute Levenshtein function - 0.290386 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.439873 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.036133 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.041444 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.000750 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. |