| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ecn (0) - 2 freq ecz (1) - 1 freq ycn (1) - 1 freq ec (1) - 18 freq cn (1) - 2 freq eck (1) - 425 freq enn (1) - 38 freq ecg (1) - 1 freq eyn (1) - 137 freq mcn (1) - 1 freq eon (1) - 3 freq lecn (1) - 1 freq een (1) - 2862 freq eco (1) - 2 freq ect (1) - 25 freq ean (1) - 46 freq ecb (1) - 1 freq ech (1) - 5 freq evn (1) - 1 freq en (1) - 618 freq ecy (1) - 1 freq ein (1) - 86 freq ecv (1) - 1 freq ern (1) - 14 freq ecc (1) - 1 freq |
ecn (0) - 2 freq cn (1) - 2 freq ycn (1) - 1 freq acne (2) - 3 freq icin (2) - 10 freq cyn (2) - 1 freq ecc (2) - 1 freq can (2) - 4783 freq ecv (2) - 1 freq ein (2) - 86 freq ern (2) - 14 freq cin (2) - 306 freq con (2) - 21 freq cen (2) - 13 freq icon (2) - 10 freq acan (2) - 1 freq ocna (2) - 1 freq ceen (2) - 2 freq ecy (2) - 1 freq cna (2) - 2 freq cun (2) - 18 freq eyn (2) - 137 freq en (2) - 618 freq eon (2) - 3 freq lecn (2) - 1 freq |
SoundEx code - E250 ecannae - 2 freq eyes-an - 3 freq echo-in - 3 freq ehicken - 1 freq eesome - 2 freq eikin - 29 freq eskimo - 3 freq echoin - 14 freq exam - 19 freq eggin - 5 freq easin - 11 freq ecn - 2 freq equine - 3 freq egon - 1 freq eskin - 2 freq ehuckin - 1 freq eushion - 1 freq eekin - 1 freq echoan - 2 freq eugene - 1 freq ehucken - 1 freq eesin - 1 freq essoyne - 1 freq esson - 1 freq eisin - 1 freq eschewin - 1 freq eaqm - 1 freq euaazem - 1 freq exxm - 1 freq egan - 3 freq eoghan - 1 freq essayin - 1 freq ezqcn - 1 freq exne - 1 freq |
MetaPhone code - EKN ecannae - 2 freq eikin - 29 freq eggin - 5 freq ecn - 2 freq equine - 3 freq egon - 1 freq aekin - 1 freq eekin - 1 freq egan - 3 freq |
ECN |
| Time to execute Levenshtein function - 0.196440 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.334124 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.027980 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.036838 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.000920 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. |