An Efficient Generation Algorithm for Lexicalist MT
cmp-lg
2008-02-03 v2 Computation and Language
Abstract
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.
Keywords
Cite
@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}
}
Comments
To appear in Proceedings of ACL-95