| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yippin (0) - 1 freq kippin (1) - 1 freq dippin (1) - 10 freq nippin (1) - 31 freq yappin (1) - 8 freq rippin (1) - 21 freq lippin (1) - 9 freq sippin (1) - 7 freq tippin (1) - 4 freq wippin (1) - 3 freq hippin (1) - 1 freq boppin (2) - 1 freq wappin (2) - 26 freq sipping (2) - 1 freq lippn (2) - 1 freq tippie (2) - 3 freq rippin' (2) - 1 freq keppin (2) - 10 freq jimpin (2) - 4 freq yirkin (2) - 1 freq moppin (2) - 2 freq yapping (2) - 5 freq skippin (2) - 21 freq yappins (2) - 1 freq suppin (2) - 9 freq |
yippin (0) - 1 freq yappin (1) - 8 freq yappan (2) - 1 freq appin (2) - 2 freq oppin (2) - 4 freq pipin (2) - 8 freq yappen (2) - 5 freq hippin (2) - 1 freq uppin (2) - 1 freq wippin (2) - 3 freq dippin (2) - 10 freq kippin (2) - 1 freq nippin (2) - 31 freq rippin (2) - 21 freq tippin (2) - 4 freq sippin (2) - 7 freq lippin (2) - 9 freq poppin (3) - 22 freq toppin (3) - 5 freq wuppin (3) - 1 freq rappin (3) - 6 freq leppin (3) - 7 freq nuppin (3) - 1 freq siepin (3) - 1 freq jappin (3) - 1 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 |
YIPPIN |
| Time to execute Levenshtein function - 0.247329 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.397431 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.033102 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.038211 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.001146 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. |