| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emsket (0) - 1 freq basket (2) - 62 freq elsker (2) - 1 freq casket (2) - 1 freq gasket (2) - 2 freq asket (2) - 1 freq musket (2) - 16 freq emblem (3) - 4 freq yset (3) - 2 freq essex (3) - 2 freq est (3) - 22 freq evoke (3) - 3 freq bisset (3) - 4 freq ashet (3) - 25 freq empied (3) - 3 freq mckee (3) - 1 freq east (3) - 307 freq market (3) - 51 freq emit (3) - 4 freq manet (3) - 1 freq poket (3) - 4 freq emerent (3) - 1 freq racket (3) - 25 freq newsnet (3) - 2 freq askew (3) - 2 freq |
emsket (0) - 1 freq musket (2) - 16 freq basket (3) - 62 freq maskit (3) - 3 freq asket (3) - 1 freq casket (3) - 1 freq gasket (3) - 2 freq muskey (4) - 5 freq masked (4) - 8 freq beskit (4) - 3 freq makt (4) - 4 freq jeskit (4) - 1 freq jaskit (4) - 1 freq gaskit (4) - 1 freq makit (4) - 41 freq saiket (4) - 1 freq mustet (4) - 1 freq askit (4) - 133 freq taskit (4) - 1 freq riskt (4) - 1 freq deeskit (4) - 1 freq maset (4) - 1 freq soaket (4) - 4 freq biskit (4) - 1 freq elaskit (4) - 1 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 - EMSKT emsket - 1 freq |
EMSKET |
| Time to execute Levenshtein function - 0.191128 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.401188 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.030313 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.037527 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.000925 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. |