Sometimes, we need to obtain parse probabilities in cases where we don't already have a probabilistic parser. We solve this problem through a series of expectation and maximization steps by beginning with a parser with equal rule probabilities to incrementally improve our estimates, then parsing the sentence, computing a probability for each parse, and using these probabilities to weight the counts, re-estimate the rule probabilities, and so on, until we come up with a final probability.