Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wnl (0) - 1 freq wenl (1) - 1 freq wl (1) - 6 freq wxl (1) - 2 freq wn (1) - 7 freq mnl (1) - 1 freq wal (1) - 24 freq wul (1) - 318 freq whl (1) - 1 freq wil (1) - 13 freq wll (1) - 1 freq nl (1) - 6 freq snl (1) - 2 freq zn (2) - 1 freq wael (2) - 9 freq wm- (2) - 1 freq rel (2) - 1 freq dal (2) - 2 freq gul (2) - 4 freq gl (2) - 2 freq wetl (2) - 1 freq wq (2) - 2 freq tql (2) - 1 freq mn (2) - 8 freq twel (2) - 1 freq |
wnl (0) - 1 freq wenl (1) - 1 freq wll (2) - 1 freq whl (2) - 1 freq nl (2) - 6 freq snl (2) - 2 freq wul (2) - 318 freq wil (2) - 13 freq wal (2) - 24 freq wl (2) - 6 freq wxl (2) - 2 freq wn (2) - 7 freq mnl (2) - 1 freq wona (3) - 1 freq owl (3) - 61 freq weyl (3) - 1 freq wend (3) - 1 freq waul (3) - 1 freq wing (3) - 38 freq lanl (3) - 1 freq nil (3) - 7 freq owns (3) - 13 freq awn (3) - 118 freq own (3) - 168 freq want (3) - 1648 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.199554 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.333711 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.027215 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.036747 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.000857 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. |