| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheeplin (0) - 8 freq wheetlin (1) - 1 freq wheedlin (1) - 2 freq wheeplit (1) - 2 freq wheelin (1) - 12 freq wheezlin (1) - 1 freq wheepin (1) - 3 freq weepin (2) - 1 freq sheerlin (2) - 3 freq sleeplin (2) - 1 freq heelin (2) - 1 freq wheekin (2) - 3 freq feeplin (2) - 1 freq cheetlin (2) - 1 freq wheepled (2) - 3 freq wheeshin (2) - 2 freq cheepin (2) - 6 freq wheedlit (2) - 4 freq wheepit (2) - 2 freq wheelan (2) - 1 freq wheeple (2) - 2 freq wheeples (2) - 1 freq whimplin (2) - 3 freq seeplin (2) - 1 freq weeglin (2) - 2 freq |
wheeplin (0) - 8 freq wheezlin (2) - 1 freq wheelin (2) - 12 freq wheepin (2) - 3 freq wheeplit (2) - 2 freq wheetlin (2) - 1 freq wheedlin (2) - 2 freq wheeples (3) - 1 freq whimplin (3) - 3 freq wheepled (3) - 3 freq wheelan (3) - 1 freq wheeple (3) - 2 freq whalin (4) - 24 freq dreeplin (4) - 1 freq wheelie (4) - 13 freq wheechin (4) - 40 freq whorlin (4) - 1 freq wheipil (4) - 3 freq whurlin (4) - 1 freq whoopin (4) - 5 freq wimplin (4) - 6 freq whippin (4) - 3 freq whilin (4) - 1 freq whuppin (4) - 6 freq weedlin (4) - 1 freq |
SoundEx code - W145 wheeplin - 8 freq wabblin - 5 freq wobblin - 3 freq wavelength - 1 freq wafflin - 2 freq wafflin' - 1 freq wufflmleny - 1 freq |
MetaPhone code - WPLN wheeplin - 8 freq |
WHEEPLIN |
| Time to execute Levenshtein function - 0.183564 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.347368 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.027526 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.037006 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.000838 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. |