| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| essoyne (0) - 1 freq esson (2) - 1 freq erskine (3) - 12 freq sensyne (3) - 7 freq essence (3) - 12 freq sessione (3) - 2 freq kesson (3) - 2 freq ensyde (3) - 4 freq osborne (3) - 3 freq enspyte (3) - 1 freq boyne (3) - 4 freq eyne (3) - 5 freq messine (3) - 1 freq 'syne (3) - 10 freq 'scone (3) - 1 freq messeyge (3) - 2 freq ardoyne (3) - 2 freq respone (3) - 1 freq sonne (3) - 1 freq assynt (3) - 4 freq essay' (3) - 1 freq shone (3) - 43 freq oyne (3) - 3 freq essay (3) - 28 freq eesome (3) - 2 freq |
essoyne (0) - 1 freq esson (2) - 1 freq essayin (3) - 1 freq lesson (4) - 108 freq esso (4) - 5 freq sone (4) - 2 freq essay (4) - 28 freq essay' (4) - 1 freq shone (4) - 43 freq associe (4) - 32 freq stone (4) - 85 freq skyne (4) - 1 freq season (4) - 118 freq seasoun (4) - 1 freq scone (4) - 43 freq essays (4) - 22 freq assynt (4) - 4 freq assyse (4) - 1 freq swyne (4) - 1 freq syne (4) - 1913 freq sessione (4) - 2 freq issin (4) - 1 freq sensyne (4) - 7 freq sonne (4) - 1 freq essence (4) - 12 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 |
ESSOYNE |
| Time to execute Levenshtein function - 0.274602 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.475777 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.031210 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.041061 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.001171 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. |