Since our baseline system has approximately 80% accuracy at this stage, it is reasonable to assume that at least one of the argument mentions is correctly disambiguated.
we prune the search space by making only two queries for each mention pair (m i , m j ): q 0 = (t * i , m j ) and q 1 = (m i , t * j ) where t * i , t * j are the strings representing the top titles chosen by the current model for mentions m i , m j re-spectively.