Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ecantrip (0) - 1 freq cantrip (1) - 7 freq cantraip (2) - 4 freq cantrips (2) - 23 freq antrin (3) - 67 freq cantin (3) - 4 freq catnip (3) - 2 freq centrin (3) - 1 freq entrim (3) - 4 freq cantil (3) - 1 freq canaria (3) - 1 freq ecairrit (3) - 1 freq scantit (3) - 1 freq entrie (3) - 5 freq cantit (3) - 1 freq cantripin (3) - 1 freq cantrol (3) - 1 freq antrim (3) - 28 freq tantric (3) - 2 freq cantie (3) - 77 freq recantin (3) - 1 freq eccentric (3) - 2 freq gantrie (3) - 1 freq roadtrip (3) - 1 freq cantraips (3) - 2 freq |
ecantrip (0) - 1 freq cantrip (1) - 7 freq cantraip (2) - 4 freq cantrips (3) - 23 freq cantraips (4) - 2 freq canterin (4) - 1 freq cantripin (4) - 1 freq cantrol (4) - 1 freq centrin (4) - 1 freq control (5) - 129 freq centir (5) - 1 freq centres (5) - 38 freq cantar (5) - 1 freq cuntry (5) - 2 freq countrie (5) - 8 freq contre (5) - 1 freq conterin (5) - 7 freq contrak (5) - 2 freq cuntre (5) - 2 freq cuntra (5) - 29 freq canter (5) - 3 freq centurie (5) - 16 freq cuntras (5) - 4 freq canters (5) - 1 freq cintre (5) - 3 freq |
SoundEx code - E253 ecountry - 1 freq essentially - 6 freq essential - 47 freq eccentrics - 1 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 - EKNTRP ecantrip - 1 freq |
ECANTRIP |
Time to execute Levenshtein function - 0.220906 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.428496 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.036631 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.048080 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.001159 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. |