|0.1.4||Oct 21, 2022|
|0.1.3||Oct 21, 2022|
|0.1.2||Oct 21, 2022|
|0.1.1||Oct 21, 2022|
|0.1.0||Oct 21, 2022|
#448 in Text processing
22 downloads per month
:author: Gustavo Ramos Rehermann :toc: :numbered:
A Markov chain library which is tailored for sentences.
This library is a part of the Neurs Project.
Unlike a general-purpose Markov chain, a Markov chain in WordMarkov retains information about punctuation and whitespace.
The same two words can have multiple edges if there are instances where they are separated differently. For example, "high priest" and "high-priest" will both result in the tokens "high" and "priest" being linked, but there will be two links each representing a kind of separation.
There are two special tokens,
END, which also come into play.
The Markov chain can be walked both forwards and backwards. Whenever walking in
either direction, ideally, one of the special tokens will be reached under a
finite amount of time (words walked).
For licensing information, see the Neurs Project main repository.
- The Markov chain code.
- Primarily used by cnmc; can be reused by other projects.