3 ms·
Hmm. A Markov chain where you actually do some kind of search? You build up a chain then backtrack and retry as necessary until you get something meeting the re
by TazeTSchnitzel 8y ago
Hmm. A Markov chain where you actually do some kind of search? You build up a chain then backtrack and retry as necessary until you get something meeting the requirements.
- sova 8y agoSounds like getting some sort of context free grammar out of it. There is a LR grammar algorithm that is very fast, you could use a Markov chain to generate and then a CFG to verify
- reificator 8y agoOr a CFG to generate at a high level and a Markov chain to fill in the details
- sova 8y agoExcellent idea. Then it would actually read like language! But uh, how to choose sentence length and which grammars you want?
- kastnerkyle 8y agoSee [0] for a method combining branch and prune with Markovian probabilities. I did a hacky version of my interpretation of this work at [1]. [0] https://link.springer.com/article/10.1007/s10601-010-9101-4 https://link.springer.com/article/10.1007/s10601-010-9101-4 [1] https://github.com/kastnerkyle/pachet_experiments https://github.com/kastnerkyle/pachet_experiments