| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jewson (0) - 1 freq newton (2) - 19 freq jessons (2) - 1 freq leason (2) - 1 freq benson (2) - 1 freq kesson (2) - 2 freq person (2) - 249 freq lesson (2) - 108 freq rowson (2) - 2 freq jensen (2) - 1 freq petson (2) - 1 freq season (2) - 118 freq reason (2) - 324 freq neeson (2) - 1 freq lawson (2) - 2 freq jason (2) - 24 freq teason (2) - 2 freq esson (2) - 1 freq jeckson (2) - 1 freq newsan (2) - 2 freq jews (2) - 23 freq newsin (2) - 29 freq jeeso (2) - 1 freq nelson (2) - 8 freq jeemson (2) - 1 freq |
jewson (0) - 1 freq jeemson (3) - 1 freq rowson (3) - 2 freq jensen (3) - 1 freq lawson (3) - 2 freq jews (3) - 23 freq newsin (3) - 29 freq newsan (3) - 2 freq jason (3) - 24 freq ilawson (4) - 8 freq jaws (4) - 48 freq joensen (4) - 3 freq jowin (4) - 4 freq owsen (4) - 3 freq lowsin (4) - 47 freq bowsin (4) - 1 freq jawin (4) - 2 freq jimison (4) - 2 freq dowsin (4) - 2 freq jowpin (4) - 1 freq jameson (4) - 2 freq jmsn (4) - 1 freq jows (4) - 2 freq jewish (4) - 11 freq lowsen (4) - 2 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 - JSN gizzen - 5 freq jizzen - 4 freq gicin - 1 freq gecin - 1 freq jason - 24 freq juicin - 2 freq jessie-annie - 1 freq jycin - 1 freq jewson - 1 freq |
JEWSON |
| Time to execute Levenshtein function - 0.210529 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.407120 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.027752 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.039207 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.000900 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. |