In this paper, we describe an Example-Based Machine Translation (EBMT) system for EnglishMalay translation. Our approach is an examplebased approach which relies sorely on example translations kept in a Bilingual Knowledge Bank (BKB). In our approach, a flexible annotation schema called Structured String-Tree Correspondence (SSTC) is used to annotate both the source and target sentences of a translation pair. Each SSTC describes a sentence, a representation tree as well as the correspondences between substrings in the sentence and subtrees in the representation tree. With both the source and target SSTCs established, a translation example in the BKB can then be represented effectively in terms of a pair of synchronous SSTCs. In the process of translation, we first try to build the representation tree for the source sentence (English) based on the example-based parsing algorithm as presented in [1]. By referring to the resultant source parse tree, we then proceed to synthesis the target sentence (Malay) based on the target SSTCs as pointed to by the synchronous SSTCs which encode the relationship between source and target SSTCs.
[1]
Mosleh Hmoud Al-Adhaileh,et al.
A Flexible Example-Based Parser Based on the SSTC
,
1998,
COLING-ACL.
[2]
Yves Lepage,et al.
Saussurian analogy: a theoretical account and its application
,
1996,
COLING.
[3]
Victor Sadler,et al.
Pilot Implementation of a Bilingual Knowledge Bank
,
1990,
COLING.
[4]
Paul Bennett,et al.
Metataxis in practice: Dependency syntax for multilingual machine translation
,
1990
.
[5]
Makoto Nagao,et al.
A framework of a mechanical translation between Japanese and English by analogy principle
,
1984
.
[6]
佐藤 理史,et al.
Example-based translation of technical terms
,
1993
.
[7]
Cheng-Ming Guo.
Machine tractable dictionaries: design and construction
,
1996
.
[8]
Stuart M. Shieber,et al.
Synchronous Tree-Adjoining Grammars
,
1990,
COLING.
[9]
Christian Boitet,et al.
Representation trees and string-tree correspondences
,
1988,
COLING.