| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| widlan (0) - 2 freq willan (1) - 5 freq widland (1) - 10 freq waddlan (2) - 1 freq killan (2) - 2 freq whirlan (2) - 1 freq finlan (2) - 1 freq willans (2) - 1 freq widnad (2) - 1 freq wirkan (2) - 12 freq willen (2) - 4 freq aidan (2) - 5 freq bidan (2) - 9 freq wishan (2) - 2 freq wilin (2) - 1 freq widae (2) - 2 freq birlan (2) - 18 freq winnan (2) - 1 freq heidlan (2) - 1 freq willin (2) - 59 freq wuidland (2) - 1 freq millan (2) - 1 freq widdin (2) - 4 freq widda (2) - 36 freq widdlaun (2) - 1 freq |
widlan (0) - 2 freq widland (2) - 10 freq willan (2) - 5 freq widdlaun (3) - 1 freq hidlin (3) - 1 freq wuidland (3) - 1 freq willin (3) - 59 freq sidlin (3) - 1 freq widn (3) - 4 freq widden (3) - 134 freq wuidlans (3) - 1 freq widen (3) - 13 freq wid'n (3) - 2 freq wide-an (3) - 1 freq heidlan (3) - 1 freq widnae (3) - 435 freq widna (3) - 443 freq widdin (3) - 4 freq weedlin (3) - 1 freq willen (3) - 4 freq wilin (3) - 1 freq waddlan (3) - 1 freq wilno (4) - 2 freq weddin (4) - 40 freq wuidn (4) - 1 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 |
WIDLAN |
| Time to execute Levenshtein function - 0.204677 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.441746 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.039219 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.051052 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.001296 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. |