Given a PPT τ , let A(τ ) be the set of all possible ASTs.
our goal is to find the AST which has the highest probability given the PPT: The conditional probability of an AST is defined as: P (α|τ ) is modeled as the product of the probabilities of the ranking of each preterminal, which is in turn expressed as the product of the probabilities of the pairwise ordering decisions.