Probability Transition Matrix

Question

I am working on Markov chains, and I would like to know about effective algorithms for constructing probability transition matrices (of order n), given the text file as input.

I do not follow one algorithm, but I would like to create a list of such algorithms. Documents on such algorithms are also more than welcome, as are any terminology tips, etc. Please note that this question has strong similarities with n-gram identification algorithms.

Any help would be greatly appreciated.

Answer 1

There seem to be two possible questions, you should clarify which one:

• " " "n", , ? , .

• " " - , .

" " , , "", , , . , 1- , n x n-, , : http://en.wikipedia.org/wiki/Viterbi_algorithm

Answer 2

, , , , crm114 Discriminator. -, , ( , , ), , . crm114 SPAM, , .