| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jukin (0) - 1 freq juin (1) - 25 freq jakin (1) - 1 freq jokin (1) - 46 freq bukin (1) - 1 freq lukin (1) - 52 freq fukin (1) - 1 freq -ukin (1) - 1 freq joukin (1) - 25 freq soukin (2) - 6 freq aakin (2) - 3 freq rudkin (2) - 2 freq takin (2) - 453 freq join (2) - 131 freq bikin (2) - 7 freq hikin (2) - 1 freq jawin (2) - 2 freq tubin (2) - 1 freq lurkin (2) - 13 freq awkin (2) - 2 freq yaukin (2) - 1 freq jylin (2) - 1 freq yulin (2) - 1 freq wuin (2) - 3 freq tuckin (2) - 9 freq |
jukin (0) - 1 freq joukin (1) - 25 freq jokin (1) - 46 freq jakin (1) - 1 freq jookin (2) - 7 freq -ukin (2) - 1 freq joukan (2) - 1 freq fukin (2) - 1 freq juin (2) - 25 freq bukin (2) - 1 freq lukin (2) - 52 freq kin (3) - 1383 freq jokit (3) - 8 freq juicin (3) - 2 freq lokin (3) - 1 freq jaupin (3) - 1 freq lykin (3) - 2 freq makin (3) - 450 freq fykin (3) - 2 freq askin (3) - 183 freq julian (3) - 6 freq poukin (3) - 2 freq hokin (3) - 11 freq «kin (3) - 1 freq jakit (3) - 8 freq |
SoundEx code - J250 joukin - 25 freq jiggin - 37 freq jookin - 7 freq jaggin - 9 freq jokin - 46 freq joggin - 9 freq jackson - 38 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 giggin - 2 freq gicn - 1 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 |
JUKIN |
| Time to execute Levenshtein function - 0.461488 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.892873 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.028065 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.105218 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.000950 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. |