| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| esson (0) - 1 freq esso (1) - 5 freq lesson (1) - 108 freq kesson (1) - 2 freq eskin (2) - 2 freq nelson (2) - 8 freq petson (2) - 1 freq eisin (2) - 1 freq son (2) - 532 freq 'sron (2) - 1 freq aston (2) - 4 freq masson (2) - 3 freq season (2) - 118 freq eton (2) - 7 freq dyson (2) - 1 freq messan (2) - 5 freq boson (2) - 1 freq essex (2) - 2 freq eiron (2) - 1 freq pessoa (2) - 1 freq ess (2) - 258 freq jason (2) - 24 freq soon (2) - 672 freq fessen (2) - 1 freq essay (2) - 28 freq |
esson (0) - 1 freq essoyne (2) - 1 freq season (2) - 118 freq issin (2) - 1 freq esso (2) - 5 freq lesson (2) - 108 freq kesson (2) - 2 freq essel (3) - 1 freq pyson (3) - 4 freq mason (3) - 11 freq reason (3) - 324 freq leason (3) - 1 freq eskin (3) - 2 freq shon (3) - 7 freq 'soon (3) - 2 freq easin (3) - 11 freq uissan (3) - 3 freq lessen (3) - 10 freq fasson (3) - 6 freq 'son (3) - 2 freq saison (3) - 20 freq uissin (3) - 1 freq susan (3) - 20 freq seasoun (3) - 1 freq saeson (3) - 4 freq |
SoundEx code - E250 ecannae - 2 freq eyes-an - 3 freq echo-in - 3 freq ehicken - 1 freq eesome - 2 freq eikin - 29 freq eskimo - 3 freq echoin - 14 freq exam - 19 freq eggin - 5 freq easin - 11 freq ecn - 2 freq equine - 3 freq egon - 1 freq eskin - 2 freq ehuckin - 1 freq eushion - 1 freq eekin - 1 freq echoan - 2 freq eugene - 1 freq ehucken - 1 freq eesin - 1 freq essoyne - 1 freq esson - 1 freq eisin - 1 freq eschewin - 1 freq eaqm - 1 freq euaazem - 1 freq exxm - 1 freq egan - 3 freq eoghan - 1 freq essayin - 1 freq ezqcn - 1 freq exne - 1 freq |
MetaPhone code - ESN easin - 11 freq aesin - 2 freq eesin - 1 freq essoyne - 1 freq esson - 1 freq eisin - 1 freq |
ESSON |
| Time to execute Levenshtein function - 0.221059 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.409079 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.029250 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.049469 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.001241 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. |