| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eushion (0) - 1 freq fushion (1) - 30 freq pushion (1) - 6 freq cushion (1) - 28 freq fushioun (2) - 3 freq puzhion (2) - 1 freq rushton (2) - 1 freq fusion (2) - 4 freq pushiont (2) - 2 freq pussion (2) - 1 freq faushion (2) - 1 freq cushions (2) - 11 freq dushin (2) - 1 freq fushin (2) - 19 freq pushin (2) - 64 freq cushin (2) - 3 freq hushin (2) - 1 freq fashion (2) - 71 freq pushioun (2) - 1 freq rushin (2) - 17 freq elshin (2) - 1 freq poushion (2) - 1 freq gushin (2) - 4 freq wushin (2) - 4 freq rullion (3) - 3 freq |
eushion (0) - 1 freq cushion (2) - 28 freq pushion (2) - 6 freq fushion (2) - 30 freq wushin (3) - 4 freq gushin (3) - 4 freq pushioun (3) - 1 freq rushin (3) - 17 freq elshin (3) - 1 freq shoon (3) - 14 freq shon (3) - 7 freq shin (3) - 35 freq suhin (3) - 71 freq fashion (3) - 71 freq oshin (3) - 1 freq ishin (3) - 2 freq poushion (3) - 1 freq fushioun (3) - 3 freq shien (3) - 2 freq hushin (3) - 1 freq dushin (3) - 1 freq faushion (3) - 1 freq cushin (3) - 3 freq pushin (3) - 64 freq fushin (3) - 19 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 - EXN echo-in - 3 freq echoin - 14 freq eushion - 1 freq etchin - 1 freq echoan - 2 freq etioun - 2 freq |
EUSHION |
| Time to execute Levenshtein function - 0.217387 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.344529 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.027646 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.038016 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.000959 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. |