The features can be easily obtained by modifying the TAT extraction algorithm described in ( Liu et al. , 2006 ) .
treetostring alignment template for statistical machine translation
Yang Liu Qun Liu Shouxun Lin
Note that for lexicalized tree , features do not include the information of sub-trees since there is no nonterminals . The features can be easily obtained by modifying the TAT extraction algorithm described in ( Liu et al. , 2006 ) . When a TAT is extracted from a word-aligned , source-parsed parallel sentence , we just record the contextual features and the features of the sub-trees .
The features can be easily obtained by modifying the TAT extraction algorithm described in ( @@CITATION ) .