â¢ The transition probability a is 0.7 using the EM algorithm ( Rabiner , 1989 ) on the TREC4 ad-hoc query set .
a tutorial on hidden markov models and selected applications in speech recognitionquot
L Rabiner
where W 's are query words in Q. Miller et al. estimated probabilities as follows : â¢ The transition probability a is 0.7 using the EM algorithm ( Rabiner , 1989 ) on the TREC4 ad-hoc query set . P ( v IGx ) = number of occurrences of W in Cx â¢ length of Cx which is the general language probability for word Win language x. â¢ P ( v I D ) = number of occurrences of W in D length of D
â¢ The transition probability a is 0.7 using the EM algorithm ( @@CITATION ) on the TREC4 ad-hoc query set .