| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etude (0) - 1 freq stude (1) - 44 freq exude (1) - 4 freq elude (1) - 1 freq delude (2) - 1 freq ettie (2) - 4 freq tube (2) - 46 freq sture (2) - 6 freq stunde (2) - 1 freq crude (2) - 5 freq tuke (2) - 1 freq ettle (2) - 188 freq flude (2) - 6 freq tue (2) - 9 freq studs (2) - 6 freq tume (2) - 14 freq tune (2) - 146 freq elide (2) - 1 freq jude (2) - 27 freq begude (2) - 2 freq ende (2) - 3 freq stade (2) - 3 freq étude (2) - 1 freq eause (2) - 2 freq studie (2) - 10 freq |
etude (0) - 1 freq tide (2) - 117 freq elude (2) - 1 freq tyde (2) - 24 freq exude (2) - 4 freq stude (2) - 44 freq gude (3) - 82 freq eirde (3) - 2 freq utd (3) - 11 freq stide (3) - 2 freq ture (3) - 2 freq etle (3) - 1 freq ted (3) - 13 freq dude (3) - 20 freq nude (3) - 4 freq stud (3) - 38 freq cude (3) - 1 freq lude (3) - 1 freq tod (3) - 275 freq tid (3) - 25 freq td (3) - 9 freq bude (3) - 14 freq betide (3) - 4 freq tad (3) - 54 freq laude (3) - 1 freq |
SoundEx code - E330 edith - 18 freq eidiot - 1 freq eidiot' - 1 freq edit - 17 freq eediot - 5 freq etude - 1 freq 'edit' - 1 freq eatit - 1 freq edyta - 7 freq €œedith - 3 freq eyeteeth - 1 freq ediot - 1 freq |
MetaPhone code - ETT eidiot - 1 freq eidiot' - 1 freq edit - 17 freq eediot - 5 freq etude - 1 freq 'edit' - 1 freq eatit - 1 freq edyta - 7 freq ediot - 1 freq |
ETUDE |
| Time to execute Levenshtein function - 0.389579 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.609129 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.061605 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.040922 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.000954 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. |