| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jwiszsm (0) - 1 freq twists (3) - 10 freq wisest (3) - 2 freq wisps (3) - 3 freq swiss (3) - 26 freq cwisrm (3) - 1 freq jeists (3) - 3 freq wisst (3) - 5 freq wises (3) - 1 freq wisdim (3) - 4 freq wisdam (3) - 1 freq wiss (3) - 72 freq wisdom (3) - 45 freq wass (4) - 8 freq swifts (4) - 4 freq wirm (4) - 17 freq wicks (4) - 16 freq wirs (4) - 4 freq wish' (4) - 1 freq jaisket (4) - 1 freq joins (4) - 11 freq wizzna (4) - 6 freq jesus (4) - 843 freq amiss (4) - 16 freq willum (4) - 5 freq |
jwiszsm (0) - 1 freq wisdim (6) - 4 freq wises (6) - 1 freq wisdam (6) - 1 freq wisdom (6) - 45 freq twists (6) - 10 freq wisst (6) - 5 freq wiss (6) - 72 freq wisest (6) - 2 freq jeists (6) - 3 freq wisps (6) - 3 freq swiss (6) - 26 freq cwisrm (6) - 1 freq jests (7) - 2 freq wilsum (7) - 1 freq jigsas (7) - 2 freq wishes (7) - 39 freq wasps (7) - 4 freq jesse (7) - 7 freq jeests (7) - 7 freq qkoszm (7) - 1 freq wisses (7) - 4 freq jaysus (7) - 2 freq wissed (7) - 13 freq weisdom (7) - 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 - JWSSSM jwiszsm - 1 freq |
JWISZSM |
| Time to execute Levenshtein function - 0.214406 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.369940 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.029888 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.066732 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.000911 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. |