| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exasperate (0) - 1 freq exasperated (1) - 4 freq exasperatit (2) - 5 freq exaggerate (2) - 4 freq sperate (3) - 1 freq depauperate (3) - 1 freq desperate (3) - 94 freq exasperated (3) - 1 freq exasperation (3) - 4 freq saeperate (3) - 2 freq exaggerated (3) - 11 freq aspirate (3) - 1 freq esperanto (4) - 1 freq moaderate (4) - 8 freq exastet (4) - 1 freq experts (4) - 25 freq evaporates (4) - 1 freq seperate (4) - 2 freq maserati (4) - 1 freq disparate (4) - 2 freq aerate (4) - 1 freq cooperate (4) - 2 freq elaborate (4) - 7 freq exasserbait (4) - 1 freq expert (4) - 44 freq |
exasperate (0) - 1 freq exasperated (2) - 4 freq exasperatit (3) - 5 freq saeperate (4) - 2 freq aspirate (4) - 1 freq desperate (4) - 94 freq exasperation (4) - 4 freq exaggerate (4) - 4 freq sperate (4) - 1 freq saeparate (5) - 1 freq seperate (5) - 2 freq expert (5) - 44 freq disparate (5) - 2 freq depauperate (5) - 1 freq temperate (6) - 3 freq saeperit (6) - 6 freq castrate (6) - 2 freq serperate (6) - 1 freq seperat (6) - 1 freq aspiret (6) - 1 freq dispert (6) - 2 freq operate (6) - 12 freq export (6) - 10 freq fuspert (6) - 7 freq pasport (6) - 5 freq |
SoundEx code - E221 exasperated - 4 freq excessive - 2 freq exasperatit - 5 freq exasperate - 1 freq exasperation - 4 freq exasperated - 1 freq |
MetaPhone code - EKSSPRT exasperate - 1 freq |
EXASPERATE |
| Time to execute Levenshtein function - 0.268531 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.479990 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.032481 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.039797 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.001054 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. |