wrecking-yard / ex_txt_2_markov_chain

ExTxt2MarkovChain

Exercise in producing a Markov Chain out of text.

Notes

I noted some "toy" implementations which:

• start new process to keep the state.
• allow duplicate data.

My toy implementation is a quick stab at avoiding both.

Examples

$ cat test.txt
A Markov chain or Markov process is a stochastic model describing a sequence of possible events in
which the probability of each event depends only on the state attained in the previous event. Informally, this
may be thought of as, "What happens next depends only on the state of affairs now." A countably infinite
sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC).
$ iex

iex> ExTxt2MarkovChain.generate("test.txt")
%ExTxt2MarkovChain{
  map: %{
    {"time", "markov"} => {1, 0.5},
    {"moves", "state"} => {1, 1.0},
    {"the", "previous"} => {1, 0.2},
    {"chain", "dtmc"} => {1, 0.3333333333333333},
    {"state", "attained"} => {1, 0.3333333333333333},
    {"a", "stochastic"} => {1, 0.2},
    {"the", "chain"} => {1, 0.2},
    {"stochastic", "model"} => {1, 1.0},
    {"countably", "infinite"} => {1, 1.0},
    {"a", "sequence"} => {1, 0.2},
    {"on", "the"} => {2, 1.0},
...

Or

iex> ExTxt2MarkovChain.new()
...> |> ExTxt2MarkovChain.update({"run", "sleep"})
...> |> ExTxt2MarkovChain.update({"run", "eat"})
...> |> ExTxt2MarkovChain.update({"eat", "sleep"})
...> |> ExTxt2MarkovChain.update({"sit", "eat"})
...> |> ExTxt2MarkovChain.update({"sit", "run"})
...> |> ExTxt2MarkovChain.update({"sleep", "sit"})
...> |> ExTxt2MarkovChain.calculate_probability()
%ExTxt2MarkovChain{
  map: %{
    {"eat", "sleep"} => {1, 1.0},
    {"run", "eat"} => {1, 0.5},
    {"run", "sleep"} => {1, 0.5},
    {"sit", "eat"} => {1, 0.5},
    {"sit", "run"} => {1, 0.5},
    {"sleep", "sit"} => {1, 1.0}
  }
}