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, 1992) is NP-complete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more determinism.
Cite
CITATION STYLE
APA
Poznariski, V., Beaven, J. L., & Whitelock, P. (1995). An efficient generation algorithm for lexicalist mt. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1995-June, pp. 261–267). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981658.981693
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free