| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exempil (0) - 5 freq exemin (2) - 1 freq exemple (2) - 54 freq exempt (2) - 12 freq exaumpil (2) - 2 freq sempil (2) - 8 freq ex-pupil (3) - 1 freq exlpid (3) - 1 freq expel (3) - 1 freq kempin (3) - 5 freq exemples (3) - 7 freq empie (3) - 25 freq enemie (3) - 7 freq exems (3) - 1 freq exertit (3) - 2 freq exertin (3) - 1 freq example (3) - 215 freq wumpil (3) - 1 freq ereepit (3) - 1 freq een'il (3) - 2 freq sempill (3) - 3 freq pepil (3) - 2 freq peepil (3) - 1 freq exerptit (3) - 1 freq exceppin (3) - 2 freq |
exempil (0) - 5 freq exemple (2) - 54 freq exaumpil (2) - 2 freq example (3) - 215 freq sempil (3) - 8 freq exempt (3) - 12 freq wumpil (4) - 1 freq exemplar (4) - 15 freq simpil (4) - 1 freq templ (4) - 2 freq exaumple (4) - 2 freq exaimple (4) - 5 freq exemin (4) - 1 freq expel (4) - 1 freq exemples (4) - 7 freq examples (5) - 71 freq examplar (5) - 1 freq lempit (5) - 2 freq tempit (5) - 11 freq maipil (5) - 1 freq email (5) - 51 freq tempin (5) - 4 freq compel (5) - 1 freq kempit (5) - 2 freq semplie (5) - 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 - EKSMPL example - 215 freq exaimple - 5 freq exemple - 54 freq exempil - 5 freq exaumpil - 2 freq exaumple - 2 freq |
EXEMPIL |
| Time to execute Levenshtein function - 0.373317 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.591600 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.029678 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.067429 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.000903 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. |