We observed that basing Q margin on the relation stage performs best, which is not surprising given that this stage makes the most mistakes, benefits the most from semantic information, and also has many features which are similar to features from previous stages.
we adapt the querying function described by (Roth and Small, 2008) for the relation classification stage and define our margin for the purposes of instance selection as whereẏ = argmax y ∈Y\y f y (x), the highest scoring class which is not the true label, and Y + = Y\no relation.