Well-Formed Dependency to String translation with BTG Grammar | |
Li XQ(李小青); Wang Kun; Zhang Dakun; Hao Jie; Li, Xiaoqing | |
2015 | |
会议日期 | October 30 - November 1 |
会议地点 | Shanghai, China |
关键词 | Machine Translation Dependency Grammar |
英文摘要 |
This paper proposes a well-formed dependencyto string translation model with BTG grammar. By enabling the usage of wellformed sub-structures and allowing flexible reordering of them, our approach is effective to relieve the problems of parsing error and flatness in dependency structure. To utilize the well-formed dependency rules during decoding, we adapt the tree traversal decoding algorithm into a bottom-up CKY algorithm. And a lexicalized reordering model is used to encourage the proper combination of two neighbouring blocks. Experiment results demonstrate that our approach can effectively improve the performance by more than 2 BLEU score over the baseline. |
会议录 | Proceedings of 29th Pacific Asia Conference on Language, Information, and Computation
![]() |
内容类型 | 会议论文 |
源URL | [http://ir.ia.ac.cn/handle/173211/41163] ![]() |
专题 | 模式识别国家重点实验室_自然语言处理 |
通讯作者 | Li, Xiaoqing |
推荐引用方式 GB/T 7714 | Li XQ,Wang Kun,Zhang Dakun,et al. Well-Formed Dependency to String translation with BTG Grammar[C]. 见:. Shanghai, China. October 30 - November 1. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论