Date of Original Version

9-2014

Type

Article

Journal Title

Prague Journal of Mathematical Linguistics

Volume

102

Issue

12

First Page

27

Last Page

36

Rights Management

© 2014 Austin Matthews et. al.. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License

Abstract or Description

We describe a collection of open source tools for learning tree-to-string and tree-to-tree transducers and the extensions to the cdec decoder that enable translation with these. Our modular, easy-to-extend tools extract rules from trees or forests aligned to strings and trees subject to different structural constraints. A fast, multithreaded implementation of the Cohn and Blunsom (2009) model for extracting compact tree-to-string rules is also included. The implementation of the tree composition algorithm used by cdec is described, and translation quality and decoding time results are presented. Our experimental results add to the body of evidence suggesting that tree transducers are a compelling option for translation, particularly when decoding speed and translation model size are important.

DOI

10.2478/pralin-2014-0011

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Share

COinS
 

Published In

Prague Journal of Mathematical Linguistics, 102, 12, 27-36.