An Efficient Generation Algorithm for Lexicalist MT

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/147416

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9504027
 http://arxiv.org/abs/cmp-lg/9504027

Collections

arXiv