| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exempt (0) - 12 freq excerpt (2) - 5 freq exeest (2) - 1 freq exect (2) - 1 freq except (2) - 144 freq exems (2) - 1 freq blempt (2) - 2 freq hempt (2) - 1 freq exemple (2) - 54 freq tempt (2) - 8 freq exemin (2) - 1 freq exempil (2) - 5 freq exert (2) - 1 freq exeunt (2) - 4 freq exe (3) - 2 freq leemit (3) - 14 freq exp (3) - 1 freq eet (3) - 581 freq teem't (3) - 4 freq eeyit (3) - 1 freq exist (3) - 75 freq element (3) - 45 freq crept (3) - 33 freq egejit (3) - 1 freq kemp (3) - 46 freq |
exempt (0) - 12 freq tempt (3) - 8 freq exempil (3) - 5 freq hempt (3) - 1 freq exemple (3) - 54 freq except (3) - 144 freq tempit (4) - 11 freq jumpt (4) - 8 freq lempit (4) - 2 freq jampt (4) - 1 freq jimpt (4) - 1 freq empty (4) - 207 freq kempit (4) - 2 freq example (4) - 214 freq exemption (4) - 2 freq dampt (4) - 3 freq mumpt (4) - 2 freq compt (4) - 1 freq pumpt (4) - 1 freq blempt (4) - 2 freq excpet (4) - 1 freq exems (4) - 1 freq exect (4) - 1 freq exemin (4) - 1 freq exert (4) - 1 freq |
SoundEx code - E251 example - 214 freq exemplar - 15 freq exaimples - 2 freq exaimple - 5 freq exemple - 54 freq examples - 71 freq exemplars - 13 freq examplar - 1 freq exemplification - 1 freq eosinophilic - 1 freq exemples - 7 freq exempt - 12 freq exempil - 5 freq exaumpil - 2 freq exemplified - 1 freq eximperial - 3 freq exemplary - 2 freq eacuwnpsr - 1 freq egonwvt - 1 freq egmbdnfo - 1 freq echaimbeul - 2 freq exemption - 2 freq exaumple - 2 freq |
MetaPhone code - EKSMPT exempt - 12 freq |
EXEMPT |
| Time to execute Levenshtein function - 0.191866 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.351765 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.027296 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.039077 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.000803 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. |