| tech,13-5-J05-1003,bq | reranking task </term> , based on the <term> | boosting approach | </term> to <term> ranking problems </term> described | #8772 We introduce a new method for the reranking task, based on the boosting approach to ranking problems described in Freund et al. (1998). |
| tech,3-6-J05-1003,bq | al. ( 1998 ) </term> . We apply the <term> | boosting method | </term> to <term> parsing </term> the <term> Wall | #8789 We apply the boosting method to parsing the Wall Street Journal treebank. |
| tech,9-9-J05-1003,bq | new <term> algorithm </term> for the <term> | boosting approach | </term> which takes advantage of the <term> | #8870 The article also introduces a new algorithm for the boosting approach which takes advantage of the sparsity of the feature space in the parsing data. |
| tech,15-10-J05-1003,bq | <term> implementation </term> of the <term> | boosting approach | </term> . We argue that the method is an | #8902 Experiments show significant efficiency gains for the new algorithm over the obvious implementation of the boosting approach . |
