A reasonable inference in this case is that the 'workers' are LOCATED at the  Relation Instance Shortest Path in Undirected Dependency Graph In Figure 2 we show three more examples of the LOCATED (AT) relationship as dependency paths created from one or two predicate-argument structures.
the SVM algorithm will induce lower weights for features occurring in longer paths, resulting in a linear separator that works irrespective of the size of the dependency paths.