| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kippin (0) - 1 freq keppin (1) - 10 freq hippin (1) - 1 freq sippin (1) - 7 freq skippin (1) - 21 freq yippin (1) - 1 freq tippin (1) - 4 freq nippin (1) - 31 freq dippin (1) - 10 freq wippin (1) - 3 freq rippin (1) - 21 freq kipplin (1) - 1 freq lippin (1) - 9 freq pippins (2) - 1 freq kirnin (2) - 5 freq skippit (2) - 8 freq rippan (2) - 1 freq nipping (2) - 11 freq limpin (2) - 3 freq killin (2) - 61 freq dippit (2) - 12 freq grippin (2) - 21 freq kipple (2) - 2 freq jimpin (2) - 4 freq lippit (2) - 2 freq |
kippin (0) - 1 freq keppin (1) - 10 freq dippin (2) - 10 freq wippin (2) - 3 freq lippin (2) - 9 freq nippin (2) - 31 freq kipplin (2) - 1 freq rippin (2) - 21 freq hippin (2) - 1 freq tippin (2) - 4 freq skippin (2) - 21 freq sippin (2) - 7 freq yippin (2) - 1 freq hoppin (3) - 11 freq keppit (3) - 17 freq happin (3) - 16 freq cuppin (3) - 6 freq pappin (3) - 7 freq nippen (3) - 1 freq klappin (3) - 1 freq oppin (3) - 4 freq knappin (3) - 4 freq lappin (3) - 20 freq nuppin (3) - 1 freq toppin (3) - 5 freq |
SoundEx code - K150 keepin - 218 freq keppin - 10 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq keep'n - 1 freq kevin - 46 freq kippin - 1 freq keepan - 12 freq kpn - 1 freq kevin' - 1 freq kobweeyin - 1 freq |
MetaPhone code - KPN gowpen - 5 freq keepin - 218 freq coupon - 57 freq cuppin - 6 freq gowpin - 30 freq gapin - 10 freq capone - 1 freq gaupin - 8 freq coupin - 7 freq gawpin - 34 freq cowpin - 26 freq keppin - 10 freq copin - 4 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq coupen - 1 freq gappen - 2 freq keep'n - 1 freq gappin - 2 freq kippin - 1 freq keepan - 12 freq copan - 1 freq coupan - 1 freq gappan - 1 freq gupan - 1 freq gopin - 1 freq gaapin - 1 freq cappin - 1 freq coopin - 1 freq capon - 1 freq kpn - 1 freq 'goupin' - 1 freq goupin - 1 freq |
KIPPIN |
| Time to execute Levenshtein function - 0.239536 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.366422 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.027429 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.037620 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.000902 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. |