| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| no-weill (0) - 3 freq no-he'll (2) - 1 freq no-weel (2) - 1 freq do-well (2) - 2 freq oneill (3) - 2 freq aweill (3) - 6 freq €œweill (3) - 35 freq roswell (3) - 1 freq weill (3) - 378 freq o'neill (3) - 5 freq neill (3) - 17 freq foswell (3) - 6 freq bowhill (3) - 5 freq nobill (3) - 1 freq orwell (3) - 4 freq atweill (3) - 27 freq 'weill (3) - 11 freq -well (3) - 2 freq €˜weill (3) - 1 freq asweill (3) - 2 freq newmill (3) - 1 freq sowell (3) - 1 freq rop-will (3) - 1 freq w-will (3) - 1 freq boswell (3) - 3 freq |
no-weill (0) - 3 freq no-weel (3) - 1 freq do-well (3) - 2 freq -well (4) - 2 freq w-will (4) - 1 freq no-he'll (4) - 1 freq sowell (5) - 1 freq newmill (5) - 1 freq €˜weill (5) - 1 freq rop-will (5) - 1 freq asweill (5) - 2 freq newall (5) - 1 freq inkwell (5) - 2 freq nae-weel (5) - 6 freq alsweill (5) - 1 freq boswell (5) - 3 freq indwell (5) - 1 freq roswell (5) - 1 freq aweill (5) - 6 freq €œweill (5) - 35 freq 'weill (5) - 11 freq neill (5) - 17 freq weill (5) - 378 freq foswell (5) - 6 freq atweill (5) - 27 freq |
SoundEx code - N400 neill - 17 freq nile - 14 freq newly - 27 freq nil - 7 freq nalll - 1 freq nail - 46 freq niall - 5 freq nial - 4 freq nell - 13 freq nae-weel - 6 freq nellie - 42 freq nelly - 8 freq newall - 1 freq niel - 1 freq nool - 1 freq nael - 2 freq newlee - 1 freq naywuly - 1 freq neil - 87 freq no-he'll - 1 freq nilly - 1 freq neilly - 12 freq nila - 1 freq nol - 1 freq nihil - 4 freq no-weill - 3 freq no-weel - 1 freq neal - 1 freq naeweel - 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 niyowal - 1 freq nle - 1 freq neale - 1 freq nll - 1 freq null - 2 freq |
MetaPhone code - NWL nae-weel - 6 freq newall - 1 freq naywuly - 1 freq no-weill - 3 freq no-weel - 1 freq naeweel - 1 freq |
NO-WEILL |
| Time to execute Levenshtein function - 0.189266 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.379215 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.030402 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.048665 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.001199 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. |