These passwords are, in theory, pronouncable. The algorithm is a
fairly typical character based Markov chain generator. It is seeded
from the same dictionary used in the word pairs generator.
There is one slight twist I made on a standard Markov chain
generator. Normally, if the source text does not include a certain
pattern, then that pattern will have zero probability in the Markov
table and thus will never occur in the output. In my system, all
possibilities have a base probability. This means the passwords may
contain any sequence of characters. This is good, as far as passwords
go, but it also means they might not be particularly pronounceable.
The reason for this modification is that it simplifies the JavaScript
necessary to walk through the Markov chain.
This generator was inspiried by http://www.multicians.org/thvv/gpw.html.