| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enactit (0) - 3 freq inactit (1) - 4 freq enactin (1) - 1 freq enackit (1) - 2 freq elatit (2) - 1 freq ejectit (2) - 1 freq redactit (2) - 1 freq ectit (2) - 1 freq reactit (2) - 2 freq actit (2) - 9 freq exaltit (2) - 1 freq electit (2) - 22 freq pactit (2) - 3 freq erectit (2) - 1 freq eatit (2) - 1 freq exactin (2) - 2 freq endytit (2) - 1 freq evictit (2) - 1 freq enackin (2) - 2 freq enactin' (2) - 1 freq evitit (3) - 2 freq actis (3) - 1 freq enack (3) - 1 freq trackit (3) - 1 freq traitit (3) - 5 freq |
enactit (0) - 3 freq inactit (1) - 4 freq enackit (2) - 2 freq enactin (2) - 1 freq electit (3) - 22 freq pactit (3) - 3 freq actit (3) - 9 freq evictit (3) - 1 freq erectit (3) - 1 freq ectit (3) - 1 freq ejectit (3) - 1 freq endytit (3) - 1 freq reactit (3) - 2 freq coatit (4) - 5 freq negatit (4) - 1 freq educatit (4) - 13 freq entity (4) - 17 freq evacuatit (4) - 1 freq excitit (4) - 31 freq anyntit (4) - 1 freq intit (4) - 11 freq executit (4) - 10 freq notit (4) - 13 freq nacht (4) - 2 freq nestit (4) - 3 freq |
SoundEx code - E523 enjoyed - 135 freq enjeyed - 3 freq enmaist - 1 freq einstein - 7 freq ehynged - 1 freq en-gedi - 1 freq ensyde - 4 freq enstructien's - 1 freq eensidint - 1 freq ensident - 1 freq eensident - 1 freq ennct - 1 freq ensyde's - 1 freq eenstrumint - 1 freq ensteyd - 2 freq enster - 2 freq eemisstane - 3 freq en'ught - 1 freq enjoyt - 6 freq enjoy't - 2 freq eonsiderin - 1 freq enactin' - 1 freq emsket - 1 freq enackit - 2 freq enjoyit - 2 freq enjyed - 2 freq enactit - 3 freq en-suite - 1 freq ensued - 3 freq emaciated - 2 freq enactments - 1 freq enactin - 1 freq ensuite - 1 freq eamiesdubd - 1 freq euaneast - 1 freq emmaxdeex - 1 freq |
MetaPhone code - ENKTT enactit - 3 freq |
ENACTIT |
| Time to execute Levenshtein function - 0.209506 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.386795 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.028777 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.037503 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.000932 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. |