Paper: Every sensible extended top-down tree transducer is a multi bottom-up tree transducer

ACL ID N12-1027
Title Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
Venue Annual Conference of the North American Chapter of the Association for Computational Linguistics
Session Main Conference
Year 2012
Authors

A tree transformation is sensible if the size of each output tree is uniformly bounded by a linear function in the size of the correspond- ing input tree. Every sensible tree transfor- mation computed by an arbitrary weighted ex- tended top-down tree transducer can also be computed by a weighted multi bottom-up tree transducer. This further motivates weighted multi bottom-up tree transducers as suitable translation models for syntax-based machine translation.