| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exaimple (0) - 5 freq example (1) - 214 freq exaumple (1) - 2 freq exaimples (1) - 2 freq exemple (2) - 54 freq traimple (2) - 1 freq examples (2) - 71 freq cample (3) - 5 freq aipple (3) - 102 freq dimple (3) - 1 freq traimpled (3) - 1 freq exaumpil (3) - 2 freq ample (3) - 9 freq €˜simple (3) - 1 freq simple (3) - 205 freq examine (3) - 12 freq exile (3) - 20 freq eraichle (3) - 1 freq exemples (3) - 7 freq saumple (3) - 2 freq ensample (3) - 5 freq trample (3) - 2 freq 'simple (3) - 2 freq examplar (3) - 1 freq pimple (3) - 1 freq |
exaimple (0) - 5 freq exaumple (1) - 2 freq example (1) - 214 freq exemple (2) - 54 freq exaimples (2) - 2 freq exaumpil (3) - 2 freq examples (3) - 71 freq simple (4) - 205 freq pimple (4) - 1 freq exemples (4) - 7 freq saumple (4) - 2 freq exempil (4) - 5 freq examplar (4) - 1 freq ample (4) - 9 freq cample (4) - 5 freq traimple (4) - 1 freq sample (4) - 19 freq dimple (4) - 1 freq temple (5) - 86 freq exempt (5) - 12 freq aiple (5) - 5 freq simply (5) - 123 freq maple (5) - 6 freq limply (5) - 1 freq simplie (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 - EKSMPL example - 214 freq exaimple - 5 freq exemple - 54 freq exempil - 5 freq exaumpil - 2 freq exaumple - 2 freq |
EXAIMPLE |
| Time to execute Levenshtein function - 0.402363 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.626243 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.066448 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.038872 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.000866 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. |