| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jockina (0) - 20 freq jockin (1) - 1 freq jookin (2) - 7 freq mockin (2) - 11 freq locking (2) - 3 freq dockin (2) - 2 freq lockin (2) - 7 freq hockin (2) - 4 freq jowking (2) - 1 freq rockin' (2) - 1 freq mocking (2) - 1 freq rockin (2) - 18 freq dockins (2) - 1 freq jokin (2) - 46 freq rocking (2) - 2 freq jockie (2) - 28 freq cockin (2) - 8 freq joking (2) - 1 freq jockina's (2) - 2 freq jacking (2) - 1 freq joukin (2) - 25 freq mockin' (2) - 2 freq jockie' (2) - 1 freq mockit (3) - 11 freq dockens (3) - 5 freq |
jockina (0) - 20 freq jockin (1) - 1 freq jockie' (3) - 1 freq cockin (3) - 8 freq rockin (3) - 18 freq jockie (3) - 28 freq jokin (3) - 46 freq jacking (3) - 1 freq lockin (3) - 7 freq jookin (3) - 7 freq mockin (3) - 11 freq dockin (3) - 2 freq joukin (3) - 25 freq hockin (3) - 4 freq fackin (4) - 1 freq suckin (4) - 6 freq jinkin (4) - 17 freq jakin (4) - 1 freq jackie (4) - 38 freq sackin (4) - 4 freq tickin (4) - 8 freq hocken (4) - 1 freq hackin (4) - 7 freq jockd (4) - 1 freq mackin (4) - 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 |
JOCKINA |
| Time to execute Levenshtein function - 0.279552 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.385913 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.027527 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.038059 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.001062 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. |