| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| essential (0) - 47 freq 'essential (1) - 1 freq essentials (1) - 3 freq essention (2) - 1 freq €œessential (2) - 1 freq essentially (2) - 6 freq emmenthal (3) - 1 freq potential (3) - 90 freq terential (3) - 1 freq eventual (3) - 4 freq existential (3) - 7 freq residential (3) - 3 freq essentiallie (3) - 1 freq sentral (3) - 1 freq especial (3) - 6 freq stentin (4) - 2 freq oriental (4) - 1 freq stencil (4) - 1 freq speshial (4) - 1 freq ental (4) - 1 freq sselliat (4) - 1 freq ensenyie (4) - 1 freq essel (4) - 1 freq sundial (4) - 1 freq essence (4) - 12 freq |
essential (0) - 47 freq essentials (2) - 3 freq 'essential (2) - 1 freq essentially (3) - 6 freq essention (3) - 1 freq essentiallie (4) - 1 freq €œessential (4) - 1 freq residential (5) - 3 freq existential (5) - 7 freq sentral (5) - 1 freq assent (5) - 2 freq eventual (5) - 4 freq potential (5) - 90 freq terential (5) - 1 freq seendil (6) - 2 freq sentir (6) - 1 freq dental (6) - 7 freq stentie (6) - 1 freq resiedential (6) - 1 freq ineetial (6) - 1 freq assertit (6) - 2 freq sentle (6) - 1 freq resentit (6) - 2 freq lentil (6) - 5 freq bestial (6) - 1 freq |
SoundEx code - E253 ecountry - 1 freq essentially - 6 freq essential - 47 freq eccentric - 2 freq ex-model - 1 freq ezentn - 1 freq eccent - 4 freq 'essential - 1 freq essentials - 3 freq exeunt - 4 freq ecantrip - 1 freq essentiallie - 1 freq ee-candy - 1 freq eiss-shintie - 1 freq €œessential - 1 freq essention - 1 freq exeemed - 1 freq eecmdqqi - 1 freq eoghand - 1 freq ex-meadow - 1 freq eqomtfhgto - 1 freq ekxmduy - 1 freq ekeinootmorehoursfaedaday - 1 freq |
MetaPhone code - ESNXL essentially - 6 freq essential - 47 freq 'essential - 1 freq essentiallie - 1 freq €œessential - 1 freq |
ESSENTIAL |
| Time to execute Levenshtein function - 0.308151 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.560605 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.026916 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.036740 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.000786 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. |