Paper: An Efficient Generation Algorithm For Lexicalist MT

ACL ID P95-1035
Title An Efficient Generation Algorithm For Lexicalist MT
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1995
Authors

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