We automatically labeled all the prepositions in the flat annotations and classified them according to the criterion of whether a boundary was placed immediately before or after it, or on both sides or neither side.
we programmatically generate all possible trees for q, which is again dependent only on |q| and compute d 1 and d 2 between all pairs of trees, from which the expected distributions can be readily estimated.