The structural rules will have uniform probability, and the lexical rules will have a portion of the probability mass relative to their cooccurrence in the training corpus.
we will initialize a stochastic bracketing FSTG such that: where c e/ f is the cooccurrence count for the biterminal e/ f ∈ To calculate the expectations for the expectation maximization, we will parse the training corpus with the grammar we have, using an adaptation of the parsing algorithm described in Saers et al.