Syntax-Based Alignment Supervised or Unsupervised.pdf

Syntax-Based Alignment Supervised or Unsupervised.pdf

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Syntax-Based Alignment Supervised or Unsupervised

Syntax-Based Alignment: Supervised or Unsupervised? Hao Zhang and Daniel Gildea Computer Science Department University of Rochester Rochester, NY 14627 Abstract Tree-based approaches to alignment model translation as a sequence of probabilistic op- erations transforming the syntactic parse tree of a sentence in one language into that of the other. The trees may be learned directly from parallel corpora (Wu, 1997), or provided by a parser trained on hand-annotated treebanks (Ya- mada and Knight, 2001). In this paper, we compare these approaches on Chinese-English and French-English datasets, and find that au- tomatically derived trees result in better agree- ment with human-annotated word-level align- ments for unseen test data. 1 Introduction Statistical approaches to machine translation, pio- neered by Brown et al. (1990), estimate parame- ters for a probabilistic model of word-to-word cor- respondences and word re-orderings directly from large corpora of parallel bilingual text. In re- cent years, a number of syntactically motivated ap- proaches to statistical machine translation have been proposed. These approaches assign a parallel tree structure to the two sides of each sentence pair, and model the translation process with reordering oper- ations defined on the tree structure. The tree-based approach allows us to represent the fact that syn- tactic constituents tend to move as unit, as well as systematic differences in word order in the gram- mars of the two languages. Furthermore, the tree structure allows us to make probabilistic indepen- dence assumptions that result in polynomial time algorithms for estimating a translation model from parallel training data, and for finding the highest probability translation given a new sentence. Wu (1997) modeled the reordering process with binary branching trees, where each production could be either in the same or in reverse order going from source to target language. The trees of Wu’s Inversion Transduction Grammar wer

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档