| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| widely (0) - 25 freq wicely (1) - 2 freq wilely (1) - 1 freq wisely (1) - 8 freq wifely (1) - 2 freq wider (2) - 54 freq nicely (2) - 16 freq kinely (2) - 4 freq widest (2) - 3 freq wickly (2) - 2 freq wycely (2) - 2 freq wield (2) - 2 freq wiel (2) - 1 freq hiely (2) - 1 freq widdy (2) - 3 freq wely (2) - 1 freq rudely (2) - 3 freq wildly (2) - 7 freq wident (2) - 2 freq wideboy (2) - 1 freq wifey (2) - 19 freq middly (2) - 3 freq gudely (2) - 1 freq finely (2) - 3 freq wielt (2) - 3 freq |
widely (0) - 25 freq wifely (2) - 2 freq wisely (2) - 8 freq wicely (2) - 2 freq wilely (2) - 1 freq wily (3) - 6 freq widny (3) - 4 freq wigly (3) - 1 freq gudely (3) - 1 freq wiley (3) - 1 freq widney (3) - 5 freq uddely (3) - 1 freq wide (3) - 245 freq wide-o (3) - 3 freq wideboy (3) - 1 freq widy (3) - 6 freq widen (3) - 11 freq tidily (3) - 1 freq willy (3) - 12 freq wely (3) - 1 freq widdy (3) - 3 freq wiel (3) - 1 freq wycely (3) - 2 freq rudely (3) - 3 freq wildly (3) - 7 freq |
SoundEx code - W340 whit'll - 15 freq whittle - 3 freq wheedle - 3 freq 'wit'll - 1 freq widely - 25 freq 'whit'll - 7 freq whuttil - 2 freq whitehall - 7 freq wetl - 1 freq wudll - 1 freq what'll - 3 freq whut'll - 1 freq 'whut'll - 1 freq watl - 1 freq 'w-whit'll - 1 freq widd'll - 1 freq withall - 1 freq whittil - 1 freq waddell - 1 freq withal - 1 freq whitll - 1 freq wdyal - 1 freq waddle - 1 freq whitelaw - 1 freq whitdale - 2 freq whitehill - 2 freq whitley - 1 freq |
MetaPhone code - WTL whit'll - 15 freq whittle - 3 freq wheedle - 3 freq 'wit'll - 1 freq widely - 25 freq 'whit'll - 7 freq whuttil - 2 freq wetl - 1 freq wudll - 1 freq what'll - 3 freq whut'll - 1 freq 'whut'll - 1 freq watl - 1 freq widd'll - 1 freq whittil - 1 freq waddell - 1 freq whitll - 1 freq waddle - 1 freq whitelaw - 1 freq whitley - 1 freq |
WIDELY |
| Time to execute Levenshtein function - 0.199764 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.345819 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.027576 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.037062 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.000852 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. |