<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="155"/><title>Word Translation Based on Machine Learning Models Using Translation Memory and Corpora</title><author surname="Uchimoto" givenname="Kiyotaka"><org  name="Communications Research Laboratory" country="Japan" city="Kyoto"/></author><author surname="Sekine" givenname="Satoshi"><org  name="New York University" country="USA" city="New York"/></author><author surname="Murata" givenname="Masaki"><org  name="Communications Research Laboratory" country="Japan" city="Kyoto"/></author><author surname="Isahara" givenname="Hitoshi"><org  name="Communications Research Laboratory" country="Japan" city="Kyoto"/></author></firstpageheader><frontmatter><p>Word Translation Based on Machine Learning Models Using Translation Memory and Corpora</p><p><b>Kiyotaka Uchimotof, Satoshi SekineJ, Masaki Murataf, </b>and <b>Hitoshi Isaharaf</b></p><p>f Communications Research Laboratory JNew York University</p><p>2-2-2, Hikari-dai, Seika-cho, Soraku-gun, 715 Broadway, 7th floor</p><p>Kyoto, 619-0289 Japan New York, NY 10003, USA</p><p>{uchimoto, murata, isahara}@crl.go.jp sekine@cs.nyu.edu</p></frontmatter><abstract>Senseval-2 was held in Spring, 2001. It con­sisted of several tasks in various languages. In this paper, we describe our system used for one of these tasks: the Japanese translation task. With an accuracy of 63.4%, our system was the third best system in the contest among nine sys­tems developed by seven groups. </abstract></header><body><section number="1" title="Introduction"><p>In the Japanese translation task, the senses of a word were defined in terms of the word's trans­lations. Given an input sentence and a target word in the sentence, our system first estimates the similarity between the input sentence and parallel example sets called "Translation Mem­ory". It then selects an appropriate transla­tion of the target word by using the example set with the highest similarity. The similarity is calculated using dynamic programming and a machine learning model, which assesses the similarity based on the similarity of a string, words to the left and to the right of the target word in the input sentence, content words in the input sentence and their translations, and cô-occurrence of content words in bilingual and monolingual corpora in English and Japanese.</p></section><section number="2" title="Japanese Translation Task"><p>In general, the definition of word senses depends on the goal of a task. The goal of the Japanese translation task is word selection in translation, where the target language is English. Therefore, word senses are defined as translations (trans­lated words/phrases).</p><p>Before the contest, a Japanese-English par­allel phrase/sentence set (Translation Memory, henceforth referred to as <i>TM) </i>was given to the participants as training data. In the TM, for each Japanese headword, there was a set of pairs of a Japanese expression including a headword and an English translation of the expression. We call these pairs <i>examples. </i>Some of the ex­amples are shown in Figure 1.</p><doubt alpha="65.5" length="29" tooSmall="False" monospace="0.0">&lt;entry id="l" headword^"ält"&gt;</doubt><doubt alpha="56.2" length="16" tooSmall="False" monospace="0.0">&lt;sense id="l-l"&gt;</doubt><p>&lt;jexpression&gt; <b><i>MteiSiJM^ Z&gt; </i></b>&lt;/jexpression&gt; &lt;eexpression&gt;to feel constrained for one's mother &lt; / eexpression&gt; &lt;jexpression&gt; ft^^SÄ &lt;/jexpression&gt; &lt;eexpression&gt;constraint toward one's mother &lt; / eexpression &gt; &lt; tr ansmemo &gt; UC &lt; /1 r ansmemo &gt; &lt;eexpression&gt;to request to refrain from donation&lt; / eexpression&gt; &lt;/sense&gt;</p><doubt alpha="62.5" length="8" tooSmall="False" monospace="0.0">&lt;/sense&gt;</doubt><doubt alpha="50.0" length="16" tooSmall="False" monospace="0.0">&lt;sense id="l-2"&gt;</doubt><doubt alpha="50.0" length="16" tooSmall="False" monospace="0.0">&lt;sense id="l-3"&gt;</doubt><doubt alpha="60.9" length="46" tooSmall="False" monospace="0.0">&lt;jexpression&gt;       £ifÄLX% h7&lt;/j expression &gt;</doubt><doubt alpha="55.6" length="9" tooSmall="False" monospace="0.0">&lt;/entry &gt;</doubt><figure caption="Figure 1: Examples in TM."></figure><p>In the formal test (contest), the participants were given a set of texts each of which was marked by a target word. For each target word, the participants were required to submit either a sense id of the example (the number assigned to each example in the TM), which can be used to translate the target word, or a translation of the target word. In the latter case, a translation of the word itself, a translation of a sequence of words including the target word, or a transla­tion of the whole sentence could be submitted.</p><p>Answers were prepared for each target word in the formal test. The answers could consist of one or more sense id's in the TM, or of pos­sible translations. The output of each system was evaluated in terms of accuracy, defined as a percentage of answers identified correctly by the system. An answer was judged to have been identified correctly when a sense id or a trans­lation selected by the system was found in the answer.</p><page local="2" global="156"/></section><section number="3" title="Word Translation Model"><p>Given an input sentence and a target word in the sentence, our model selects an appropriate translation of the target word or a sense id of examples appropriate for the translation of the target word by using examples with the high­est similarity, estimated between the examples and the input sentence. In this paper, we call this model a <i>word translation model </i>The source language is Japanese and the target language in translation is English. Henceforth we call a headword translation an <i>English headword.</i></p><p>The similarity between an input sentence and examples is calculated by the following two methods:</p><p>1. A method based on the similarity of a string of characters (Method 1) : The similarity is defined as the amount of agreement between an input sentence and a Japanese example, ex­pressed as a percentage.</p><p>2. A method based on machine learning models (Method 2) : The similarity is defined as the confidence or probability estimated by machine learning models. English headwords are used as classes (or categories) in machine learning mod­els. Since the TM has examples with the same English headword, the similarity estimated by a model is the similarity between the input sen­tence and a set of examples.</p><p>A model is prepared for each Japanese head­word. Given an input sentence, the similarity between the input sentence and each example is calculated by a model using Method 1. If the similarity is equal to or greater than a certain threshold, the model returns either the sense id of the example with the highest similarity or an English headword of the example. Otherwise, a model in Method 2 selects and returns an En­glish headword.</p><p>The following sections describe the two meth­ods in greater detail.</p><p>3.1   Method Based on the Similarity of <b>A </b>String <b>of </b>Characters (Method 1)</p><p>When an example with the highest similarity is found, it is given the highest priority, and either the sense id or the English headword of the example is selected as an output.</p><p>When calculating the agreement rate between an input sentence and an example, the right­most word of the Japanese example is stemmed. In other words, when the rightmost word is a function word or a auxiliary verb such as "SURU (do)", it is eliminated. When the right­most word is a predicate, its inflectional part is also eliminated. For example, the stemmed examples in Figure 1 are <b>"f&amp;i-ilJiP, </b><b>""fi^</b><b> </b><b><i>COm§:\ </i></b>and Htfc&amp;£iilt'\ respectively. The agreement rate is calculated as a percentage of characters in the Japanese example that cor­respond to those in the input sentence. The correspondence is evaluated by comparing the Japanese example and the input sentence char­acter by character. This can be done by using the UNIX command "diff" in a dynamic pro­gramming method. <footnote anchor="1"/> The similarity is calcu­lated by using the following equation.</p><p>(
the  number  of characters \ corresponding to characters in input sentence /</p><doubt alpha="48.0" length="25" tooSmall="False" monospace="0.0">similarity   =   -y-r-(1)</doubt><p>/ the number of characters in \</p><p>I stemmed Japanese example <i>J</i></p><p>When several examples with the highest sim­ilarity are found, the one having the longest Japanese example is selected except when the length of corresponding part is shorter than that of the Japanese headword.</p><p>However, it is unrealistic to expect that an example that is almost the same as the input sentence can be found because it is difficult to install all possible examples into the TM. So, when there is no example whose similarity is equal to or greater than the threshold, the method described in the next section is used.</p><subsection number="3.2" title="Method Based on Machine"><p>Learning Models (Method 2) <footnote anchor="2"/></p><p>To select an appropriate example with the same usage as that of the input sentence, the sim­ilarity must be calculated by extracting the most important information from various con­flicting sources of information related to the in­put sentence and examples. Since we want to avoid making complicated rules, we use machine learning models to calculate the similarity. In­stead of all examples in the TM, English head­words are used as classes in machine learning models. Therefore, examples having the same English headword are put into the same class and are considered to have the same similarity.</p><p>*A description on how to use "diff" can be found in (Murata and Isahara, 2001).</p><footnote label="2">Work on using machine learning methods for the translation of tenses, aspects, and modalities can be found in (Murata et al., 2001a).</footnote><page local="3" global="157"/><p>Classes identified by machine learning mod­els are basically English headwords in TM, and they are detected manually. For example, En­glish headwords of the examples in Figure 1 are "feel constrained", "constraint", and "re­frain", respectively. When English headwords are verbs, they are represented by their basic forms. English words obtained when a Japanese headword is looked up in a Japanese-English dictionary are also used as classes.</p><p>For the training data, we use not only ex­amples in the TM but also other data col­lected from bilingual dictionaries or a par­allel corpus. The collected data consist of Japanese-English parallel phrases/sentences in­cluding both Japanese and English headwords, and they are used as complements of the train­ing data.</p><p>For the machine learning models, we use SVM (Support Vector Machine), ME (Maximum En­tropy), DL (Decision list), and SB (Simple Bayes). For each Japanese headword, the best model with the highest accuracy in 10-hold cross-validation on the training data is used for testing. The confidence of each class is esti­mated by probability distribution p(a, 6), where <i>b </i>is a context in a set of contexts, <i>B, </i>and a is a class in a set of classes, <i>A.</i><i> </i>SVM is a classifier, and in this model, the confidence of each class cannot be represented by a probability distribu­tion, but for the sake of convenience, we assign probability 1 to the most confident class esti­mated by SVM, and 0 to all other classes. The parameters in each model follow those used in (Murata et al., 2001b). Context <i>b </i>is represented by a set of features, that is, information deriv­able from the training data. The features used in our experiments were as follows:</p></subsection></section><section number="1." title="Morphological information"><p>The string, basic form, major and minor parts of speech, and inflection type on six mor­phemes, three morphemes to the left and three morphemes to the right of the target word in an input sentence.</p></section><section number="2." title="Character n-gram"><p>Character n-grams in an input sentence. Each n-gram must include the target word.</p></section><section number="3." title="Highest matching"><p>An English headword in the example that has the longest string matching that of the input sentence and its length are used as features.</p></section><section number="4." title="Frequency of a content word and its translation candidates"><p>We define a set of examples including the same English headword as an example set. For each English headword, we define the following six example sets:</p><p><b>Example set 1 </b>Japanese examples <b>Example set 2 </b>English examples</p><p><b>Example set </b>3 Sentences similar to examples in Example set 1. They are collected from a Japanese monolingual corpus.</p><p><b>Example set 4 </b>Sentences similar to examples in Example set 2. They are collected from an English monolingual corpus.</p><p><b>Example set </b>5 Union of Example sets 1 and 3 <b>Example set </b>6 Union of Example sets 2 and 4</p><p>For each example set, Japanese-English par­allel phrases/sentences including both Japanese and English headwords are collected from bilin­gual dictionaries or parallel corpora, and are added to the example set.</p><p>Sentences similar to a certain example are de­fined as sentences that include a substring of the example. The substring must include the headword of the example. In our model, we use sentences collected from a monolingual corpus because we want the model to reflect a real dis­tribution of words, both headwords and words to the left and right of the headwords.</p><p>As content words, we used nouns, verbs, ad­jectives, adverbs, and attributives, except head­words, in the input sentence. For each content word in an input sentence and its translation candidates, the frequencies in each example set were used as features. The translation candi­dates of a content word were obtained when the content word was looked up in a Japanese-English dictionary. Each feature is represented by a combination of an example set, a head­word, and the frequency of content words in the example set. When we find that the total fre­quency of content words in an example set is n, we assume that every feature whose frequency is between 1 and n is observed. For example, when the content word found in the given sen­tence is "mother", and it is found three times in the example set 1 for the headword "buy", the features "Example set 1 : buy : 1," "Example set 1 : buy : 2," and "Example set 1 : buy : 3" are assumed to be observed. By using these features, our model handles information about co-occurrence words of a headword in each cor­pus as a clue to translating the headword.</p><page local="4" global="158"/></section><section number="4" title="Experiment"><subsection number="4.1" title="Experimental conditions"><p>The input and evaluation of the systems fol­lowed those of the Japanese translation task in Senseval-2. A TM for 320 headwords was given to each participant in the middle of March, 2001. The average number of exam­ples prepared for each headword was approxi­mately 20. For the formal test, 40 target words (20 nouns and 20 verbs) were selected from the headwords. For each target word, 30 texts in­cluding the target words were prepared. The total number of the target words was 1,200.</p><p>As a bilingual dictionary, we used "EI-JIRO" available at the web site of NIFTY, a network provider. As monolingual corpora, we used MAINICHI newspapers from 1991 to 2000, NIKKEI newspapers from 1995 to 1999, SANKEI newspapers from 1994 to 1999, and LDC data collected in 1994 and 1995, which include English newspaper articles for several years published by the Wall Street Journal, the Associated Press Writer, and the New York Times.</p><p>In the formal test, the threshold of similarity used in Method 1 was 1. JUMAN (Kurohashi and Nagao, 1999), a Japanese morphological an­alyzer, was used for morphological analysis in Method 2. As sentences similar to a certain example in Method 2, sentences that included a string obtained by stemming Japanese exam­ples were extracted for Japanese examples, and sentences that included English headwords were extracted for English examples. As for the ma­chine learning models, we could not select the most appropriate set of models by cross vali­dation because not all learning processes could be finished by the deadline for submission. The models finally selected for the formal test were as follows:</p><doubt alpha="61.8" length="34" tooSmall="False" monospace="0.0">• SVM :23words(12nouns and11verbs)</doubt><doubt alpha="64.5" length="31" tooSmall="False" monospace="0.0">• DL :12words(8nouns and4verbs)</doubt><doubt alpha="60.0" length="20" tooSmall="False" monospace="0.0">• SB :5words(5verbs)</doubt></subsection><subsection number="4.2" title="Experimental Results and Discussion"><doubt alpha="64.6" length="226" tooSmall="False" monospace="0.0">The accuracy obtained by our system in the formal test was63.4% (761/1,200).The accu­racy obtained by Method1and2were91.0% (91/100)and60.9% (670/1,100),respectively. Based on our results, we can draw the following conclusions:</doubt><p>• The system performance was related to the amount of training data per class in Method 2.</p><p>• The accuracy obtained for words whose En­glish headwords were general words was not high even though there were more training data for these words than for other headwords for which the accuracy was high. We believe that this is due to the quality of automatically col­lected training data because general words ap­pear in corpora quite frequently, and sometimes parallel sentences where Japanese and English headwords are not related to each other are collected. Therefore, we need to select auto­matically collected parallel sentences by align­ing Japanese and English headwords.</p><p>• Method 1 improved the accuracy, especially for idiomatic expressions that rarely appeared in the training data. We applied Method 2 to the target words to which Method 1 was applied in the formal test, and achieved an even lower accuracy of 34.0%(34/100).</p><p>• The accuracy obtained by the SB model was low. We speculate that the SB model is not suitable for the feature sets used in the test.</p></subsection></section><section number="5" title="Conclusion"><p>This paper described our system used in senseval-2. Our model for word translation has the following characteristics: (1) It puts to­gether examples having the same English head­word into a set of examples, and selects a set of examples most similar to the input sentence by using machine learning models. (2) If an exam­ple that is almost the same as the input sentence is found, our model gives it the highest priority. (3) It automatically collects training data and information used for training from other lan­guage resources that are not only a bilingual corpus but also monolingual corpora of English and Japanese. We do not have to supervise any­thing except the detection of headword pairs in the examples.</p></section><references><p>Sadao Kurohashi and Makoto Nagao, 1999. <i>Japanese Mor­phological Analysis System JUMAN Version 3.6 L </i>De­partment of Informatics, Kyoto University.</p><p>Masaki Murata and Hitoshi Isahara. 2001. NLP using DIFF. In <i>IPSJ-WGNL </i><i>NL144</i><i>-18, </i>pages 127-134. (in Japanese).</p><p>Masaki Murata, Kiyotaka Uchimoto, Qing Ma, and Hi­toshi Isahara. 2001a. Using a Support-Vector Machine for Japanese-to-English Translation of Tense, Aspect, and Modality. In <i>ACL Workshop on the Data-Driven Machine Translation.</i></p><p>Masaki Murata, Masao Utiyama, Kiyotaka Uchimoto, Qing Ma, and Hitoshi Isahara. 2001b. Experiments on Word Sense Disambiguation Using Several Machine-leaning Methods. In <i>IEICE-WGNLC2001-2. </i>(in Japanese).</p></references></body></article>