Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
embalm (0) - 1 freq balm (2) - 6 freq embla (2) - 2 freq emblem (2) - 4 freq embark (2) - 2 freq mbl (3) - 1 freq baulm (3) - 1 freq macm (3) - 1 freq email (3) - 50 freq ebay (3) - 6 freq embalm''d (3) - 1 freq cymbals (3) - 3 freq elba (3) - 15 freq cabal (3) - 2 freq realm (3) - 20 freq verbal (3) - 28 freq emm (3) - 6 freq emmm (3) - 2 freq eraly (3) - 1 freq basm (3) - 1 freq becalm (3) - 2 freq maim (3) - 7 freq embdy (3) - 14 freq elbae (3) - 12 freq caalm (3) - 1 freq |
embalm (0) - 1 freq emblem (2) - 4 freq balm (3) - 6 freq embla (3) - 2 freq balmy (4) - 2 freq blm (4) - 1 freq amble (4) - 2 freq imbolc (4) - 1 freq emblems (4) - 1 freq umbels (4) - 1 freq embark (4) - 2 freq mbl (4) - 1 freq baulm (4) - 1 freq amabam (4) - 2 freq ebola (5) - 1 freq qbal (5) - 1 freq bal' (5) - 1 freq embawmed (5) - 1 freq mam (5) - 246 freq meal (5) - 128 freq embed (5) - 2 freq bald (5) - 16 freq 'bale (5) - 2 freq eqbl (5) - 1 freq bal (5) - 6 freq |
SoundEx code - E514 envelope - 71 freq embalm - 1 freq employer - 10 freq envelope-fillers - 1 freq emboldened - 2 freq envolved - 1 freq enflooinse - 1 freq enflooense - 1 freq employ - 15 freq employers - 5 freq employment - 18 freq emblem - 4 freq enfauldin - 2 freq employees - 7 freq employee - 3 freq envelopes - 6 freq emblazoned - 3 freq embellish - 2 freq embalm''d - 1 freq employed - 8 freq enable - 4 freq employs - 2 freq envelops - 1 freq enabled - 1 freq enables - 1 freq enflamed - 1 freq embellishing - 1 freq enfield's - 2 freq emblems - 1 freq embellishes - 1 freq embellishments - 1 freq enfauldit - 1 freq enfolding - 1 freq enveloped - 1 freq enfield - 7 freq enfields - 1 freq employability - 1 freq envelopit - 1 freq envelopin - 1 freq employing - 1 freq enfluenced - 1 freq embla - 2 freq employments - 1 freq |
MetaPhone code - EMLM embalm - 1 freq emblem - 4 freq |
EMBALM |
Time to execute Levenshtein function - 0.203255 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.348700 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.027556 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.037055 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.000777 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. |