首页> 外文会议>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)。在两个Oracle在英语到日语和日语中的英文翻译中的实验中,我们就是理论上可以优于默认失真限制的基线系统,分别为约2.5和5个BLEU点,7和10个肋条点,当使用学习的预审模型和使用失真限制来预定源句子时,还报告了学习预审模型的尝试和其结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号