There may be cases where e 1 and e 2 belong to predicate-argument structures that have no argument in common.
because the dependency graph is always connected, we are guaranteed to find a shortest path between the two entities.