| D10-1043 | forest-based tree sequence to tree | sequence translation | . <title> Discriminative Instance |
| D10-1043 | algorithm to extract tree-to-tree | sequence translation | rules from word aligned bilingual |
| J04-2003 | the probability model for tag | sequence translations | . The word forms in C1 need not |
| D10-1043 | into forest-based tree to tree | sequence translation | . Experimental results on the |
| P08-1064 | from the two parse trees . A tree | sequence translation | rule r is a pair of aligned tree |
| J04-2003 | sets Tf and Te . Using the tag | sequence translation | probabilities p ( tf | te ) , |
| P11-1105 | baseline methods . <title> A Joint | Sequence Translation | Model with Integrated Reordering |
| P06-1091 | algorithm for a linearly-scored block | sequence translation | model . The key component is |
| J04-2003 | For the time being , these tag | sequence translation | probabilities associate readings |
| J04-2003 | basis of this alignment , the tag | sequence translation | probabilities which are needed |
| J04-2003 | language and to compute the tag | sequence translation | probabilities p ( tf | te ) as |
| P08-1064 | phrases translations . 3.2 Tree | Sequence Translation | Model Given the source and target |
| D10-1043 | our forest-based tree-to-tree | sequence translation | decoding algorithm to not only |
| W03-1002 | NP 's . Aligned English POS-tag | Sequence Translation | Probabilities ( conditioned on |
| P09-1103 | sequence pair . A non-contiguous tree | sequence translation | rule r R can be further defined |
| P06-1091 | this paper presents a novel block | sequence translation | approach to SMT that is similar |
| P08-1064 | , the tree I sequence-to-tree | sequence translation | model is formulated as : Pr ( |
