| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enjoyit (0) - 2 freq enjoyt (1) - 6 freq enjoyin (1) - 68 freq enjoy't (1) - 2 freq enjoyen (2) - 1 freq enjoyed (2) - 130 freq enjoys (2) - 15 freq enjoy's (2) - 1 freq enjoying (2) - 23 freq enjoys't (2) - 1 freq enjyin (2) - 2 freq njoyin (2) - 1 freq injoy't (2) - 1 freq enjoyin' (2) - 1 freq injoyin (2) - 2 freq enjoyan (2) - 1 freq enjeyin (2) - 1 freq enjoy (2) - 331 freq enjosin (2) - 1 freq endowit (2) - 1 freq enjoayin (2) - 1 freq enjosed (3) - 5 freq enjoyment (3) - 7 freq injoy (3) - 2 freq 'enjoy (3) - 2 freq |
enjoyit (0) - 2 freq enjoyt (1) - 6 freq enjoy't (2) - 2 freq enjoyin (2) - 68 freq enjoyan (3) - 1 freq injoy't (3) - 1 freq enjoayin (3) - 1 freq njoyin (3) - 1 freq enjoy (3) - 331 freq enjeyin (3) - 1 freq injoyin (3) - 2 freq enjyin (3) - 2 freq enjoyen (3) - 1 freq enjoyed (3) - 130 freq enjoys (3) - 15 freq njoyed (4) - 4 freq eijit (4) - 1 freq endit (4) - 55 freq enjyed (4) - 2 freq enjose (4) - 3 freq enjoay (4) - 1 freq ejjit (4) - 1 freq eejit (4) - 69 freq ennit (4) - 2 freq injoyed (4) - 2 freq |
SoundEx code - E523 enjoyed - 130 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 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 eemisstane - 2 freq emmaxdeex - 1 freq |
MetaPhone code - ENJYT enjoyed - 130 freq enjeyed - 3 freq enjoyit - 2 freq enjyed - 2 freq |
ENJOYIT |
| Time to execute Levenshtein function - 0.449502 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.699193 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.034534 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.072565 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.001008 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. |