<?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="129"/><title>COLEPL and COLSLM: An Unsupervised WSD Approach to Multilingual Lexical Substitution, Tasks 2 and 3 SemEval 2010</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 129-133, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Guo" givenname="Weiwei"><org  name="Columbia University" country="USA" city="New York"/></author><author surname="Diab" givenname="Mona"><org  name="Columbia University" country="USA" city="New York"/></author></firstpageheader><frontmatter><p><b>COLEUR and COLSLM: A WSD approach to Multilingual Lexical Substitution, Tasks 2 and 3 SemEval 2010</b></p><p><b>Weiwei Guo and Mona Diab</b></p><p>Center for Computational Learning Systems Columbia University</p><p>{weiwei,mdiab}@ccls.Columbia.edu</p></frontmatter><abstract>In this paper, we present a word sense disambiguation (WSD) based system for multilingual lexical substitution. Our method depends on having a WSD system for English and an automatic word align­ment method. Crucially the approach re­lies on having parallel corpora. For Task 2 (Sinha <i>et</i><i> al, </i>2009) we apply a super­vised WSD system to derive the English word senses. For Task 3 (Lefever &amp; Hoste, 2009), we apply an unsupervised approach to the training and test data. Both of our systems that participated in Task 2 achieve a decent ranking among the participating systems. For Task 3 we achieve the highest ranking on several of the language pairs: French, German and Italian. </abstract></header><body><section number="1" title="Introduction"><p>In this paper, we present our system that was ap­plied to the cross lingual substitution for two tasks in SEMEVAL 2010, Tasks 2 and 3. We adopt the same approach for both tasks with some dif­ferences in the basic set-up. Our basic approach relies on applying a word sense disambiguation (WSD) system to the English data that comes from a parallel corpus for English and a language of relevance to the task, language 2 (12). Then we automatically induce the English word sense cor­respondences to 12. Accordingly, for a given test target word, we return its equivalent 12 words as­suming that we are able to disambiguate the target word in context.</p></section><section number="2" title="Our Detailed Approach"><p>We approach the problem of multilingual lexical substitution from a WSD perspective. We adopt the hypothesis that the different word senses of ambiguous words in one language probably trans­late to different lexical items in another language. Hence, our approach relies on two crucial compo­nents: a WSD module for the source language (our target test words, in our case these are the English target test words) and an automatic word align­ment module to discover the target word sense cor­respondences with the foreign words in a second language. Our approach to both tasks is unsuper­vised since we don't have real training data anno­tated with the target words and their corresponding translations into 12 at the onset of the problem.</p><p>Accordingly, at training time, we rely on auto­matically tagging large amounts of English data (target word instances) with their relevant senses and finding their 12 correspondences based on au­tomatically induced word alignments. Each of these English sense and 12 correspondence pairs has an associated translation probability value de­pending on frequency of co-occurrence. This in­formation is aggregated in a look-up table over the entire training set. An entry in the table would have a target word sense type paired with all the observed translation correspondences 12 word types. Each of the 12 word types has a probabil­ity of translation that is calculated as a normal­ized weighted average of all the instances of this 12 word type with the English sense aggregated across the whole parallel corpus. This process re­sults in an English word sense translation table (WSTT). The word senses are derived from Word-Net (Fellbaum, 1998). We expand the English word sense entry correspondences by adding the translations of the members of target word sense synonym set as listed in WordNet.</p><p>For alignment, we specifically use the GIZA++ software for inducing word alignments across the</p><doubt alpha="63.6" length="44" tooSmall="False" monospace="0.0">parallel corpora (Och &amp; Ney, 2003). We apply</doubt><p>GIZA++ to the parallel corpus in both directions</p><p>English to 12 and 12 to English then take only the</p><p>intersection of the two alignment sets, hence fo-129 cusing more on precision of alignment rather than recall.<page local="2" global="130"/></p><p>For each language in Task 3 and Task 2, we use TreeTagger<footnote anchor="1"/> to do the preprocessing for all languages. The preprocessing includes segmenta­tion, POS tagging and lemmatization. Since Tree-Tagger is independent of languages, our system does not rely on anything that is language spe­cific; our system can be easily applied to other languages. We run GIZA++ on the parallel cor­pus, and obtain the intersection of the alignments in both directions. Meanwhile, every time a target English word appears in a sentence, we apply our WSD system on it, using the sentence as context. From this information, we build a WSST from the English sense(s) to their corresponding foreign words. Moreover, we use WordNet as a means of augmenting the translation correspondences. We expand the word sense to its synset from WordNet adding the 12 words that corresponded to all the member senses in the synset yielding more trans­lation variability.</p><p>At test time, given a test data target word, we apply the same WSD system that is applied to the training corpus to create the WSTT Once the tar­get word instance is disambiguated in context, we look up the corresponding entry in the WSTT and return the ranked list of 12 correspondences. We present results for best and for oot which vary only in the cut off threshold. In the BEST condition we return the highest ranked candidate, in the oot con­dition we return the top 10 (where available).<footnote anchor="2"/></p><p>Given the above mentioned pipeline, Tasks 2 and 3 are very similar. Their main difference lies in the underlying WSD system applied.</p><doubt alpha="40.0" length="10" tooSmall="False" monospace="0.0">3   Task 2</doubt><subsection number="3.1" title="System Details"><p>We use a relatively simple monolingual supervised WSD system to create the sense tags on the En­glish data. We use the SemCor word sense anno­tated corpus. SemCor is a subset of the Brown Corpus. For each of our target English words found disambiguated in the SemCor corpus, we create a sense profile for each of its senses. A sense profile is a vector of all the content words that occur in the context of this sense in the Sem­Cor corpus. The dimensions of the vector are word</p><footnote label="1">http://www.ims.uni-stu  ttgart.de/projekte/corplex/TreeTagj  2 Some of the target word senses had less than 10 12 word correspondences.</footnote><p>Table 1 : Precision and Recall results per corpus on Task 2 test set types, as in a bag of words model, and the vec­tor entries are the co-occurrence frequency of the word sense and the word type. At test time, given a a target English word, we create a bag of word types contextual vector for each instance of the word using the surrounding context. We compare the created test vector to the SemCor vectors and choose the highest most similar sense and use that for sense disambiguation. In case of ties, we return more than one sense tag.</p><doubt alpha="50.0" length="8" tooSmall="False" monospace="0.0">3.2 Data</doubt><p>We use both naturally occurring parallel data and machine translation data. The data for our first Task 2 submission, T2-COLEUR, comprises nat­urally occurring parallel data, namely, the Span­ish English portion of the EuroParl data provided by Task 3 organizers. For the machine transla­tion data, we use translations of the source En­glish data pertaining to the following corpora: the Brown corpus, WSJ, SensEvall, SensEval2 datasets as translated by two machine translation systems: Global Link (GL), Systran (SYS) (Guo &amp; Diab, 2010). We refer to the translated corpus as the SALAAM corpus. The intuition for creating SALAAM (an artificial parallel corpus) is to create a balanced translation corpus that is less domain and genre skewed than the EuroParl data. This lat­ter corpus results in our 2nd system for this task T2-COLSLM.</p></subsection><subsection number="3.3" title="Results"><table caption="Table 1 presents our overall results as evaluated by the organizers."></table><p>It is clear that the T2-COLSLM outperforms T2-COLEUR.</p><doubt alpha="40.0" length="10" tooSmall="False" monospace="0.0">4   Task 3</doubt></subsection><subsection number="4.1" title="System Details"><p>Contrary to Task 2, we apply a context based un­supervised WSD module to the English side of the parallel data. Our unsupervised WSD method, as described in (Guo &amp; Diab, 2009), is a graph based unsupervised WSD method.<page local="3" global="131"/> Given a sequence of words <i>W = {wi</i><b><i>,W2</i></b><i>---wn}, </i>each word <b><i>Wi </i></b>with several senses <i>{sn</i><b><i>,Si2...Sim}. </i></b>A graph G = (V,E) is defined such that there exists a vertex <i>v </i>for each sense. Two senses of two different words may be connected by an edge e, depending on their dis­tance. That two senses are connected suggests they should have influence on each other, accord­ingly a maximum allowable distance is set. They explore 4 different graph based algorithms.We fo­cus on the In-Degree graph based algorithm. The In-Degree algorithm presents the problem as a weighted graph with senses as nodes and sim­ilarity between senses as weights on edges. The In-Degree of a vertex refers to the number of edges incident on that vertex. In the weighted graph, the In-Degree for each vertex is calcu­lated by summing the weights on the edges that are incident on it. After all the In-Degree values for each sense are computed, the sense with max­imum value is chosen as the final sense for that word. In our implementation of the In-Degree algorithm, we use the JCN similarity measure for both Noun-Noun and Verb-Verb similarity calcu­lation.</p><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Corpus</p></td><td class="cell"><p>best</p></td><td class="cell"><p>oot</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>T2-COLSLM T2-COLEUR</p></td><td class="cell"><p>27.59 19.47</p></td><td class="cell"><p>25.99 18.15</p></td><td class="cell"><p>46.61 44.77</p></td><td class="cell"><p>43.91 41.72</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><doubt alpha="50.0" length="8" tooSmall="False" monospace="0.0">4.2 Data</doubt><p>We use the training data from EuroParl provided by the task organizers for the 5 different language pairs. We participate in all the language competi­tions. We refer to our system as T3-COLEUR.</p></subsection><subsection number="4.3" title="Results"><table caption="Table 2 shows our system results on Task 3, spec­ified by languages."></table></subsection><subsection number="4.4" title="Error Analysis and Discussion"><p>As shown in Table 2, our system T3-COLEUR ranks the highest for the French, German and Ital­ian language tasks on both best and oot. However the overall F-measures are very low. Our system ranks last for Dutch among 3 systems and it is middle of the pack for the Spanish language task. In general we note that the results for oot are nat­urally higher than for BEST since by design it is a more relaxed measure.</p></subsection></section><section number="5" title="Related works"><p>Our work mainly investigates the influence of WSD on providing machine translation candi­dates. Carpuat &amp; Wu (2007) and Chan et al.(2007) show WSD improves MT. However, in (Carpuat &amp; Wu, 2007) classical WSD is missing by ignor­ing predefined senses. They treat translation can­didates as sense labels, then find linguistic fea­tures in the English side, and cast the disambigua­tion process as a classification problem. Of rele­vance also to our work is that related to the task of English monolingual lexical substitution. For example some of the approaches that participated in the SemEval 2007 excercise include the follow­ing. Yuret (2007) used a statistical language model based on a large corpus to assign likelihoods to each candidate substitutes for a target word in a sentence. Martinez et al. (2007) uses WordNet to find candidate substitutes, produce word sequence including substitutes. They rank the substitutes by ranking the word sequence including that substi­tutes using web queries. In (Giuliano C. <i>et</i><i> al, </i>2007), they extract synonyms from dictionaries. They have 2 ways of ranking of the synonyms: by similarity metric based on LSA and by occur­rence in a large 5-gram web corpus. Dahl et al. (2007) also extract synonyms from dictionaries. They present two systems. The first one scores substitutes based on how frequently the local con­text match the target word. The second one in­corporates cosine similarity. Finally, Hassan et al. (2007) extract candidates from several linguistic resources, and combine many techniques and ev­idences to compute the scores such as machine translation, most common sense, language model and so on to pick the most suitable lexical substi­tution candidates.</p></section><section number="6" title="Conclusions and Future Directions"><p>In this paper we presented a word sense disam­biguation based system for multilingual lexical substitution. The approach relies on having a WSD system for English and an automatic word alignment method. Crucially the approach relies on having parallel corpora. For Task 2 we apply a supervised WSD system to derive the English word senses. For Task 3, we apply an unsuper­vised approach to the training and test data. Both of our systems that participated in Task 2 achieve a decent ranking among the participating systems. For Task 3 we achieve the highest ranking on sev­eral of the language pairs: French, German and Italian.</p><p>In the future, we would like to investigate the</p><p>usage of the Spanish and Italian WordNets for the 131 task.<page local="4" global="132"/> We would like to also expand our exami­nation to other sources of bilingual data such as comparable corpora. Finally, we would like to in­vestigate using unsupervised clustering of senses (Word Sense Induction) methods in lieu of the WSD approaches that rely on WordNet.</p><table caption="Table 2: Results of T3-COLEUR per language on Task 3 Test set" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Language</p></td><td class="cell"><p>best</p></td><td class="cell"><p>oot</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>rank</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>rank</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Dutch</p></td><td class="cell"><p>10.71</p></td><td class="cell"><p>10.56</p></td><td class="cell"><p>3/3</p></td><td class="cell"><p>21.47</p></td><td class="cell"><p>21.27</p></td><td class="cell"><p>3/3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Spanish</p></td><td class="cell"><p>19.78</p></td><td class="cell"><p>19.59</p></td><td class="cell"><p>3/7</p></td><td class="cell"><p>35.84</p></td><td class="cell"><p>35.46</p></td><td class="cell"><p>5/7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>French</p></td><td class="cell"><p>21.96</p></td><td class="cell"><p>21.73</p></td><td class="cell"><p>1/7</p></td><td class="cell"><p>49.44</p></td><td class="cell"><p>48.96</p></td><td class="cell"><p>1/5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>German</p></td><td class="cell"><p>13.79</p></td><td class="cell"><p>13.63</p></td><td class="cell"><p>1/3</p></td><td class="cell"><p>33.21</p></td><td class="cell"><p>32.82</p></td><td class="cell"><p>1/3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Italian</p></td><td class="cell"><p>15.55</p></td><td class="cell"><p>15.4</p></td><td class="cell"><p>1/3</p></td><td class="cell"><p>40.7</p></td><td class="cell"><p>40.34</p></td><td class="cell"><p>1/3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table></section><references><p>Carpuat M. &amp; Wu D. (2007). Improving statis­tical machine translation using word sense disam­biguation. In <i>Proceedings of the 2007 Joint Con­ference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), </i>p. 61-72, Prague, Czech Republic: Association for Computational Linguistics.</p><p>Chan Y. S., Ng H. T. &amp; Chiang D. (2007). Word sense disambiguation improves statistical machine translation. In <i>Proceedings of the 45th Annual Meet­ing of the Association of Computational Linguistics, </i>p. 33^0, Prague, Czech Republic: Association for Computational Linguistics.</p><p>Dahl G., Frassica A. &amp; Wicentowski R. (2007). SW-AG: Local Context Matching for English Lexi­cal Substitution. In <i>Proceedings of the 4th workshop on Semantic Evaluations (SemEval-2007), </i>Prague, Czech Republic.</p><p>Fellbaum C. (1998). "wordnet: An electronic lexical database". MIT Press.</p><p>GlULIANO C, Gliozzo A. &amp; Strapparava C (2007). FBK-irst: Lexical Substitution Task Ex­ploiting Domain and Syntagmatic Coherence. In <i>Proceedings of the 4th workshop on Semantic Eval­uations (SemEval-2007), </i>Prague, Czech Republic.</p><p>Guo W. &amp; Diab M. (2009). "Improvements to mono­lingual English word sense disambiguation". In <i>ACL Workshop on Semantics Evaluations.</i><i></i></p><p>Guo W. &amp; Diab M. (2010). "Combining orthogonal monolingual and multilingual sources of evidence for All Words WSD". In <i>ACL 2010.</i></p><p>ing Knowledge Sources for Automatic Lexical Sub­stitution. In <i>Proceedings of the 4th workshop on Se­mantic Evaluations (SemEval-2007), </i>Prague, Czech Republic.</p><p>IDE N. &amp; V RONIS J. (1998). Word sense disambigua­tion: The state of the art. In <i>Computational Linguis­tics, </i>p. 1^10.</p><p>Jiang J. &amp; Conrath. D. (1997). Semantic similar­ity based on corpus statistics and lexical taxonomy.</p><p>In <i>Proceedings of the International Conference on Research in Computational Linguistics, </i>Taiwan.</p><p>Leacock C. &amp; Chodorow M. (1998). Combining local context and wordnet sense similarity for word sense identification. In <i>WordNet, An Electronic Lex­ical Database: </i>The MIT Press.</p><p>LEFEVER C. &amp; HOSTE V. (2009). SemEval-2010 Task 3: Cross-lingual Word Sense Disambiguation. In <i>Proceedings of the NAACL HLT Workshop on Se­mantic Evaluations: Recent Achievements and Fu­ture Directions, </i>Boulder, Colorado.</p><p>Lesk M. (1986). Automatic sense disambiguation us­ing machine readable dictionaries: How to tell a pine cone from an ice cream cone. In <i>In Proceedings of the SIGDOC Conference, </i>Toronto.</p><p>MARTINEZ D., KIM S. &amp; BALDWIN T. (2007). MELB-MKB: Lexical Substitution system based on Relatives in Context In <i>Proceedings of the 4th workshop on Semantic Evaluations (SemEval-2007), </i>Prague, Czech Republic.</p><p>M. palmer, C. fellbaum S. C. L. D. &amp; dang H. (2001). English tasks: all-words and verb lex­ical sample. In <i>In Proceedings of ACL/SIGLEX Senseval-2, </i>Toulouse, France.</p><p>MlHALCEA R. (2005). Unsupervised large-vocabulary word sense disambiguation with graph-based algo­rithms for sequence data labeling. In <i>Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Lan­guage Processing, </i>p. 411^118, Vancouver, British Columbia, Canada: Association for Computational Linguistics.</p><p>Hassan S., Csomai A., Banea C, Sinha R. &amp;    Miller G. A. (1990). Wordnet: a lexical database for MlHALCEA R. (2007). UNT: SubFinder: Combin-        english. In <i>Communications of the ACM, </i>p. 39^11.</p><page local="5" global="133"/><p>navigli R. (2009). Word sense disambiguation: a survey. In <i>ACM Computing Surveys, </i>p. 1-69: ACM Press.</p><p>OCH F. J. &amp; NEY H. (2003). A systematic compari­son of various statistical alignment models. <i>Compu­tational Linguistics, </i><b>29</b>(1), 19-51.</p><p>pedersen B. &amp; patwardhan (2005). Maximizing semantic relatedness to perform word sense disam­biguation. In <i>University of Minnesota Supercomput-ing Institute Research Report UMSI2005/25, </i>Min­nesota.</p><p>pradhan s., loper e., dligach d. &amp; palmer M. (2007). Semeval-2007 task-17: English lexi­cal sample, srl and all words. In <i>Proceedings of the Fourth International Workshop on Semantic Evalua­tions (SemEval-2007), </i>p. 87-92, Prague, Czech Re­public: Association for Computational Linguistics.</p><p>SlNHA R. &amp; MlHALCEA R. (2007). Unsupervised graph-based word sense disambiguation using mea­sures of word semantic similarity. In <i>Proceedings of the IEEE International Conference on Semantic Computing (ICSC2007), </i>Irvine, CA.</p><p>SiNHA R., McCarthy d. &amp; Mihalcea R. (2009). SemEval-2010 Task 2: Cross-Lingual Lexical Sub­stitution. In <i>Proceedings of the NAACL HLT Work­shop on Semantic Evaluations: Recent Achieve­ments and Future Directions, </i>Irvine, CA.</p><p>Snyder B. &amp; Palmer M. (2004). The english all-words task. In R. Mihalcea &amp; P. Edmonds, Eds., <i>Senseval-3: Third International Workshop on the Evaluation of Systems for the Semantic Analysis of Text, </i>p. 41—43, Barcelona, Spain: Association for Computational Linguistics.</p><p>YURET d. (2007). KU: Word sense disambiguation by substitution. In <i>Proceedings of the 4th workshop on Semantic Evaluations (SemEval-2007), </i>Prague, Czech Republic.</p></references></body></article>