Uniform Random Initialization

We consider the search for a maximum likelihood assignment of hidden deriva- tions and grammar weights for a proba- bilistic context-free grammar, the problem approximately solved by “Viterbi train- ing.” …...