Our compression-based method achieves higher yield than off-the-shelf relation extractors.
because all sentences in a mention set include (t 1 ) and (t 2 ), it is always possible to generate a very large candidate set by simply extracting all spans between (t 1 ) and (t 2 ) from the mention set, regardless if such relation statements are coherent.