Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wnl (0) - 1 freq wxl (1) - 2 freq wil (1) - 12 freq whl (1) - 1 freq wl (1) - 6 freq nl (1) - 6 freq wal (1) - 24 freq snl (1) - 2 freq wll (1) - 1 freq mnl (1) - 1 freq wn (1) - 7 freq wul (1) - 318 freq wenl (1) - 1 freq wih (2) - 2 freq zsl (2) - 1 freq hl (2) - 1 freq n' (2) - 20 freq dul (2) - 1 freq 'na (2) - 58 freq wth (2) - 1 freq wxi (2) - 1 freq fwnp (2) - 1 freq wld (2) - 1 freq nq (2) - 6 freq whu (2) - 1 freq |
wnl (0) - 1 freq wenl (1) - 1 freq wll (2) - 1 freq mnl (2) - 1 freq wul (2) - 318 freq snl (2) - 2 freq wn (2) - 7 freq wal (2) - 24 freq wxl (2) - 2 freq wil (2) - 12 freq whl (2) - 1 freq nl (2) - 6 freq wl (2) - 6 freq awnt (3) - 1 freq wun (3) - 200 freq wont (3) - 31 freq wona (3) - 1 freq wen (3) - 18 freq wink (3) - 117 freq will (3) - 3251 freq wall (3) - 76 freq wily (3) - 6 freq awol (3) - 9 freq onli (3) - 40 freq lanl (3) - 1 freq |
SoundEx code - W540 whummlle - 1 freq wean'll - 3 freq whummle - 7 freq wainly - 1 freq whammle - 2 freq winmill - 1 freq wine'll - 1 freq wheen'll - 1 freq win'll - 1 freq whummil - 1 freq wummile - 1 freq wammle - 2 freq wummle - 1 freq wummily - 2 freq wan-nil - 1 freq wenl - 1 freq weenell - 8 freq wnl - 1 freq |
MetaPhone code - NL neill - 17 freq nile - 14 freq kneel - 15 freq newly - 27 freq nil - 7 freq nalll - 1 freq nail - 46 freq niall - 5 freq nial - 4 freq nell - 13 freq knoll - 2 freq nellie - 42 freq nelly - 8 freq niel - 1 freq nool - 1 freq nael - 2 freq newlee - 1 freq neil - 87 freq knell - 5 freq nilly - 1 freq neilly - 12 freq nila - 1 freq nol - 1 freq neal - 1 freq noel - 1 freq newlie - 1 freq nellie- - 1 freq €™nal - 1 freq €™neill - 1 freq nal - 1 freq nnywlo - 1 freq n'all - 2 freq nueuul - 1 freq nl - 6 freq wnl - 1 freq nle - 1 freq neale - 1 freq nll - 1 freq null - 2 freq |
WNL |
Time to execute Levenshtein function - 0.171516 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.419112 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.029349 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.036578 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.000873 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. |