An Efficient Generation Algorithm for Lexicalist MT

Victor Poznanski; John L. Beaven; Pete Whitelock

An Efficient Generation Algorithm for Lexicalist MT

cmp-lg 2008-02-03 v2 计算与语言

作者: Victor Poznanski , John L. Beaven , Pete Whitelock

摘要

The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions. However, the Shake-and-Bake generation algorithm of (Whitelock, COLING-92) is NP-complete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more determinism.

关键词

text generation

引用

@article{arxiv.cmp-lg/9504027,
  title  = {An Efficient Generation Algorithm for Lexicalist MT},
  author = {Victor Poznanski and John L. Beaven and Pete Whitelock},
  journal= {arXiv preprint arXiv:cmp-lg/9504027},
  year   = {2008}
}