-
Continuing from discussions on the Gen Text group over the past few months, I'm thinking that one way to approach readable text at novel length is to create a library of pretty generic generative gram…
-
Links to previous years:
* [2018](https://github.com/NaNoGenMo/2018/issues/2)
* [2017](https://github.com/NaNoGenMo/2017/issues/2)
* [2016](https://github.com/NaNoGenMo/2016/issues/5)
* [2015](htt…
-
IPython notebook: https://github.com/serin-delaunay/NaNoGenMo2016/blob/master/RunningOut.ipynb
Output (strict, 19589 words): https://raw.githubusercontent.com/serin-delaunay/NaNoGenMo2016/master/outp…
-
A Markov chain of order-3 based on the Oz novels written by L. Frank Baum (14 novels in total). The only unusual thing here is that I considered punctuation as "words" in addition to the end-of-parag…
-
I know NaNoGenMo from scouring Github for useful python code for a project I am (was?) working on. Given that there were some interesting contributions last year, such as [In-Dialogue](https://github.…
-
I got a copy of propp and a markov chain algorithm, let's do this
-
Anybody want to keep talking and coding at cross-purposes to see what germinates?
A group-blog or something to host conversations publically?
Or even another GitHub repo using the Issues like this. …
-
http://8.129.175.102/lfd2022fall-poster-session/18.html
-
This is an open issue where you can comment and add resources that might come in handy for NaNoGenMo.
There are already a ton of resources on the old resources threads for the [2013 edition](https://…
-
Some considerations:
__I'll be coding in Ruby JavaScript
__I'd like to try using the Goodreads API / Google Books API (or something similar) in some way
__Use text from Gutenberg or scrape from intern…