| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exems (0) - 1 freq execs (1) - 1 freq exes (1) - 3 freq exams (1) - 19 freq drems (2) - 1 freq nems (2) - 19 freq eiemv (2) - 1 freq naems (2) - 16 freq dems (2) - 6 freq exsmk (2) - 1 freq excess (2) - 10 freq weems (2) - 1 freq ere's (2) - 279 freq geems (2) - 3 freq erms (2) - 42 freq exam (2) - 19 freq items (2) - 21 freq eyes (2) - 612 freq exempt (2) - 12 freq ems (2) - 4 freq axemn (2) - 1 freq sexes (2) - 5 freq eers (2) - 9 freq eess (2) - 1 freq exits (2) - 2 freq |
exems (0) - 1 freq exams (1) - 19 freq exes (2) - 3 freq execs (2) - 1 freq feems (3) - 1 freq axes (3) - 23 freq tems (3) - 1 freq eetems (3) - 1 freq riems (3) - 1 freq hems (3) - 8 freq neems (3) - 7 freq exemin (3) - 1 freq deems (3) - 6 freq jeems (3) - 91 freq siems (3) - 2 freq enemas (3) - 1 freq elms (3) - 1 freq exis (3) - 1 freq saems (3) - 1 freq xmas (3) - 48 freq eitems (3) - 2 freq teems (3) - 1 freq emms (3) - 1 freq eemis (3) - 10 freq seems (3) - 517 freq |
SoundEx code - E252 excheynge - 1 freq easins - 6 freq essence - 12 freq exams - 19 freq echynged - 1 freq exchangin - 4 freq exchange - 21 freq exchynge - 10 freq exchanged - 4 freq echoing - 2 freq ekeeng - 1 freq eisins - 1 freq ex-council - 1 freq exchanging - 1 freq exchanges - 3 freq eugenic - 1 freq excheenged - 2 freq eshaness - 2 freq eik-ons - 1 freq exchynges - 2 freq excheenge - 1 freq esson's - 1 freq easin-gaits - 1 freq exchynged - 2 freq egunkaria - 1 freq exems - 1 freq exchyngin - 1 freq ejngej - 1 freq exsmk - 1 freq eugenecooke - 2 freq exangbz - 1 freq ejumksfmxu - 1 freq eqinc - 1 freq ekumzj - 1 freq equinox - 1 freq |
MetaPhone code - EKSMS exams - 19 freq exems - 1 freq |
EXEMS |
| Time to execute Levenshtein function - 0.187815 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.326947 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.027798 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.041096 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.000855 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. |