To recover this recall, the strictness of this filter could be relaxed by further generalising dependency paths or using a different similarity metric to direct match of paths.
this is the upper bound for approaches which consider only exact dependency paths as a feature.