| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| willile (0) - 1 freq willie (1) - 196 freq wallie (2) - 25 freq widpile (2) - 1 freq william (2) - 238 freq tillie (2) - 8 freq hillie (2) - 1 freq williame (2) - 1 freq willae (2) - 2 freq willit (2) - 1 freq willin (2) - 58 freq willick (2) - 2 freq willint (2) - 5 freq willl (2) - 1 freq uillie (2) - 1 freq gillie (2) - 2 freq aillie (2) - 1 freq killie (2) - 26 freq wullie (2) - 416 freq whillie (2) - 2 freq willing (2) - 10 freq wellie (2) - 2 freq billie (2) - 33 freq wyllie (2) - 5 freq williew (2) - 1 freq |
willile (0) - 1 freq willie (2) - 196 freq willl (2) - 1 freq williew (3) - 1 freq wyllie (3) - 5 freq wellie (3) - 2 freq whillie (3) - 2 freq willis (3) - 1 freq willinly (3) - 2 freq lillie (3) - 4 freq wulllie (3) - 1 freq willnae (3) - 96 freq wille (3) - 1 freq wullie (3) - 416 freq willies (3) - 6 freq wilelife (3) - 2 freq willae (3) - 2 freq willit (3) - 1 freq willin (3) - 58 freq william (3) - 238 freq williame (3) - 1 freq wallie (3) - 25 freq willow (4) - 15 freq willfu (4) - 1 freq wallace (4) - 117 freq |
SoundEx code - W440 wilely - 1 freq wellhill - 1 freq willile - 1 freq |
MetaPhone code - WLL wilely - 1 freq wheel'll - 1 freq willile - 1 freq |
WILLILE |
| Time to execute Levenshtein function - 0.203542 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.378281 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.027734 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.038568 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.000830 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. |