| W06-1627 | dynamic programming . We did our | ITG decoding | experiments on the LDC 2002 MT |
| W06-1627 | n is reduced from 5 to 4 . For | ITG decoding | , we can apply a similar factorization |
| W05-1507 | decoding is a form of parsing . 2.1 | ITG Decoding | Wu ( 1996 ) presented a polynomial-time |
| W06-1627 | , we reduced the complexity of | ITG decoding | using bigram language model from |
| W05-1507 | , we reduced the complexity of | ITG decoding | using bigram language model from |
| W06-1627 | 2005 ) . 4 A * Decoding The of | ITG decoding | algorithm of Wu ( 1996 ) can |
| W05-1507 | produce hooks that are suitable for | ITG decoding | . 4 Hook Trick for ITG Decoding |
| W06-1627 | O ( n6 ) . If we visualize an | ITG decoding | constituent Y extending from |
| W05-1507 | ITG decoding . 4 Hook Trick for | ITG Decoding | We start from the bigram case |
| W05-1507 | have reduced the complexity of | ITG decoding | using bigrams from O ( n7 ) to |
