2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/147416The 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-95Computation and Languagetext