English
资源说明：This chapter is roughly divided into two sections: Hidden Markov Models followed
by Maximum Entropy Markov Models. Our discussion of the Hidden Markov
Model extends what we said about HMM part-of-speech tagging. We begin in the next
section by introducing the Markov Chain, then give a detailed overview of HMMs and
the forward and Viterbi algorithms with more formalization, and finally introduce the
important EM algorithm for unsupervised (or semi-supervised) learning of a Hidden
Markov model.
本源码包内暂不包含可直接显示的源代码文件，请下载源码包。
