| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ennywurt (0) - 1 freq pennywurt (1) - 1 freq ennyworth (2) - 1 freq pennywirth (3) - 1 freq enamourt (3) - 1 freq pennyworth (3) - 3 freq oneywury (3) - 1 freq naywuly (4) - 1 freq oneywuly (4) - 12 freq engert (4) - 1 freq kennawhat (4) - 1 freq endowit (4) - 1 freq ensure (4) - 19 freq pennywell (4) - 1 freq unlyart (4) - 1 freq wanwirt (4) - 2 freq onywuy (4) - 1 freq envyfu (4) - 1 freq endytit (4) - 1 freq innywaey (4) - 2 freq anywhur (4) - 2 freq innywhaur (4) - 1 freq skywart (4) - 1 freq inwart (4) - 1 freq ennit (4) - 2 freq |
ennywurt (0) - 1 freq pennywurt (2) - 1 freq ennyworth (3) - 1 freq wanwirt (5) - 2 freq aunswert (5) - 1 freq onwart (5) - 2 freq inwart (5) - 1 freq unanswert (5) - 1 freq answert (5) - 158 freq benwart (5) - 1 freq pennyworth (5) - 3 freq enamourt (5) - 1 freq pennywirth (5) - 1 freq ainswert (5) - 1 freq oneywury (5) - 1 freq lanwart (5) - 1 freq nnywlo (6) - 1 freq knoydart (6) - 1 freq edwart (6) - 5 freq wurt (6) - 4 freq onywuty (6) - 1 freq enquirt (6) - 1 freq doonwart (6) - 3 freq oneywulty (6) - 2 freq answerit (6) - 1 freq |
SoundEx code - E563 en-route - 1 freq emmerdale - 3 freq ennywurt - 1 freq ennyworth - 1 freq €™emmerteen - 1 freq €œeenertie - 1 freq |
MetaPhone code - ENWRT ennywurt - 1 freq |
ENNYWURT |
| Time to execute Levenshtein function - 0.218185 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.409122 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.028469 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.038930 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.000847 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. |