Computer Science – Computation and Language
Scientific paper
1995-08-12
Computer Science
Computation and Language
21 pages; tarred, compressed, uuencoded Latex. In `Proceedings of the Sixth International Conference on Theoretical and Method
Scientific paper
The paper presents a prototype lexicalist Machine Translation system (based on the so-called `Shake-and-Bake' approach of Whitelock (1992) consisting of an analysis component, a dynamic bilingual lexicon, and a generation component, and shows how it is applied to a range of MT problems. Multi-Lexeme translations are handled through bi-lexical rules which map bilingual lexical signs into new bilingual lexical signs. It is argued that much translation can be handled by equating translationally equivalent lists of lexical signs, either directly in the bilingual lexicon, or by deriving them through bi-lexical rules. Lexical semantic information organized as Qualia structures (Pustejovsky 1991) is used as a mechanism for restricting the domain of the rules.
No associations
LandOfFree
Bi-Lexical Rules for Multi-Lexeme Translation in 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 Bi-Lexical Rules for Multi-Lexeme Translation in Lexicalist MT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bi-Lexical Rules for Multi-Lexeme Translation in Lexicalist MT will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-544856