| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nippin (0) - 31 freq nappin (1) - 1 freq nippan (1) - 1 freq tippin (1) - 4 freq wippin (1) - 3 freq nippin' (1) - 3 freq dippin (1) - 10 freq snippin (1) - 1 freq yippin (1) - 1 freq rippin (1) - 21 freq kippin (1) - 1 freq lippin (1) - 9 freq nippit (1) - 43 freq nipping (1) - 11 freq sippin (1) - 7 freq hippin (1) - 1 freq nippie (1) - 6 freq nippen (1) - 1 freq nuppin (1) - 1 freq hoppin (2) - 11 freq keppin (2) - 10 freq rippit (2) - 15 freq nippies (2) - 3 freq naipkin (2) - 1 freq clippin (2) - 12 freq |
nippin (0) - 31 freq nippen (1) - 1 freq nuppin (1) - 1 freq nippan (1) - 1 freq nappin (1) - 1 freq nippit (2) - 43 freq nipping (2) - 11 freq nippie (2) - 6 freq lippin (2) - 9 freq sippin (2) - 7 freq hippin (2) - 1 freq wippin (2) - 3 freq kippin (2) - 1 freq tippin (2) - 4 freq dippin (2) - 10 freq nippin' (2) - 3 freq rippin (2) - 21 freq snippin (2) - 1 freq yippin (2) - 1 freq rippan (3) - 1 freq poppin (3) - 22 freq appin (3) - 2 freq soppin (3) - 1 freq weppin (3) - 1 freq snippen (3) - 2 freq |
SoundEx code - N150 nippin - 31 freq nebbin - 2 freq nippin' - 3 freq nippen - 1 freq nappin - 1 freq novena - 1 freq neibin - 3 freq neebin - 2 freq navyne - 3 freq nippan - 1 freq nuppin - 1 freq nibon - 1 freq nyow-funn - 1 freq nabbin - 2 freq niven - 3 freq n'ben - 1 freq newheiven - 1 freq nfum - 2 freq nvm - 1 freq nevin - 1 freq naefun - 1 freq npn - 1 freq nvmm - 1 freq |
MetaPhone code - NPN knypin - 4 freq nippin - 31 freq nippin' - 3 freq nippen - 1 freq nappin - 1 freq knappin - 4 freq nippan - 1 freq nuppin - 1 freq npn - 1 freq |
NIPPIN |
| Time to execute Levenshtein function - 0.244466 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.407031 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.029024 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.039491 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.000865 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. |