Abstract
Tree transducers are defined as relations between trees, but in syntax-based machine translation, we are ultimately concerned with the relations between the strings at the yields of the input and output trees. We examine the formal power of Multi Bottom-Up Tree Transducers from this point of view. © 2012 Association for Computational Linguistics.
Cite
CITATION STYLE
APA
Gildea, D. (2012). On the String Translations Produced by Multi Bottom-Up Tree Transducers. Computational Linguistics, 38(3), 673–693. https://doi.org/10.1162/COLI_a_00108
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free