Classification We represent each path p as a binary "bag of edges" φ, i.e.
the set of edge types that were applied in p. Given a term-pair (x, y) represented as a path-set paths(x, y), and a whitelist w, the model classifies (x, y) as positive if: : 1.