Machine Learning, Markov Chains, Statistics, NLP, Fun.
has five words We will first choose k: the quantity of words our chain will consider before sampling/ predicting the next one. For this example, let’s use k=1. Now, how many distinct sequences of 1 word does our sentence have? It has 5, one for each word. If it had duplicate words, they wouldn’t