Mosleh Hmoud Al-Adhaileh

Also published as: Mosleh H. Al-Adhaileh


2002

pdf bib
A Synchronization Structure of SSTC and Its Applications in Machine Translation
Mosleh H. Al-Adhaileh | Enya Kong Tang | Zaharin Yusoff
COLING-02: Machine Translation in Asia

2001

pdf bib
Converting a bilingual dictionary into a bilingual knowledge bank based on the synchronous SSTC
Enya Kong Tang | Mosleh H. Al-Adhaileh
Proceedings of Machine Translation Summit VIII

In this paper, we would like to present an approach to construct a huge Bilingual Knowledge Bank (BKB) from an English Malay bilingual dictionary based on the idea of synchronous Structured String-Tree Correspondence (SSTC). The SSTC is a general structure that can associate an arbitrary tree structure to string in a language as desired by the annotator to be the interpretation structure of the string, and more importantly is the facility to specify the correspondence between the string and the associated tree which can be non-projective. With this structure, we are able to match linguistic units at different inter levels of the structure (i.e. define the correspondence between substrings in the sentence, nodes in the tree, subtrees in the tree and sub-correspondences in the SSTC). This flexibility makes synchronous SSTC very well suited for the construction of a Bilingual Knowledge Bank we need for the English-Malay MT application.

1999

pdf bib
Example-based machine translation based on the synchronous SSTC annotation schema
Mosleh H. Al-Adhaileh | Tang Enya Kong
Proceedings of Machine Translation Summit VII

In this paper, we describe an Example-Based Machine Translation (EBMT) system for English-Malay translation. Our approach is an example-based 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.

1998

pdf bib
A Flexible Example-Based Parser Based on the SSTC
Mosleh Hmoud Al-Adhaileh | Enya Kong Tang
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 1

pdf bib
A Flexible Example-Based Parser Based on the SSTC
Mosleh Hmoud Al-Adhaileh | Enya Kong Tang
COLING 1998 Volume 1: The 17th International Conference on Computational Linguistics