Collins & Duffy ( 2002 ) showed how the perceptron algorithm can be used to efficiently compute the best parse with DOP1 's subtrees , reporting a 5.1 % relative reduction in error rate over the model in Collins ( 1999 ) on the WSJ .
new ranking algorithms for parsing and tagging kernels over discrete structures and the voted perceptron
M Collins N Duffy
Although Bod 's method obtains very competitive results on the Wall Street Journal ( WSJ ) task , the parsing time was reported to be over 200 seconds per sentence ( Bod 2003 ) . Collins & Duffy ( 2002 ) showed how the perceptron algorithm can be used to efficiently compute the best parse with DOP1 's subtrees , reporting a 5.1 % relative reduction in error rate over the model in Collins ( 1999 ) on the WSJ . Goodman ( 2002 ) furthermore showed how Bonnema et al. 's ( 1999 ) and Bod 's ( 2001 ) estimators can be incorporated in his PCFGreduction , but did not report any experiments with these reductions .
@@CITATION showed how the perceptron algorithm can be used to efficiently compute the best parse with DOP1 's subtrees , reporting a 5.1 % relative reduction in error rate over the model in Collins ( 1999 ) on the WSJ .