Numerous previous pseudodisambiguation evaluations only include arguments that occur between 30 and 3000 times ( Erk , 2007 ; Keller and Lapata , 2003 ; Rooth et al. , 1999 ) .
inducing a semantically annotated lexicon via embased clustering
Mats Rooth Stefan Riezler Detlef Prescher Glenn Carroll Franz Beil
We set the MI-threshold , T , to be 0 , and the negative-to-positive ratio , K , to be 2 . Numerous previous pseudodisambiguation evaluations only include arguments that occur between 30 and 3000 times ( Erk , 2007 ; Keller and Lapata , 2003 ; Rooth et al. , 1999 ) . Presumably the lower bound is to help ensure the negative argument is unobserved because it is unsuitable , not because of data sparseness .
Numerous previous pseudodisambiguation evaluations only include arguments that occur between 30 and 3000 times ( Erk , 2007 ; Keller and Lapata , 2003 ; @@CITATION ) .