| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enjoyt (0) - 6 freq enjoyit (1) - 2 freq enjoys (1) - 15 freq enjoy't (1) - 2 freq enjoy (1) - 331 freq 'enjoy (2) - 2 freq enjey (2) - 11 freq enjogh (2) - 1 freq enjose (2) - 3 freq enjoy's (2) - 1 freq enjoay (2) - 1 freq injoy (2) - 2 freq njoy (2) - 8 freq enjoyen (2) - 1 freq injoys (2) - 1 freq annoyt (2) - 5 freq enjoyin (2) - 68 freq injoy't (2) - 1 freq enjye (2) - 1 freq enjoyan (2) - 1 freq enjoys't (2) - 1 freq enjy (2) - 2 freq enjoyed (2) - 130 freq enyoch (3) - 36 freq enjoayin (3) - 1 freq |
enjoyt (0) - 6 freq enjoyit (1) - 2 freq enjoy't (2) - 2 freq enjoy (2) - 331 freq enjoys (2) - 15 freq enjoyin (3) - 68 freq annoyt (3) - 5 freq injoys (3) - 1 freq injoy't (3) - 1 freq enjoyed (3) - 130 freq enjoyen (3) - 1 freq enjoyan (3) - 1 freq enjye (3) - 1 freq enjy (3) - 2 freq njoy (3) - 8 freq enjose (3) - 3 freq enjey (3) - 11 freq injoy (3) - 2 freq enjoay (3) - 1 freq enj (4) - 1 freq anyont (4) - 1 freq abjoot (4) - 1 freq ent (4) - 3 freq nooat (4) - 1 freq jot (4) - 13 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 - ENJT ehynged - 1 freq en-gedi - 1 freq enjoyt - 6 freq enjoy't - 2 freq |
ENJOYT |
| Time to execute Levenshtein function - 0.202324 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.365596 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.030354 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.039583 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.000852 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. |