As a consequence, we note that the syntactic paths π are not tied to any consistency constraint other than each of the paths being a well-formed sequence of dependencies linking the predicate to the argument.
the optimal solution in this case does not guarantee that the set of paths from a predicate to all of its arguments satisfies tree constraints.