| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exemple (0) - 54 freq exemples (1) - 7 freq example (1) - 215 freq exempil (2) - 5 freq exaimple (2) - 5 freq semple (2) - 24 freq exaumple (2) - 2 freq temple (2) - 87 freq exemplar (2) - 15 freq examples (2) - 71 freq exempt (2) - 12 freq eemage (3) - 18 freq trample (3) - 3 freq kempie (3) - 1 freq steeple (3) - 12 freq saumple (3) - 2 freq hempie (3) - 2 freq exemplary (3) - 2 freq tremble (3) - 6 freq tremmle (3) - 5 freq treeple (3) - 1 freq resemble (3) - 3 freq ensemble (3) - 4 freq demmle (3) - 2 freq themole (3) - 1 freq |
exemple (0) - 54 freq example (1) - 215 freq exaumple (2) - 2 freq exaimple (2) - 5 freq exempil (2) - 5 freq exemples (2) - 7 freq exempt (3) - 12 freq exemplar (3) - 15 freq examples (3) - 71 freq temple (3) - 87 freq semple (3) - 24 freq templ (4) - 2 freq dimple (4) - 1 freq ample (4) - 9 freq cample (4) - 5 freq sample (4) - 20 freq exaimples (4) - 2 freq pimple (4) - 1 freq examplar (4) - 1 freq semply (4) - 2 freq saumple (4) - 2 freq semplie (4) - 2 freq simple (4) - 205 freq exemplary (4) - 2 freq exaumpil (4) - 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 |
EXEMPLE |
| Time to execute Levenshtein function - 0.198946 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.348274 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.027409 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.037166 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.000920 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. |