| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jecm (0) - 1 freq jeck (1) - 16 freq cjem (2) - 1 freq aecc (2) - 5 freq feck (2) - 160 freq jeel (2) - 7 freq jeyn (2) - 1 freq ech (2) - 5 freq jcz (2) - 1 freq erm (2) - 70 freq deck (2) - 70 freq eum (2) - 1 freq jc (2) - 10 freq reum (2) - 3 freq nem (2) - 53 freq jeh (2) - 1 freq yec (2) - 1 freq vcm (2) - 1 freq helm (2) - 15 freq meck (2) - 1 freq jess (2) - 21 freq jtc (2) - 1 freq reck (2) - 20 freq pmcm (2) - 1 freq sech (2) - 4 freq |
jecm (0) - 1 freq jeck (2) - 16 freq pcm (3) - 1 freq jcj (3) - 1 freq jiim (3) - 1 freq jock (3) - 512 freq jeemy (3) - 3 freq jeuce (3) - 1 freq jom (3) - 1 freq eject (3) - 1 freq jum (3) - 3 freq jic (3) - 1 freq joco (3) - 37 freq jpm (3) - 1 freq jam (3) - 84 freq jemmy (3) - 5 freq becom (3) - 1 freq jack (3) - 230 freq jm (3) - 57 freq jcz (3) - 1 freq becam (3) - 97 freq jc (3) - 10 freq jcb (3) - 2 freq jac (3) - 3 freq jim (3) - 235 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 - JKM €˜giacomo - 1 freq giacomo - 2 freq jcwme - 1 freq jackieme - 2 freq jecm - 1 freq |
JECM |
| Time to execute Levenshtein function - 0.305699 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.509618 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.031691 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.045561 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.001339 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. |