| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| examples (0) - 71 freq example (1) - 214 freq exemples (1) - 7 freq exaimples (1) - 2 freq samples (2) - 2 freq ensamples (2) - 2 freq exaumple (2) - 2 freq examines (2) - 2 freq exaimple (2) - 5 freq examplar (2) - 1 freq exemple (2) - 54 freq ramples (2) - 1 freq staples (3) - 1 freq exiles (3) - 4 freq examins (3) - 3 freq brammles (3) - 10 freq sample's (3) - 2 freq dimples (3) - 4 freq trampled (3) - 9 freq easles (3) - 2 freq halples (3) - 1 freq enables (3) - 1 freq rampled (3) - 1 freq exalts (3) - 1 freq trample (3) - 2 freq |
examples (0) - 71 freq exemples (1) - 7 freq exaimples (1) - 2 freq example (2) - 214 freq examplar (3) - 1 freq exemple (3) - 54 freq exaimple (3) - 5 freq ramples (3) - 1 freq samples (3) - 2 freq exaumple (3) - 2 freq maples (4) - 1 freq exemplar (4) - 15 freq pimples (4) - 3 freq temples (4) - 9 freq dimples (4) - 4 freq exemplars (4) - 13 freq rimples (4) - 2 freq ensamples (4) - 2 freq rumples (4) - 1 freq simples (4) - 10 freq saumples (4) - 1 freq examines (4) - 2 freq aiples (5) - 4 freq sample (5) - 19 freq ensaumples (5) - 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 - EKSMPLS exaimples - 2 freq examples - 71 freq exemples - 7 freq |
EXAMPLES |
| Time to execute Levenshtein function - 0.203938 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.374404 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.028778 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.037406 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.001059 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. |