| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jiggin (0) - 37 freq jirgin (1) - 2 freq liggin (1) - 32 freq jiggit (1) - 1 freq diggin (1) - 44 freq joggin (1) - 9 freq jaggin (1) - 9 freq giggin (1) - 2 freq piggin (1) - 10 freq riggin (1) - 20 freq tiggin (1) - 2 freq biggin (1) - 208 freq jigglin (1) - 5 freq jeggins (2) - 1 freq jinin (2) - 8 freq swiggin (2) - 3 freq 'biggin (2) - 6 freq beggin (2) - 33 freq rigging (2) - 1 freq pidgin (2) - 4 freq tiggit (2) - 2 freq gigging (2) - 1 freq singin (2) - 286 freq fingin (2) - 1 freq bingin (2) - 1 freq |
jiggin (0) - 37 freq joggin (1) - 9 freq jaggin (1) - 9 freq riggin (2) - 20 freq joggan (2) - 1 freq jigglin (2) - 5 freq piggin (2) - 10 freq tiggin (2) - 2 freq biggin (2) - 208 freq giggin (2) - 2 freq liggin (2) - 32 freq jirgin (2) - 2 freq diggin (2) - 44 freq jiggit (2) - 1 freq hoggin (3) - 2 freq biggan (3) - 7 freq jiggy (3) - 9 freq loggin (3) - 1 freq uggin (3) - 3 freq haggin (3) - 3 freq moggin (3) - 1 freq tuggin (3) - 7 freq taggin (3) - 3 freq jaggit (3) - 7 freq nyiggin (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 - 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 |
JIGGIN |
| Time to execute Levenshtein function - 0.171740 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.332803 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.031425 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.040365 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.000925 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. |