Computer Science – Computation and Language
Scientific paper
1995-04-28
Computer Science
Computation and Language
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.
Beaven John L.
Poznanski Victor
Whitelock Pete
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-340576