The independence assumptions typifying S-CFGs are also valid for S-ITGs.
the probability of an S-ITG parse is calculated as the product of the probabilities of all the instances of rules in the parse tree.