| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enemies (0) - 37 freq enemie (1) - 7 freq inemies (1) - 3 freq entries (2) - 35 freq nemmes (2) - 10 freq inimies (2) - 2 freq onesies (2) - 1 freq elegies (2) - 3 freq enemas (2) - 1 freq eemis (2) - 12 freq eenies (2) - 15 freq deemies (2) - 1 freq energies (2) - 2 freq enemy's (2) - 1 freq lammies (3) - 5 freq seemes (3) - 1 freq relies (3) - 1 freq annies (3) - 1 freq keelies (3) - 10 freq nemms (3) - 2 freq enmity (3) - 4 freq eerins (3) - 6 freq semis (3) - 4 freq benefits (3) - 55 freq sentries (3) - 3 freq |
enemies (0) - 37 freq inemies (1) - 3 freq enemas (2) - 1 freq enemie (2) - 7 freq inimies (2) - 2 freq names (3) - 304 freq nemos (3) - 1 freq enemy's (3) - 1 freq nems (3) - 20 freq eenies (3) - 15 freq deemies (3) - 1 freq nemmes (3) - 10 freq onesies (3) - 1 freq eemis (3) - 12 freq anemia (4) - 1 freq enes (4) - 2 freq armies (4) - 4 freq kemis (4) - 1 freq onesie (4) - 1 freq exems (4) - 1 freq eneados (4) - 5 freq namesy (4) - 1 freq damies (4) - 1 freq nims (4) - 2 freq undies (4) - 3 freq |
SoundEx code - E552 enemies - 37 freq enemas - 1 freq eenins - 2 freq enhance - 15 freq enhancing - 1 freq enunclated - 1 freq enunciatin - 1 freq emancipator - 1 freq eamonnss - 1 freq enhanced - 2 freq enhances - 1 freq eumenius - 1 freq enemy's - 1 freq eamonns - 1 freq |
MetaPhone code - ENMS enemies - 37 freq enemas - 1 freq enemy's - 1 freq |
ENEMIES |
| Time to execute Levenshtein function - 0.183256 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.362503 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.032061 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.040627 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.000936 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. |