Note that in a dependency tree, a path between two arguments must pass through their common predicate.
(3) Estimating η using maximum likelihood over the development set, which results in η ∼ 0.1 (λ ∼ 2.3), corresponding to the edge density P(I uv = 1) ∼ 0.09.