| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jewels (0) - 20 freq jewel (1) - 19 freq jowels (1) - 3 freq jeels (1) - 3 freq 'jewels (1) - 1 freq keels (2) - 4 freq jeelt (2) - 16 freq sowels (2) - 29 freq feels (2) - 153 freq ewes (2) - 6 freq bowels (2) - 9 freq jeems (2) - 91 freq jew's (2) - 2 freq ayewels (2) - 1 freq jeens (2) - 1 freq jeely (2) - 45 freq jeers (2) - 1 freq vowels (2) - 22 freq bevels (2) - 1 freq kevels (2) - 1 freq reels (2) - 20 freq newess (2) - 1 freq jews (2) - 23 freq jeegs (2) - 1 freq sewers (2) - 5 freq |
jewels (0) - 20 freq jowels (1) - 3 freq 'jewels (2) - 1 freq jewlis (2) - 1 freq jeels (2) - 3 freq jewel (2) - 19 freq towels (3) - 5 freq ayewels (3) - 1 freq jews (3) - 23 freq jew's (3) - 2 freq vowels (3) - 22 freq wels (3) - 5 freq jowel (3) - 3 freq jowells (3) - 3 freq sowels (3) - 29 freq jowes (3) - 5 freq jowelt (3) - 2 freq bowels (3) - 9 freq jails (4) - 1 freq gowls (4) - 2 freq weles (4) - 1 freq ayewils (4) - 1 freq toowels (4) - 1 freq yowls (4) - 4 freq bawls (4) - 5 freq |
SoundEx code - J420 jalouse - 182 freq jealousy - 14 freq jealous - 52 freq jalous - 1 freq jaloose - 22 freq julie's - 1 freq joyless - 1 freq jewels - 20 freq jewlis - 1 freq jyle's - 1 freq jowels - 3 freq jalooze - 1 freq jailous - 1 freq julius - 5 freq jeelousy - 1 freq jyle-hoose - 1 freq 'jewels - 1 freq jeelous - 5 freq july's - 2 freq jolla's - 1 freq jowells - 3 freq jalousie - 12 freq jalouze - 4 freq jeels - 3 freq jaelous - 2 freq jeelies - 4 freq jeilous - 1 freq jaelousy - 1 freq jyles - 1 freq €œjills - 1 freq €œjalouse - 1 freq joelewis - 1 freq jlscwo - 1 freq jools - 1 freq jollies - 1 freq jails - 1 freq jules - 1 freq jellus - 1 freq jlk - 1 freq |
MetaPhone code - JWLS jewels - 20 freq jowels - 3 freq 'jewels - 1 freq jowells - 3 freq |
JEWELS |
| Time to execute Levenshtein function - 0.190783 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.363830 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.028337 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.036721 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.000781 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. |