Preparation for Daniel’s visit! Let’s go through those rules of probability once again, and have quick refresher on n-gram models. We should also try and look at dynamic programming algorithms for trying to find the most probable path through a sequence.