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