| P08-1012 | in the training process . The | tic-tac-toe pruning | relies on IBM model 1 for scoring |
| W07-0403 | . The former is referred to as | tic-tac-toe pruning | because it uses both inside and |
| P08-1012 | and longer phrases . Both the | tic-tac-toe pruning | and the non-compositional constraint |
| P08-1012 | use the efficient bidirectional | tic-tac-toe pruning | to prune the bitext space within |
| W07-0403 | results are shown in Table 1 . | Tic-tac-toe pruning | is included for com - parison |
| P08-1012 | These values were used to perform | tic-tac-toe pruning | with τb = 1 × 10 − |
| P08-1012 | 4.1 Fast Tic-tac-toe Pruning The | tic-tac-toe pruning | algorithm ( Zhang and Gildea |
| P05-1059 | LITG with the beam ratio for the | tic-tac-toe pruning | as 10 − 5 and the number |
| P12-1018 | Klein and Manning , 2003 ) , and | tic-tac-toe pruning | for wordbased ITGs ( Zhang and |
| P05-1059 | . To verify the safety of the | tic-tac-toe pruning | technique , we applied it to |
| P12-1018 | with the n3 amortized time of the | tic-tac-toe pruning | 3Applying beam-search before |
| P08-1012 | cells satisfying both 4.1 Fast | Tic-tac-toe Pruning | The tic-tac-toe pruning algorithm |
| P06-2122 | over bitext cells . Itis called | tic-tac-toe pruning | since it involves an estimate |
