| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exile (0) - 20 freq exiled (1) - 6 freq eile (1) - 1 freq exiles (1) - 4 freq sile (2) - 9 freq lile (2) - 1 freq smile (2) - 450 freq axil (2) - 1 freq file (2) - 118 freq quile (2) - 1 freq ebble (2) - 1 freq ettle (2) - 188 freq exne (2) - 1 freq excite (2) - 2 freq resile (2) - 1 freq erle (2) - 4 freq nile (2) - 14 freq edible (2) - 3 freq exe (2) - 2 freq epple (2) - 13 freq eire (2) - 3 freq rile (2) - 3 freq evil' (2) - 1 freq emily (2) - 11 freq exis (2) - 1 freq |
exile (0) - 20 freq axil (2) - 1 freq axle (2) - 1 freq exiles (2) - 4 freq eile (2) - 1 freq exiled (2) - 6 freq etle (3) - 1 freq tile (3) - 5 freq evil (3) - 89 freq mile (3) - 275 freq geile (3) - 1 freq vile (3) - 14 freq egil (3) - 4 freq elie (3) - 1 freq eedle (3) - 1 freq buile (3) - 1 freq xl (3) - 3 freq ile (3) - 65 freq eagle (3) - 20 freq agile (3) - 2 freq pile (3) - 110 freq xjle (3) - 1 freq eil (3) - 10 freq guile (3) - 4 freq emili (3) - 1 freq |
SoundEx code - E240 easily - 59 freq easely - 1 freq e-coli - 1 freq equal - 71 freq egil - 4 freq 'egil - 2 freq eeswal - 10 freq eeswally - 4 freq equally - 35 freq eagle - 20 freq excel - 3 freq exile - 20 freq eisweel - 3 freq eggle - 2 freq ess'll - 1 freq 'equal - 1 freq eisel - 1 freq 'e-colly' - 1 freq ecoul - 1 freq equallie - 1 freq esli - 3 freq easel - 1 freq ees-sel - 1 freq eheswally - 1 freq essel - 1 freq esel - 2 freq e-sgoil - 1 freq €™ecole - 1 freq eezsel - 1 freq eggshell - 1 freq 'esel' - 2 freq easle - 2 freq eequalee - 1 freq eesel - 1 freq eesell - 1 freq eosl - 3 freq |
MetaPhone code - EKSL exile - 20 freq |
EXILE |
| Time to execute Levenshtein function - 0.198315 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.342624 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.037336 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.037264 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.000910 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. |