To build the above s2t system , we first use the parse tree , which is generated by parsing the English side of the bilingual data with the Berkeley parser ( Petrov et al. , 2006 ) .
learning accurate compact and interpretable tree annotation
Slav Petrov Leon Barrett Romain Thibaux Dan Klein
We then obtain the composed rules by composing two or three adjacent minimal rules . To build the above s2t system , we first use the parse tree , which is generated by parsing the English side of the bilingual data with the Berkeley parser ( Petrov et al. , 2006 ) . Then , we binarize the English parse trees using the head binarization approach ( Wang et al. , 2007 ) and use the resulting binary parse trees to build another s2t system .
To build the above s2t system , we first use the parse tree , which is generated by parsing the English side of the bilingual data with the Berkeley parser ( @@CITATION ) .