| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jockin (0) - 1 freq joukin (1) - 25 freq jookin (1) - 7 freq jockina (1) - 20 freq jockie (1) - 28 freq rockin (1) - 18 freq cockin (1) - 8 freq hockin (1) - 4 freq mockin (1) - 11 freq dockin (1) - 3 freq jokin (1) - 46 freq lockin (1) - 7 freq yokkin (2) - 8 freq bookin (2) - 5 freq poukin (2) - 2 freq dockins (2) - 1 freq lockid (2) - 1 freq blockin (2) - 17 freq jinkin (2) - 17 freq cuckin (2) - 1 freq howkin (2) - 59 freq tackin (2) - 1 freq doukin (2) - 3 freq tuckin (2) - 9 freq fookin (2) - 2 freq |
jockin (0) - 1 freq jockina (1) - 20 freq mockin (2) - 11 freq dockin (2) - 3 freq lockin (2) - 7 freq hockin (2) - 4 freq jokin (2) - 46 freq cockin (2) - 8 freq jookin (2) - 7 freq joukin (2) - 25 freq rockin (2) - 18 freq jockie (2) - 28 freq cookin (3) - 44 freq jycin (3) - 1 freq hackin (3) - 7 freq jakin (3) - 1 freq fackin (3) - 1 freq wackin (3) - 1 freq jockie' (3) - 1 freq deckin (3) - 2 freq tickin (3) - 8 freq nickin (3) - 8 freq jockys (3) - 1 freq puckin (3) - 10 freq lackin (3) - 14 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 |
JOCKIN |
| Time to execute Levenshtein function - 0.244317 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.378429 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.029975 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.037095 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.001105 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. |