If we assume all derivations licensed by our grammar are equally likely, and that lexical category assignments are conditionally independent given the sentence, we can compute the optimal parseŷ as: As discussed in Section 2.1, many derivations are possible given a sequence of lexical categories, some of which may be semantically distinct.
our model will assign all of these an equal score, as they use the same sequence of lexical categories.