| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jakin (0) - 1 freq takin (1) - 441 freq jakit (1) - 8 freq bakin (1) - 23 freq jukin (1) - 1 freq akin (1) - 11 freq aakin (1) - 3 freq makin (1) - 439 freq fakin (1) - 3 freq jawin (1) - 2 freq jain (1) - 1 freq wakin (1) - 19 freq jokin (1) - 46 freq rakin (1) - 27 freq lakin (1) - 1 freq kain (2) - 2 freq lapin (2) - 1 freq barin (2) - 4 freq hykin (2) - 1 freq nasin (2) - 1 freq haain (2) - 1 freq fawin (2) - 83 freq takins (2) - 2 freq jakies (2) - 2 freq joukin (2) - 25 freq |
jakin (0) - 1 freq jukin (1) - 1 freq jokin (1) - 46 freq rakin (2) - 27 freq wakin (2) - 19 freq bakin (2) - 23 freq takin (2) - 441 freq joukin (2) - 25 freq jookin (2) - 7 freq jain (2) - 1 freq lakin (2) - 1 freq jawin (2) - 2 freq akin (2) - 11 freq aakin (2) - 3 freq jakit (2) - 8 freq fakin (2) - 3 freq makin (2) - 439 freq jokit (3) - 8 freq hoakin (3) - 1 freq eikin (3) - 29 freq takan (3) - 10 freq paikin (3) - 3 freq waken (3) - 9 freq taakin (3) - 107 freq mikin (3) - 1 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 |
JAKIN |
| Time to execute Levenshtein function - 0.210467 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.346238 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.028772 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.040928 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.000985 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. |