2252 search results - page 53 / 451 » Improving Random Forests |
COLING
2008
13 years 9 months ago
2008
In this paper, we describe a new reranking strategy named word lattice reranking, for the task of joint Chinese word segmentation and part-of-speech (POS) tagging. As a derivation...
ACL
2009
13 years 5 months ago
2009
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
ACL
2009
13 years 5 months ago
2009
Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsi...
ICANN
2011
Springer
12 years 11 months ago
2011
Springer
Attribute importance measures for supervised learning are important for improving both learning accuracy and interpretability. However, it is well-known there could be bias when th...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...