| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eggle (0) - 2 freq aggle (1) - 2 freq geggle (1) - 1 freq eggie (1) - 8 freq eagle (1) - 20 freq egged (2) - 5 freq eedle (2) - 1 freq toggle (2) - 1 freq eggo (2) - 1 freq tengle (2) - 1 freq agile (2) - 2 freq legge (2) - 8 freq raggle (2) - 207 freq gaggle (2) - 5 freq puggle (2) - 1 freq muggle (2) - 4 freq bogle (2) - 45 freq engla (2) - 1 freq etle (2) - 1 freq aggie (2) - 49 freq eagled (2) - 1 freq egil (2) - 4 freq wengle (2) - 1 freq engli (2) - 2 freq eggies (2) - 4 freq |
eggle (0) - 2 freq aggle (1) - 2 freq eggie (2) - 8 freq eagle (2) - 20 freq geggle (2) - 1 freq weigle (3) - 1 freq aigle (3) - 4 freq eggin (3) - 5 freq egg (3) - 95 freq google (3) - 80 freq juggle (3) - 1 freq maggle (3) - 1 freq giggle (3) - 21 freq bugle (3) - 2 freq gle (3) - 4 freq beagle (3) - 2 freq ingle (3) - 29 freq weegle (3) - 1 freq eggy (3) - 1 freq diggle (3) - 1 freq gale (3) - 64 freq geggie (3) - 17 freq ugugly (3) - 2 freq aggled (3) - 1 freq angle (3) - 22 freq |
SoundEx code - E240 easily - 60 freq easely - 1 freq e-coli - 1 freq equal - 71 freq egil - 4 freq 'egil - 2 freq eeswal - 10 freq eeswally - 4 freq equally - 36 freq eagle - 20 freq excel - 3 freq exile - 20 freq eisweel - 3 freq eezsel - 4 freq eggle - 2 freq ess'll - 1 freq 'equal - 1 freq eisel - 1 freq 'e-colly' - 1 freq ecoul - 1 freq equallie - 1 freq esli - 3 freq easel - 1 freq ees-sel - 1 freq eheswally - 1 freq essel - 1 freq esel - 2 freq e-sgoil - 1 freq €™ecole - 1 freq eggshell - 1 freq 'esel' - 2 freq easle - 2 freq eequalee - 1 freq eesel - 1 freq eesell - 1 freq eosl - 3 freq |
MetaPhone code - EKL e-coli - 1 freq equal - 71 freq equally - 36 freq eagle - 20 freq eggle - 2 freq 'equal - 1 freq 'e-colly' - 1 freq ecoul - 1 freq equallie - 1 freq €™ecole - 1 freq eequalee - 1 freq |
EGGLE |
| Time to execute Levenshtein function - 0.294197 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.518163 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.064210 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.037024 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.000905 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. |