| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waddlin (0) - 2 freq waddling (1) - 1 freq waddin (1) - 96 freq waddlan (1) - 1 freq paddlin (1) - 5 freq hiddlin (2) - 4 freq paddelin (2) - 1 freq 'waddin (2) - 1 freq laidlin (2) - 1 freq wadin (2) - 2 freq hoddlin (2) - 1 freq fiddlin (2) - 5 freq piddlin (2) - 2 freq meddlin (2) - 5 freq paidlin (2) - 1 freq wadding (2) - 1 freq maudlin (2) - 1 freq diddlin (2) - 2 freq wammlin (2) - 6 freq handlin (2) - 1 freq wafflin (2) - 2 freq walin (2) - 39 freq riddlin (2) - 1 freq toddlin (2) - 2 freq saddling (2) - 1 freq |
waddlin (0) - 2 freq waddlan (1) - 1 freq waddling (2) - 1 freq paddlin (2) - 5 freq waddin (2) - 96 freq cuddlin (3) - 4 freq waddles (3) - 1 freq widdlaun (3) - 1 freq weedlin (3) - 1 freq riddlin (3) - 1 freq toddlin (3) - 2 freq paiddlin (3) - 4 freq waddlet (3) - 2 freq waddeen (3) - 2 freq coddlin (3) - 1 freq weddin (3) - 40 freq guddlin (3) - 11 freq middlin (3) - 10 freq diddlin (3) - 2 freq waddle (3) - 1 freq hoddlin (3) - 1 freq widdin (3) - 4 freq paddelin (3) - 1 freq hiddlin (3) - 4 freq fiddlin (3) - 5 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 |
WADDLIN |
| Time to execute Levenshtein function - 0.406245 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.599623 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.061059 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.038808 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.000810 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. |