We propose a procedure for measuring semantic relatedness of two words using an ontology, or semantic network dictionary. We discuss applications of this procedure in detail for lexical, syntactical, and coreference disambiguation in natural language processing as well as in machine translation. In addition, we use a simplified version of this procedure for automatic translation of the semantic...

In this paper we present a hybrid statistical machine translation (SMT)-example-based MT (EBMT) system that shows significant improvement over both SMT and EBMT baseline systems. First we present a runtime EBMT system using a subsentential translation memory (TM). The EBMT system is further combined with an SMT system for effective hybridization of the pair of systems. The hybrid system shows s...

To lay the foundations for a systematic procedure that could be applied to any scientific translation, this experiment evaluates the error variances attributable to various sources inherent in a design in which discrete, randomly ordered sentences from translations are rated for intelligibility and for fidelity to the original. The procedure is applied to three human and three mechanical transl...

Word alignment play an important role in the training of statistical machine translation systems. We present a technique to refine word alignments at phrase level after the collection of sentences from the Kazakh-English parallel corpora. The estimation technique extracts the phrase pairs from the word alignment and then incorporates them into the translation system for further steps. Although ...

THE OMISSION AND ITS AVATARS: TERMINOLOGICAL CHALLENGES ISSUES IN DESCRIPTIVE TRANSLATION STUDIESIn this study, Ph. Anckaert gives an overview of the terms proposed over last thirty years by French-speaking terminologists to designate various forms non-translation, which are either errors or procedures. It emerges that there is a high degree terminological uncertainty surrounding notion omissio...

We present a new procedure for the translation of propositional linear-time temporal logic (LTL) formulas to equivalent nondeterministic Büchi automata. Our procedure is based on simulation relations for alternating Büchi automata. Whereas most of the procedures that have been described in the past compute simulation relations in the last step of the translation (after a nondeterministic Büchi ...

Due to the syntactic differences between Arabic and English, translating compound-complex phrases is a difficult procedure that has presented significant difficulty for translators. This demands good understanding of syntax. Having firm syntax essential when complex statements. essay investigates how affects these two languages translate phrases. The goal this study discover evaluate elements i...