首页> 外文会议>Pacific Asia Conference on Language, Information and Computation >HSSA Tree Structures for BTG-based Preordering in Machine Translation
【24h】

HSSA Tree Structures for BTG-based Preordering in Machine Translation

机译:用于机器翻译中基于BTG的预排序的HSSA树结构

获取原文

摘要

The Hierarchical Sub-Sentential Alignment (HSSA) method is a method to obtain aligned binary tree structures for two aligned sentences in translation correspondence. We propose to use the binary aligned tree structures delivered by this method as training data for preordering prior to machine translation. For that, we learn a Bracketing Transduction Grammar (BTG) from these binary aligned tree structures. In two oracle experiments in English to Japanese and Japanese to English translation, we show that it is theoretically possible to outperform a baseline system with a default distortion limit of 6, by about 2.5 and 5 BLEU points and, 7 and 10 RIBES points respectively, when preordering the source sentences using the learnt preordering model and using a distortion limit of 0. An attempt at learning a preordering model and its results are also reported.
机译:层次亚句对齐(HSSA)方法是一种为翻译对应关系中的两个对齐句子获取对齐二叉树结构的方法。我们建议使用此方法提供的二进制对齐树结构作为训练数据,以便在机器翻译之前进行预排序。为此,我们从这些二进制对齐的树形结构中学习了包围式转换语法(BTG)。在两次用英语到日语和日语到英语翻译的预言实验中,我们证明了在理论上有可能优于默认失真极限为6的基线系统,分别降低大约2.5和5个BLEU点以及7和10个RIBES点,当使用学习的预排序模型并使用0的失真极限对源句子进行预排序时。还报告了学习预排序模型及其结果的尝试。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号