| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaloust (0) - 3 freq jalouse (1) - 182 freq jalous (1) - 1 freq jealous (2) - 52 freq jealousy (2) - 14 freq bloust (2) - 1 freq jalousie (2) - 12 freq jalouses (2) - 10 freq sallust (2) - 2 freq jaelous (2) - 2 freq ijalouse (2) - 1 freq jalouze (2) - 4 freq jaloused (2) - 137 freq jaelousy (2) - 1 freq jalousin (2) - 30 freq jaloose (2) - 22 freq afoust (2) - 1 freq jalousan (2) - 1 freq jailous (2) - 1 freq colourt (3) - 6 freq ballest (3) - 3 freq lous (3) - 1 freq carolst (3) - 1 freq lost (3) - 486 freq noust (3) - 2 freq |
jaloust (0) - 3 freq jalous (2) - 1 freq jalouse (2) - 182 freq jalousin (3) - 30 freq jaelousy (3) - 1 freq jaloose (3) - 22 freq jailous (3) - 1 freq ijalouse (3) - 1 freq jalousan (3) - 1 freq jaloused (3) - 137 freq jaelous (3) - 2 freq jealousy (3) - 14 freq jealous (3) - 52 freq jalousie (3) - 12 freq bloust (3) - 1 freq jalouses (3) - 10 freq jaloosed (4) - 12 freq julius (4) - 5 freq clousta (4) - 3 freq jaloosin (4) - 2 freq ajust (4) - 2 freq loest (4) - 1 freq jeelousy (4) - 1 freq aalest (4) - 4 freq jaist (4) - 53 freq |
SoundEx code - J423 jaloused - 137 freq jaloosed - 12 freq jaloust - 3 freq jalouzed - 4 freq jowel-stanes - 1 freq jalloused - 1 freq jeloused - 4 freq jaloozed - 1 freq juliasutherland - 1 freq julstachurska - 1 freq jwalsdihkt - 1 freq joolzdenby - 1 freq juliestuart - 1 freq |
MetaPhone code - JLST jaloused - 137 freq jaloosed - 12 freq jaloust - 3 freq jalouzed - 4 freq jalloused - 1 freq jeloused - 4 freq jaloozed - 1 freq |
JALOUST |
| Time to execute Levenshtein function - 0.210901 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.351908 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.027455 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.037815 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.000859 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. |