Markov process is a stochastic model describing a sequence of possible events in...

alucab · 2024-03-01T09:11:02 1709284262

That's a markov chain of the 1st order.

This is higher order Markov chain

Robin_Message · 2024-03-01T15:41:07 1709307667

I think Markov chains have transition probabilities, which this model is lacking. But it's the same idea, just with uniform transition probabilitis.

dartos · 2024-03-01T17:31:27 1709314287

It seems like it has transition probabilities.

Depending on the type of the prior word, it randomly selects the next word from a list of compatible word types.

Am I misunderstanding?

Robin_Message · 2024-03-01T19:52:43 1709322763

It only has probability 0 or 1/n, where n is the number of compatible next words.

There are no numbers in https://github.com/adamjgrant/Tiny-Predictive-Text/blob/main...

A Markov chain could express probabilities like completing "the original" to -> "poster" (0.1), -> "McCoy" (0.2), -> "and best" (0.7) which I don't think this does. But I am tired and maybe also misunderstanding.

dartos · 2024-03-02T00:06:02 1709337962

Is a Markov chain where every state has an equal probability not a Markov chain?

Kind of splitting hairs here I guess, but I genuinely don’t know.