| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exasperatit (0) - 5 freq exasperated (2) - 4 freq exasperate (2) - 1 freq exasperation (2) - 4 freq exaggeratin (3) - 3 freq evaporatit (3) - 1 freq exoneratit (3) - 1 freq exasserbait (3) - 1 freq exerptit (4) - 1 freq exaggerate (4) - 4 freq exertit (4) - 2 freq maserati (4) - 1 freq exaggerated (4) - 11 freq evisceratin (4) - 1 freq exaggeratin' (4) - 1 freq exportit (4) - 1 freq exasperated (4) - 1 freq laceratit (4) - 1 freq expectit (4) - 34 freq assertit (4) - 2 freq exaggeration (4) - 6 freq expecktit (4) - 1 freq exaggerating (4) - 1 freq speertit (5) - 1 freq desperation (5) - 20 freq |
exasperatit (0) - 5 freq exasperation (3) - 4 freq exasperate (3) - 1 freq exasperated (3) - 4 freq exportit (5) - 1 freq exoneratit (5) - 1 freq exasserbait (5) - 1 freq evaporatit (5) - 1 freq assertit (6) - 2 freq expectit (6) - 34 freq spratt (6) - 2 freq spurtit (6) - 1 freq separatit (6) - 6 freq spartit (6) - 2 freq speiritit (6) - 1 freq spiritit (6) - 1 freq speertit (6) - 1 freq exertit (6) - 2 freq exaggeratin (6) - 3 freq exerptit (6) - 1 freq speeritit (6) - 1 freq insertit (7) - 2 freq spentit (7) - 1 freq assortit (7) - 3 freq expertly (7) - 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 - EKSSPRTT exasperated - 4 freq exasperatit - 5 freq exasperated - 1 freq |
EXASPERATIT |
| Time to execute Levenshtein function - 0.229802 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.390520 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.028246 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.037906 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.000974 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. |