| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| examples (0) - 71 freq exaimples (1) - 2 freq example (1) - 215 freq exemples (1) - 7 freq exaimple (2) - 5 freq ramples (2) - 1 freq exemple (2) - 54 freq samples (2) - 2 freq examplar (2) - 1 freq examines (2) - 2 freq exaumple (2) - 2 freq ensamples (2) - 2 freq trampled (3) - 10 freq sample's (3) - 2 freq exemplar (3) - 15 freq sampled (3) - 2 freq examen (3) - 1 freq gambles (3) - 2 freq examine (3) - 13 freq brambles (3) - 6 freq exalts (3) - 1 freq rumples (3) - 1 freq simples (3) - 10 freq ambles (3) - 2 freq maples (3) - 1 freq |
examples (0) - 71 freq exaimples (1) - 2 freq exemples (1) - 7 freq example (2) - 215 freq examplar (3) - 1 freq samples (3) - 2 freq exaumple (3) - 2 freq exaimple (3) - 5 freq exemple (3) - 54 freq ramples (3) - 1 freq maples (4) - 1 freq rimples (4) - 2 freq pimples (4) - 3 freq rumples (4) - 1 freq temples (4) - 10 freq exemplar (4) - 15 freq simples (4) - 10 freq examines (4) - 2 freq ensamples (4) - 2 freq saumples (4) - 1 freq exemplars (4) - 13 freq dimples (4) - 4 freq apples (5) - 10 freq sample (5) - 20 freq aiples (5) - 4 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 - EKSMPLS exaimples - 2 freq examples - 71 freq exemples - 7 freq |
EXAMPLES |
| Time to execute Levenshtein function - 0.238294 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.369250 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.028271 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.038416 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.001028 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. |