| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exemplars (0) - 13 freq exemplar (1) - 15 freq exemplary (1) - 2 freq exemples (2) - 7 freq examplar (2) - 1 freq examples (3) - 71 freq exemple (3) - 54 freq excepturs (4) - 1 freq example (4) - 215 freq exempt (4) - 12 freq templates (4) - 2 freq enemas (4) - 1 freq exems (4) - 1 freq semple's (4) - 1 freq extempore (4) - 1 freq kempers (4) - 2 freq explores (4) - 1 freq explaen (4) - 2 freq ex-miners (4) - 1 freq pedlars (4) - 1 freq sellars (4) - 1 freq exempil (4) - 5 freq velars (4) - 1 freq poplars (4) - 2 freq seemlar (4) - 9 freq |
exemplars (0) - 13 freq exemplary (2) - 2 freq exemplar (2) - 15 freq examplar (3) - 1 freq exemples (3) - 7 freq examples (4) - 71 freq explores (5) - 1 freq exemple (5) - 54 freq exaimples (5) - 2 freq exploads (6) - 1 freq employs (6) - 2 freq tempers (6) - 2 freq explaens (6) - 1 freq explains (6) - 29 freq poplars (6) - 2 freq temples (6) - 10 freq explore (6) - 28 freq sempler (6) - 2 freq exempil (6) - 5 freq excepturs (6) - 1 freq example (6) - 215 freq semple's (6) - 1 freq employers (6) - 5 freq kempers (6) - 2 freq templates (6) - 2 freq |
SoundEx code - E251 example - 215 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 - EKSMPLRS exemplars - 13 freq |
EXEMPLARS |
| Time to execute Levenshtein function - 0.194305 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.344537 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.027659 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.036917 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.000912 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. |