| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| equally (0) - 36 freq squally (1) - 1 freq qually (1) - 1 freq equals (2) - 10 freq €œqually (2) - 1 freq dually (2) - 3 freq equallie (2) - 1 freq usually (2) - 176 freq sexually (2) - 1 freq equality (2) - 34 freq squalls (2) - 1 freq ectually (2) - 1 freq squall (2) - 1 freq equal (2) - 71 freq wally (3) - 48 freq early (3) - 366 freq uswally (3) - 1 freq bully (3) - 24 freq orally (3) - 2 freq vitally (3) - 1 freq equalise (3) - 4 freq fatally (3) - 2 freq equator (3) - 2 freq qualify (3) - 6 freq uisually (3) - 3 freq |
equally (0) - 36 freq qually (1) - 1 freq squally (2) - 1 freq equallie (2) - 1 freq equal (3) - 71 freq squall (3) - 1 freq equality (3) - 34 freq quelle (3) - 1 freq quill (3) - 15 freq quell (3) - 5 freq dually (3) - 3 freq usually (3) - 176 freq equals (3) - 10 freq quately (4) - 21 freq ideally (4) - 2 freq uizually (4) - 2 freq squill (4) - 4 freq rally (4) - 10 freq dally (4) - 1 freq lally (4) - 2 freq eequalee (4) - 1 freq dully (4) - 2 freq aurally (4) - 1 freq tally (4) - 3 freq sally (4) - 145 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 |
EQUALLY |
| Time to execute Levenshtein function - 0.168969 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.354302 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.032453 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.037159 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.000938 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. |