Bi-Lexical Rules for Multi-Lexeme Translation in Lexicalist MT
| dc.creator | Trujillo, Arturo | |
| dc.date | 1995-08-12 | |
| dc.date.accessioned | 2026-07-07T09:09:58Z | |
| dc.date.available | 2026-07-07T09:09:58Z | |
| dc.description | 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. | |
| dc.description | 21 pages; tarred, compressed, uuencoded Latex. In `Proceedings of the Sixth International Conference on Theoretical and Methodological Issues in Machine Translation', Leuven, Belgium, July 1995, pp. 48--66 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9508006 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9508006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151227 | |
| dc.subject | Computation and Language | |
| dc.title | Bi-Lexical Rules for Multi-Lexeme Translation in Lexicalist MT | |
| dc.type | text |