| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jokin (0) - 46 freq jockin (1) - 1 freq jokit (1) - 8 freq ookin (1) - 1 freq pokin (1) - 18 freq jookin (1) - 7 freq joking (1) - 1 freq join (1) - 123 freq lokin (1) - 1 freq jowin (1) - 4 freq yokin (1) - 24 freq hokin (1) - 11 freq joukin (1) - 25 freq jakin (1) - 1 freq bokin (1) - 5 freq tokin (1) - 4 freq jukin (1) - 1 freq jovi (2) - 1 freq jylin (2) - 1 freq govin (2) - 9 freq hookin (2) - 2 freq soukin (2) - 6 freq morin (2) - 2 freq louin (2) - 1 freq jynin (2) - 33 freq |
jokin (0) - 46 freq joukin (1) - 25 freq jukin (1) - 1 freq jookin (1) - 7 freq jakin (1) - 1 freq tokin (2) - 4 freq bokin (2) - 5 freq pokin (2) - 18 freq joukan (2) - 1 freq jockin (2) - 1 freq ookin (2) - 1 freq jokit (2) - 8 freq hokin (2) - 11 freq join (2) - 123 freq joking (2) - 1 freq lokin (2) - 1 freq yokin (2) - 24 freq jowin (2) - 4 freq makin (3) - 439 freq jonan (3) - 2 freq jokes (3) - 50 freq yokkin (3) - 8 freq dookin (3) - 20 freq kin (3) - 1351 freq joker (3) - 7 freq |
SoundEx code - J250 joukin - 25 freq jiggin - 37 freq jookin - 7 freq jaggin - 9 freq jokin - 46 freq joggin - 9 freq jackson - 37 freq jizzen - 4 freq jason - 24 freq jeconiah - 4 freq jockina - 20 freq juicin - 2 freq jukin - 1 freq joggan - 1 freq jeckson - 1 freq jessie-annie - 1 freq jakin - 1 freq joukan - 1 freq jycin - 1 freq jui-shiuan - 2 freq jwiszsm - 1 freq jewson - 1 freq jockin - 1 freq jojum - 1 freq jasonm - 1 freq jackieme - 2 freq jojom - 1 freq jecm - 1 freq |
MetaPhone code - JKN joukin - 25 freq jiggin - 37 freq geckin - 3 freq jookin - 7 freq jaggin - 9 freq jokin - 46 freq joggin - 9 freq jeconiah - 4 freq jockina - 20 freq jukin - 1 freq joggan - 1 freq geckan - 1 freq jakin - 1 freq joukan - 1 freq jockin - 1 freq jqn - 1 freq |
JOKIN |
| Time to execute Levenshtein function - 0.178863 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.322922 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.027718 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.036446 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.000845 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. |