| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yappan (0) - 1 freq yappin (1) - 8 freq happan (1) - 2 freq yappen (1) - 5 freq lappan (1) - 1 freq gappan (1) - 1 freq tappan (1) - 3 freq appin (2) - 2 freq gaspan (2) - 1 freq lippan (2) - 1 freq yawnan (2) - 2 freq clappan (2) - 2 freq wrappan (2) - 1 freq flappan (2) - 4 freq gappen (2) - 2 freq nippan (2) - 1 freq yippin (2) - 1 freq moppan (2) - 1 freq yappins (2) - 1 freq yplan (2) - 1 freq shappan (2) - 1 freq cappin (2) - 1 freq happin (2) - 16 freq slappan (2) - 1 freq chappan (2) - 5 freq |
yappan (0) - 1 freq yappen (1) - 5 freq yappin (1) - 8 freq appin (2) - 2 freq yippin (2) - 1 freq tappan (2) - 3 freq appen (2) - 25 freq gappan (2) - 1 freq lappan (2) - 1 freq happan (2) - 2 freq rappin (3) - 6 freq jappin (3) - 1 freq gappin (3) - 2 freq rippan (3) - 1 freq 'appen (3) - 1 freq japan (3) - 10 freq nappin (3) - 1 freq pappin (3) - 7 freq suppan (3) - 1 freq appar (3) - 2 freq oppin (3) - 4 freq uppin (3) - 1 freq peepan (3) - 3 freq oppen (3) - 31 freq papin (3) - 2 freq |
SoundEx code - Y150 yappin - 8 freq yaavin - 3 freq yappen - 5 freq yvonne - 81 freq yvonne' - 1 freq yappan - 1 freq yovein - 1 freq yippin - 1 freq ypyna - 1 freq ypn - 1 freq yvyuym - 1 freq ypm - 2 freq yywvm - 1 freq |
MetaPhone code - YPN yappin - 8 freq yappen - 5 freq yappan - 1 freq yippin - 1 freq |
YAPPAN |
| Time to execute Levenshtein function - 0.235187 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.361317 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.033630 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.040916 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.001270 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. |