| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheedlin (0) - 2 freq wheeplin (1) - 8 freq wheezlin (1) - 1 freq wheedlit (1) - 4 freq wheetlin (1) - 1 freq wheelin (1) - 12 freq weedlin (1) - 1 freq wheezin (2) - 8 freq wheekin (2) - 3 freq weeglin (2) - 2 freq heedin (2) - 11 freq wheelan (2) - 1 freq sheerlin (2) - 3 freq cheetlin (2) - 1 freq wheengin (2) - 3 freq dreedlin (2) - 1 freq weedin (2) - 7 freq wheechin (2) - 40 freq wheedled (2) - 2 freq wheedlt (2) - 1 freq wheedle (2) - 3 freq wheepin (2) - 3 freq seedlin (2) - 2 freq heelin (2) - 1 freq wheelie (2) - 13 freq |
wheedlin (0) - 2 freq weedlin (2) - 1 freq wheelin (2) - 12 freq wheetlin (2) - 1 freq wheeplin (2) - 8 freq wheezlin (2) - 1 freq wheedlit (2) - 4 freq wheedlt (3) - 1 freq wheedle (3) - 3 freq wheedled (3) - 2 freq wheelan (3) - 1 freq whorlin (4) - 1 freq whirlin (4) - 5 freq whiddin (4) - 1 freq headline (4) - 10 freq wheeplit (4) - 2 freq whilin (4) - 1 freq hidlin (4) - 1 freq waddlin (4) - 2 freq heidlan (4) - 1 freq whalin (4) - 24 freq whurlin (4) - 1 freq heidline (4) - 13 freq wheelie (4) - 13 freq wheeshin (4) - 2 freq |
SoundEx code - W345 widlaunds - 1 freq widland - 10 freq wheetlin - 1 freq wheedlin - 2 freq wuidlands - 2 freq waddlan - 1 freq waddlin - 2 freq widlan - 2 freq weedlin - 1 freq wuidland - 1 freq widlands - 2 freq wuidlans - 1 freq waddling - 1 freq widdlaun - 1 freq wetlands - 1 freq €œwiidlan - 1 freq whuttlin - 2 freq woodland - 1 freq wat-lint - 1 freq |
MetaPhone code - WTLN wheetlin - 1 freq wheedlin - 2 freq waddlan - 1 freq waddlin - 2 freq widlan - 2 freq weedlin - 1 freq widdlaun - 1 freq €œwiidlan - 1 freq whuttlin - 2 freq |
WHEEDLIN |
| Time to execute Levenshtein function - 0.243779 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.465026 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.030358 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.040027 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.001100 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. |