An Efficient Generation Algorithm for Lexicalist MT

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in Proceedings of ACL-95

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Efficient Generation Algorithm for Lexicalist MT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Efficient Generation Algorithm for Lexicalist MT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Generation Algorithm for Lexicalist MT will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-340576

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.