D11-1109 also propose an effective POS tag pruning method which can greatly improve the
D10-1030 pruning stage , the heuristic pruning method in ( Xue , 2008 ) is employed
D12-1089 3.1 Absolute pruning Absolute pruning methods rely only on the statistics of
D12-1089 is superior to existing ad hoc pruning methods . 1 Introduction Over the last
A88-1020 nodes that were rejected by the pruning method . The second list includes most
D12-1089 section , we will review existing pruning methods based on simple phrase table
D12-1089 table . As opposed to relative pruning methods ( Section 3.2 ) , they may prune
D12-1089 description of existing phrase table pruning methods . 2 . a new , theoretically sound
D12-1089 experimental comparison of several pruning methods for several language pairs .
D11-1109 with this problem , we propose a pruning method that can effectively reduce the
D11-1044 Tromble et al. , 2008 ) . This pruning method computes the max - marginal for
D09-1147 computations , we use the cube pruning method of Huang and Chiang ( 2007 )
D12-1089 2 Related Work The most basic pruning methods rely on probability and count
D09-1037 parsing algorithm and the cube - pruning method of Chiang ( 2007 ) . Parse edges
D09-1139 In our experiments , we apply pruning methods as proposed by Gabrilovich and
A00-1028 order of grammar symbols . The pruning method we propose consists in eliminating
D09-1078 pruning . We compared several pruning methods on trigram models : count cutoffs
D08-1012 methods . Not only are posterior pruning methods simpler ( for example , there
D11-1078 from the domain of journalism . 5 Pruning Methods IC and DS a priori suffer different
D09-1078 orders . Finally , we tried various pruning methods to further reduce model size
hide detail