tech,8-10-J05-1003,ak | significant efficiency gains for the new <term> | algorithm | </term> over the obvious implementation of | #8260 Experiments show significant efficiency gains for the newalgorithm over the obvious implementation of the boosting approach. | |
tech,8-12-J05-1003,ak | experiments in this article are on <term> | natural language parsing ( NLP ) | </term> , the approach should be applicable | #8309 Although the experiments in this article are onnatural language parsing ( NLP ), the approach should be applicable to many other NLP problems which are naturally framed as ranking tasks, for example, speech recognition, machine translation, or natural language generation. | |
tech,9-9-J05-1003,ak | a new <term> algorithm </term> for the <term> | boosting approach | </term> which takes advantage of the <term> | #8235 The article also introduces a new algorithm for theboosting approach which takes advantage of the sparsity of the feature space in the parsing data. |