An Efficient Generation Algorithm for Lexicalist MT

Simple item page
dc.creatorPoznanski, Victor
dc.creatorBeaven, John L.
dc.creatorWhitelock, Pete
dc.date1995-04-28
dc.date1995-05-01
dc.date.accessioned2026-07-07T08:58:40Z
dc.date.available2026-07-07T08:58:40Z
dc.descriptionThe 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.
dc.descriptionTo appear in Proceedings of ACL-95
dc.identifierhttps://arxiv.org/abs/cmp-lg/9504027
dc.identifierhttp://arxiv.org/abs/cmp-lg/9504027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/147416
dc.subjectComputation and Language
dc.titleAn Efficient Generation Algorithm for Lexicalist MT
dc.typetext

Files

Collections

arXiv