| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exne (0) - 1 freq ene (1) - 40 freq exe (1) - 2 freq eyne (1) - 5 freq eine (1) - 1 freq erne (1) - 4 freq exy (2) - 1 freq eke (2) - 3 freq kine (2) - 101 freq axle (2) - 1 freq ens (2) - 16 freq hxn (2) - 1 freq erke (2) - 1 freq evie (2) - 8 freq eyns (2) - 7 freq hane (2) - 4 freq eince (2) - 1 freq expone (2) - 2 freq ecce (2) - 1 freq exp (2) - 1 freq tane (2) - 175 freq expel (2) - 1 freq eye (2) - 237 freq nsne (2) - 1 freq nine (2) - 234 freq |
exne (0) - 1 freq xno (2) - 1 freq xni (2) - 1 freq erne (2) - 4 freq eine (2) - 1 freq exe (2) - 2 freq xn (2) - 3 freq eyne (2) - 5 freq ene (2) - 40 freq lane (3) - 240 freq wine (3) - 272 freq dine (3) - 26 freq ex (3) - 34 freq lyne (3) - 21 freq eno (3) - 9 freq enna (3) - 11 freq rine (3) - 1 freq enno (3) - 6 freq expo (3) - 1 freq exude (3) - 4 freq wane (3) - 12 freq ernie (3) - 50 freq jyne (3) - 116 freq yone (3) - 7 freq sene (3) - 3 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 - EKSN exne - 1 freq |
EXNE |
| Time to execute Levenshtein function - 0.250808 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.388056 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.028560 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.045515 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.001004 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. |