An efficient generation algorithm for lexicalist MT

  • Authors:
  • Victor Poznański;John L. Beaven;Pete Whitelock

  • Affiliations:
  • SHARP Laboratories of Europe Ltd., Oxford, United Kingdom;SHARP Laboratories of Europe Ltd., Oxford, United Kingdom;SHARP Laboratories of Europe Ltd., Oxford, United Kingdom

  • Venue:
  • ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.