Only α 2 of the relation statements inD explicitly name both of the entities that participate in the relation.
minimizing L(D) requires f θ to do more than simply identifying named entities in r. We hypothesize that training onD will result in a f θ that encodes the semantic relation between the two possibly elided entity spans.