| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaloused (0) - 139 freq jalouzed (1) - 4 freq jalouse (1) - 183 freq jeloused (1) - 4 freq jaloosed (1) - 12 freq jalloused (1) - 1 freq jalouses (1) - 10 freq jalouzes (2) - 3 freq jaloust (2) - 3 freq jalooses (2) - 1 freq jalous (2) - 2 freq jaloozed (2) - 1 freq jalousin (2) - 30 freq jalousie (2) - 12 freq aroused (2) - 1 freq calloused (2) - 2 freq loused (2) - 5 freq jaloose (2) - 23 freq ijalouse (2) - 1 freq jalousan (2) - 1 freq jalouze (2) - 4 freq lowsed (3) - 72 freq cloased (3) - 1 freq soused (3) - 2 freq jouked (3) - 23 freq |
jaloused (0) - 139 freq jaloosed (1) - 12 freq jeloused (1) - 4 freq jalouses (2) - 10 freq jalloused (2) - 1 freq jalouzed (2) - 4 freq jalouse (2) - 183 freq loused (3) - 5 freq jaloose (3) - 23 freq jalousan (3) - 1 freq jalousie (3) - 12 freq ijalouse (3) - 1 freq jalousin (3) - 30 freq jalous (3) - 2 freq jaloust (3) - 3 freq jaloozed (3) - 1 freq jalooses (3) - 1 freq jealously (4) - 3 freq jaloosin (4) - 2 freq jailous (4) - 1 freq jealousy (4) - 15 freq closed (4) - 126 freq jaelousy (4) - 1 freq jealous (4) - 55 freq jaelous (4) - 2 freq |
SoundEx code - J423 jaloused - 139 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 - 139 freq jaloosed - 12 freq jaloust - 3 freq jalouzed - 4 freq jalloused - 1 freq jeloused - 4 freq jaloozed - 1 freq |
JALOUSED |
| Time to execute Levenshtein function - 0.275136 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.440437 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.031044 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.048631 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.001138 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. |