An Efficient Generation Algorithm for Lexicalist MT
arXiv:cmp-lg/9504027
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.
To appear in Proceedings of ACL-95