<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><br class=""><div><blockquote type="cite" class=""><div class="">On 2019-11-07 (311), at 17:10:43, Jon Callas <<a href="mailto:jon@callas.org" class="">jon@callas.org</a>> wrote:</div><div class=""><div class=""><br class=""><blockquote type="cite" class="">On Nov 6, 2019, at 3:31 PM, <a href="mailto:jamesd@echeque.com" class="">jamesd@echeque.com</a> wrote:<br class=""><br class="">One obvious solution is to have the permitted word list, and have some algorithm that picks the nearest word in the word list, and then displays the autocorrected passphrase. (Which the user can retype if the "correction" picked the wrong word, as is notoriously apt to happen.)<br class=""></blockquote><br class="">Yeah, and to talk out of the other side of my mouth, you could always make them type it exactly. Certainly I'd code it up that way and then add in the error correction later.<br class=""><br class=""><blockquote type="cite" class="">Which requires a word list, which I don't have, and algorithm to pick the nearest word in that word list, which I don't have and do not particularly want to write.<br class=""></blockquote><br class="">Outsource that issue to someone else, then. There might be correction packages around or even OS functions you could use.<br class=""><br class=""><blockquote type="cite" class="">I would think that there should be a pile of open source word lists and a pile of such open source algorithms around somewhere, but I cannot immediately find them, and do not want to re-invent the wheel.<br class=""></blockquote><br class="">I found this:<br class=""><br class=""><a href="http://www.paulnoll.com/Books/Clear-English/3000-words-order.html" class="">http://www.paulnoll.com/Books/Clear-English/3000-words-order.html</a><br class=""><br class="">Three thousand most common English words, listed in order, from newspaper statistics. Take the first 2048 of them, and then poof, you have an eleven-bit-workfactor/word list right for the taking. Or use them all, and then you have 11.55 bits per word.<br class=""><br class=""><span class="Apple-tab-span" style="white-space:pre"> </span>Jon<br class=""></div></div></blockquote></div><br class=""><div class="">Or maybe just use Randall Munroe’s list of the first one thousand (1,000), as found in ( <a href="https://store.xkcd.com/pages/thing-explainer-book" class="">https://store.xkcd.com/pages/thing-explainer-book</a> ) ? :)</div><div class="">__outer</div><div class=""><br class=""></div><div class=""><br class=""></div></body></html>