n}, where i is an index corresponding to a particular entity pair (e j , e k ), x i contains all of the sentences with mentions of this pair, and y i = relVector(e j , e k ).
given this form of supervision, we would like to find the setting for θ with the highest likelihood: this objective would be difficult to optimize exactly, and algorithms for doing so would be unlikely to scale to data sets of the size we consider.