<?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="9"/><title>SemEval-2010 Task 2: Cross-Lingual Lexical Substitution</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 9-14, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Mihalcea" givenname="Rada"><org  name="University of North Texas" country="USA" city="Denton"/></author><author surname="Sinha" givenname="Ravi"><org  name="University of North Texas" country="USA" city="Denton"/></author><author surname="McCarthy" givenname="Diana"><org  name="Lexical Computing Ltd." country="United Kingdom" city="Brighton"/></author></firstpageheader><frontmatter><p><b>SemEval-2010 Task 2: Cross-Lingual Lexical Substitution</b></p><p><b>Rada Mihalcea Ravi Sinha Diana McCarthy</b></p><p>University of North Texas      University of North Texas       Lexical Computing Ltd. rada@cs.unt.edu ravisinha@unt.edu diana@dianamccarthy.co.uk</p></frontmatter><abstract>In this paper we describe the SemEval-2010 Cross-Lingual Lexical Substitution task, where given an English target word in context, participating systems had to find an alternative substitute word or phrase in Spanish. The task is based on the English Lexical Substitution task run at SemEval-2007. In this paper we pro­vide background and motivation for the task, we describe the data annotation pro­cess and the scoring system, and present the results of the participating systems. </abstract></header><body><section number="1" title="Introduction"><p>In the Cross-Lingual Lexical Substitution task, an-notators and systems had to find an alternative substitute word or phrase in Spanish for an En­glish target word in context. The task is based on the English Lexical Substitution task run at SemEval-2007, where both target words and sub­stitutes were in English.</p><p>An automatic system for cross-lingual lexical substitution would be useful for a number of ap­plications. For instance, such a system could be used to assist human translators in their work, by providing a number of correct translations that the human translator can choose from. Similarly, the system could be used to assist language learners, by providing them with the interpretation of the unknown words in a text written in the language they are learning. Last but not least, the output of a cross-lingual lexical substitution system could be used as input to existing systems for cross-language information retrieval or automatic ma­chine translation.</p></section><section number="2" title="Motivation and Related Work"><p>While there has been a lot of discussion on the rel­evant sense distinctions for monolingual WSD sys­tems, for machine translation applications there is a consensus that the relevant sense distinctions are those that reflect different translations. One early and notable work was the Senseval-2 Japanese Translation task (Kurohashi, 2001) that obtained alternative translation records of typical usages of a test word, also referred to as a <i>translation mem­ory. </i>Systems could either select the most appro­priate translation memory record for each instance and were scored against a gold-standard set of an­notations, or they could provide a translation that was scored by translation experts after the results were submitted. In contrast to this work, in our task we provided actual translations for target in­stances in advance, rather than predetermine trans­lations using lexicographers or rely on post-hoc evaluation, which does not permit evaluation of new systems after the competition.</p><p>Previous standalone WSD tasks based on par­allel data have obtained distinct translations for senses as listed in a dictionary (Ng and Chan, 2007). In this way fine-grained senses with the same translations can be lumped together, how­ever this does not fully allow for the fact that some senses for the same words may have some transla­tions in common but also others that are not (Sinha et al., 2009).</p><p>In our task, we collected a dataset which al­lows instances of the same word to have some translations in common, while not necessitating a clustering of translations from a specific re­source into senses (in comparison to Lefever and Hoste (2010)). <footnote anchor="1"/> Resnik and Yarowsky (2000) also</p><p>'Though in that task note that it is possible for a transla­tion to occur in more than one cluster. It will be interesting to<page local="2" global="10"/></p><p>conducted experiments using words in context, rather than a predefined sense-inventory however in these experiments the annotators were asked for a single preferred translation. In our case, we al­lowed annotators to supply as many translations as they felt were equally valid. This allows us to examine more subtle relationships between us­ages and to allow partial credit to systems that get a close approximation to the annotators' trans­lations. Unlike a full blown machine translation task (Carpuat and Wu, 2007), annotators and sys­tems are not required to translate the whole context but just the target word.</p></section><section number="3" title="Background: The English Lexical Substitution Task"><p>The English Lexical substitution task (hereafter referred to as lexsub) was run at SemEval-2007 (McCarthy andNavigli, 2007; McCarthy and Navigli, 2009). lexsub was proposed as a task which, while requiring contextual disambiguation, did not presuppose a specific sense inventory. In fact, it is quite possible to use alternative rep­resentations of meaning, such as those proposed by Schütze (1998) and Pantel and Lin (2002).</p><p>The motivation for a substitution task was that it would reflect capabilities that might be useful for natural language processing tasks such as para­phrasing and textual entailment, while not requir­ing a complete system that might mask system ca­pabilities at a lexical level and make participation in the task difficult for small research teams.</p><p>The task required systems to produce a substi­tute word for a word in context. The data was collected for 201 words from open class parts-of-speech (PoS) (i.e. nouns, verbs, adjectives and ad­verbs). Words were selected that have more than one meaning with at least one near synonym. Ten sentences for each word were extracted from the English Internet Corpus (Sharoff, 2006). There were five annotators who annotated each target word as it occurred in the context of a sentence. The annotators were each allowed to provide up to three substitutes, though they could also provide a NIL response if they could not come up with a substitute. They had to indicate if the target word was an integral part of a multiword.</p><p>see the extent that this actually occurred in their data and the extent that the translations that our annotators provided might be clustered.</p></section><section number="4" title="The Cross-Lingual Lexical Substitution Task"><p>The Cross-Lingual Lexical Substitution task fol­lows lexsub except that the annotations are translations rather than paraphrases. Given a tar­get word in context, the task is to provide several correct translations for that word in a given lan­guage. We used English as the source language and Spanish as the target language.</p><p>We provided both development and test sets, but no training data. As for lexsub, any systems re­quiring training data had to obtain it from other sources. We included nouns, verbs, adjectives and adverbs in both development and test data. We used the same set of 30 development words as in lexsub, and a subset of 100 words from the lex­sub test set, selected so that they exhibit a wide variety of substitutes. For each word, the same ex­ample sentences were used as in lexsub.</p><subsection number="4.1" title="Annotation"><p>We used four annotators for the task, all native Spanish speakers from Mexico, with a high level of proficiency in English. As in lexsub, the an­notators were allowed to use any resources they wanted to, and were required to provide as many substitutes as they could think of.</p><p>The inter-tagger agreement (ITA) was calcu­lated as pairwise agreement between sets of sub­stitutes from annotators, as done in lexsub. The ITA without mode was determined as 0.2777, which is comparable with the ITA of 0.2775 de­termined for lexsub.</p></subsection><subsection number="4.2" title="An Example"><p>One significant outcome of this task is that there are not necessarily clear divisions between usages and senses because we do not use a predefined sense inventory, or restrict the annotations to dis­tinctive translations. This means that there can be usages that overlap to different extents with each other but do not have identical translations. An example is the target adverb <i>severely. </i>Four sen­tences are shown in Figure 1 with the translations provided by one annotator marked in italics and {} braces. Here, all the token occurrences seem related to each other in that they share some trans­lations, but not all. There are sentences like 1 and 2 that appear not to have anything in com­mon. However 1, 3, and 4 seem to be partly re­lated (they share <i>sever cimente), </i>and 2, 3, and 4 are also partly related (they share <i>seriamente). </i>When we look again, sentences 1 and 2, though not di­rectly related, both have translations in common with sentences 3 and 4.<page local="3" global="11"/></p></subsection><subsection number="4.3" title="Scoring"><p>We adopted the <b>best </b>and <b>out-of-ten </b>precision and recall scores from lexsub (oot in the equations below). The systems were allowed to supply as many translations as they feel fit the context. The system translations are then given credit depend­ing on the number of annotators that picked each translation. The credit is divided by the number of annotator responses for the item and since for the <b>best </b>score the credit for the system answers for an item is also divided by the number of an­swers the system provides, this allows more credit to be given to instances where there is less varia­tion. For that reason, a system is better guessing the translation that is most frequent unless it re­ally wants to hedge its bets. Thus if <i>i </i>is an item in the set of instances <i>I,</i><i> </i>and Tj is the multiset of gold standard translations from the human annota­tors for <i>i, </i>and a system provides a set of answers <i>Si</i><i> </i>for <i>i, </i>then the <b>best </b>score for item <i>i </i>is<footnote anchor="2"/>:</p><doubt alpha="66.7" length="15" tooSmall="False" monospace="0.0">best score{i) =</doubt><p><i>T</i><b><i>,seSj </i></b><i>frequencyjs </i>g <i>Tj]</i></p><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(1)</doubt><p>Precision is calculated by summing the scores for each item and dividing by the number of items that the system attempted whereas recall divides the sum of scores for each item by |/|. Thus:</p><p><i>best precision =</i> <i>best recall =</i></p><doubt alpha="64.9" length="37" tooSmall="False" monospace="0.0">J2ibest score{i) \i&lt;EI : defined{Si)\</doubt><p><i>J2i </i><i>best score{i)</i></p><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(2)</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(3)</doubt><p>The <b>out-of-ten </b>scorer allows up to ten system responses and does not divide the credit attributed to each answer by the number of system responses. This allows a system to be less cautious and for the fact that there is considerable variation on the task and there may be cases where systems select a perfectly good translation that the annotators had not thought of. By allowing up to ten translations in the <b>out-of-ten </b>task the systems can hedge their bets to find the translations that the annotators sup­plied.</p><doubt alpha="64.3" length="14" tooSmall="False" monospace="0.0">oot score{i) =</doubt><p><i>J2seSj </i><i>frequencyjs </i>g <i>Tj]</i></p><p><i>oot precision</i> <i>oot recall =</i></p><doubt alpha="63.9" length="36" tooSmall="False" monospace="0.0">J2ioot score{i) \i&lt;EI : defined{Si)\</doubt><p><i>J2i </i><i>oot score{i)</i></p><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(4)</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(5)</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(6)</doubt><p>NB scores are multiplied by 100, though for <b>out-of-ten </b>this is not strictly a percentage.</p><p>We note that there was an issue that the origi­nal lexsub <b>out-of-ten </b>scorer allowed duplicates (McCarthy and Navigli, 2009). The effect of du­plicates is that systems can get inflated scores be­cause the credit for each item is not divided by the number of substitutes and because the frequency of each annotator response is used. McCarthy and Navigli (2009) describe this oversight, identify the systems that had included duplicates and explain the implications. For our task, we decided to con­tinue to allow for duplicates, so that systems can boost their scores with duplicates on translations with higher probability.</p><p>For both the <b>best </b>and <b>out-of-ten </b>measures, we also report a <i>mode </i>score, which is calculated against the mode from the annotators responses as was done in lexsub. Unlike the lexsub task, we did not run a separate multi-word subtask and evaluation.</p></subsection></section><section number="5" title="Baselines and Upper bound"><p>To place results in perspective, several baselines as well as the upper bound were calculated.</p><subsection number="5.1" title="Baselines"><p>We calculated two baselines, one dictionary-based and one dictionary and corpus-based. The base­lines were produced with the help of an on­line Spanish-English dictionary<footnote anchor="3"/> and the Spanish Wikipedia. For the first baseline, denoted by dict, for all target words, we collected all the Spanish translations provided by the dictionary, in the or­der returned on the online query page. The <b>best </b>baseline was produced by taking the first transla­tion provided by the online dictionary, while the <b>out-of-ten </b>baseline was produced by taking the first 10 translations provided.</p><p>The second baseline, dictcorp, also ac­counted for the frequency of the translations within a Spanish dictionary. All the translations<page local="4" global="12"/></p><footnote>www.spanishdict.com</footnote><p>1. Perhaps the effect of West Nile Virus is sufficient to extinguish endemic birds already <b>severely </b>stressed by habitat losses, <i>{fuertemente, severamente, duramente, exageradamente]</i> <i>2.</i><i> </i>She looked as <b>severely </b>as she could muster at Draco, <i>{rigurosamente, seriamente]</i> 3. A day before he was due to return to the United States Patton was <b>severely </b>injured in a road accident.</p><p><i>{seriamente, duramente, severamente]</i></p><p>4. Use market tools to address environmental issues , such as eliminating subsidies for industries that <b>severely </b>harm the environment, like coal, <i>{peligrosamente, seriamente, severamente]</i> 5. This picture was <b>severely </b>damaged in the flood of 1913 and has rarely been seen until now.</p><p><i>{altamente, seriamente, exageradamente]</i> _<u>Figure 1 :</u><u> Translations from one annotator for the adverb <i>severely</i></u><i>_</i> provided by the online dictionary for a given target word were ranked according to their frequencies in the Spanish Wikipedia, producing the dictcorp baseline.</p></subsection><subsection number="5.2" title="Upper bound"><p>The results for the <b>best </b>task reflect the inherent variability as less credit is given where annotators express differences. The theoretical upper bound for the <b>best </b>recall (and precision if all items are attempted) score is calculated as:</p><p><i>bestnh =</i></p><p><i>E</i>
<i>freq </i><i>most freq substitute^ </i><i>iei </i><i>\7\\</i></p><doubt alpha="0.0" length="7" tooSmall="False" monospace="0.0">= 40.57</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">100</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(7)</doubt><p>Note of course that this upper bound is theoretical and assumes a human could find the most frequent substitute selected by all annotators. Performance of annotators will undoubtedly be lower than the theoretical upper bound because of human vari­ability on this task. Since we allow for duplicates, the <b>out-of-ten </b>upper bound assumes the most fre­quent word type in Tj is selected for all ten an­swers. Thus we would obtain ten times the <b>best </b>upper bound (equation 7).</p><doubt alpha="83.3" length="6" tooSmall="False" monospace="0.0">OOtub=</doubt><p><i>E</i>
<i>freq </i><i>most freq substitute^ </i>X 10 <i>iei </i><i>\7\\</i></p><doubt alpha="0.0" length="8" tooSmall="False" monospace="0.0">= 405.78</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(8)</doubt><p>If we had not allowed duplicates then the <b>out-of-ten </b>upper bound would have been just less than 100% (99.97). This is calculated by assuming the top 10 most frequent responses from the annota­tors are picked in every case. There are only a couple of cases where there are more than 10 transla­tions from the annotators.</p></subsection></section><section number="6" title="Systems"><p>Nine teams participated in the task, and several of them entered two systems. The systems used various resources, including bilingual dictionar­ies, parallel corpora such as Europarl or corpora built from Wikipedia, monolingual corpora such as Web IT or newswire collections, and transla­tion software such as Moses, GIZA or Google. Some systems attempted to select the substitutes on the English side, using a lexical substitu­tion framework or word sense disambiguation, whereas some systems made the selection on the Spanish side using lexical substitution in Spanish.</p><p>In the following, we briefly describe each par­ticipating system.</p><p>cu-smt relies on a phrase-based statistical ma­chine translation system, trained on the Europarl English-Spanish parallel corpora.</p><p>The UvT-v and UvT-g systems make use of k-nearest neighbour classifiers to build one word ex­pert for each target word, and select translations on the basis of a GIZA alignment of the Europarl parallel corpus.</p><p>The uba-t and uba-w systems both use can­didates from Google dictionary, SpanishDict.com and Babylon, which are then confirmed using par­allel texts, uba-t relies on the automatic trans­lation of the source sentence using the Google Translation API, combined with several heuristics. The uba-w system uses a parallel corpus auto­matically constructed from DBpedia.</p><p>swat-E and swat-S use a lexical substitution framework applied to either English or Spanish. The swat-E system first performs lexical substitution in English, and then each substitute is translated into Spanish, swat-S translates the source sentences into Spanish, identifies the Span­ish word corresponding to the target word, and then it performs lexical substitution in Spanish.<page local="5" global="13"/></p><p>TYO uses an English monolingual substitution module, and then it translates the substitution can­didates into Spanish using the Freedict and the Google English-Spanish dictionary.</p><p>FCC-LS uses the probability of a word to be translated into a candidate based on estimates ob­tained from the GIZA alignment of the Europarl corpus. These translations are subsequently fil­tered to include only those that appear in a trans­lation of the target word using Google translate.</p><p>WLVusp determines candidates using the best N translations of the test sentences obtained with the Moses system, which are further filtered us­ing an English-Spanish dictionary. uspWLV uses candidates from an alignment of Europarl, which are then selected using various features and a clas­sifier tuned on the development data.</p><p>IRST-1 generates the <b>best </b>substitute using a PoS constrained alignment of Moses translations of the source sentences, with a back-off to a bilingual dictionary. For <b>out-of-ten, </b>dictionary translations are filtered using the LSA similarity between can­didates and the sentence translation into Spanish. iRSTbs is intended as a baseline, and it uses only the PoS constrained Moses translation for <b>best, </b>and the dictionary translations for <b>out-of-ten.</b></p><p>colEur and colslm use a supervised word sense disambiguation algorithm to distinguish between senses in the English source sentences. Trans­lations are then assigned by using GIZA align­ments from a parallel corpus, collected for the word senses of interest.</p></section><section number="7" title="Results"><p>Tables 1 and 2 show the precision <i>P </i>and recall <i>R </i>for the <b>best </b>and <b>out-of-ten </b>tasks respectively, for normal and mode. The rows are ordered by <i>R. </i>The <b>out-of-ten </b>systems were allowed to pro­vide up to 10 substitutes and did not have any ad­vantage by providing less. Since duplicates were allowed so that a system can put more emphasis on items it is more confident of, this means that <b>out-of-ten </b><i>R </i>and <i>P </i>scores might exceed 100% because the credit for each of the human answers is used for each of the duplicates (McCarthy and Navigli, 2009). Duplicates will not help the mode scores, and can be detrimental as valuable guesses which would not be penalised are taken up with duplicates. In table 2, in the column marked dups, we display the number of test items for which at least one duplicate answer was provided. <footnote anchor="4"/> Al­though systems were perfectly free to use dupli­cates, some may not have realised this. <footnote anchor="5"/> Dupli­cates help when a system is fairly confident of a subset of its 10 answers.</p><p>We had anticipated a practical issue to come up with all participants, which is the issue of different character encodings, especially when using bilin­gual dictionaries from the Web. While we were counting on the participants to clean their files and provide us with clean characters only, we ended up with result files following different encodings (e.g, UTF-8, ANSI), some of them including diacrit­ics, and some of them containing malformed char­acters. We were able to perform a basic cleaning of the files, and transform the diacritics into their diacriticless counterparts, however it was not pos­sible to clean all the malformed characters without a significant manual effort that was not possible due to time constraints. As a result, a few of the participants ended up losing a few points because their translations, while being correct, contained an invalid, malformed character that was not rec­ognized as correct by the scorer.</p><p>There is some variation in rank order of the sys­tems depending on which measures are used. <footnote anchor="6"/><page local="6" global="14"/></p><footnote label="4">Please note that any residual character encoding issues were not considered by the scorer and so the number of du­plicates may be slightly higher than if diacritics/different en­codings had been considered.</footnote><footnote label="5">Also, note that some systems did not supply 10 transla­tions. Their scores would possibly have improved if they had done so.</footnote><footnote label="6">There is not a big difference between P and R because</footnote><table caption="Table 1: bestresults" 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>Systems</p></td><td class="cell"><p><i>R</i></p></td><td class="cell"><p><i>P</i></p></td><td class="cell"><p><i>ModeR</i></p></td><td class="cell"><p><i>ModeP</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UBA-T</p></td><td class="cell"><p>27.15</p></td><td class="cell"><p>27.15</p></td><td class="cell"><p>57.20</p></td><td class="cell"><p>57.20</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>uspWLV</p></td><td class="cell"><p>26.81</p></td><td class="cell"><p>26.81</p></td><td class="cell"><p>58.85</p></td><td class="cell"><p>58.85</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Colslm</p></td><td class="cell"><p>25.99</p></td><td class="cell"><p>27.59</p></td><td class="cell"><p>56.24</p></td><td class="cell"><p>59.16</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>WLVusp</p></td><td class="cell"><p>25.27</p></td><td class="cell"><p>25.27</p></td><td class="cell"><p>52.81</p></td><td class="cell"><p>52.81</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>swat-E</p></td><td class="cell"><p>21.46</p></td><td class="cell"><p>21.46</p></td><td class="cell"><p>43.21</p></td><td class="cell"><p>43.21</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UvT-v</p></td><td class="cell"><p>21.09</p></td><td class="cell"><p>21.09</p></td><td class="cell"><p>43.76</p></td><td class="cell"><p>43.76</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>CU-smt</p></td><td class="cell"><p>20.56</p></td><td class="cell"><p>21.62</p></td><td class="cell"><p>44.58</p></td><td class="cell"><p>45.01</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UBA-W</p></td><td class="cell"><p>19.68</p></td><td class="cell"><p>19.68</p></td><td class="cell"><p>39.09</p></td><td class="cell"><p>39.09</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UvT-g</p></td><td class="cell"><p>19.59</p></td><td class="cell"><p>19.59</p></td><td class="cell"><p>41.02</p></td><td class="cell"><p>41.02</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SWAT-S</p></td><td class="cell"><p>18.87</p></td><td class="cell"><p>18.87</p></td><td class="cell"><p>36.63</p></td><td class="cell"><p>36.63</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ColEur</p></td><td class="cell"><p>18.15</p></td><td class="cell"><p>19.47</p></td><td class="cell"><p>37.72</p></td><td class="cell"><p>40.03</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IRST-1</p></td><td class="cell"><p>15.38</p></td><td class="cell"><p>22.16</p></td><td class="cell"><p>33.47</p></td><td class="cell"><p>45.95</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IRSTbs</p></td><td class="cell"><p>13.21</p></td><td class="cell"><p>22.51</p></td><td class="cell"><p>28.26</p></td><td class="cell"><p>45.27</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TYO</p></td><td class="cell"><p>8.39</p></td><td class="cell"><p>8.62</p></td><td class="cell"><p>14.95</p></td><td class="cell"><p>15.31</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>DICT</p></td><td class="cell"><p>24.34</p></td><td class="cell"><p>24.34</p></td><td class="cell"><p>50.34</p></td><td class="cell"><p>50.34</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>DICTCORP</p></td><td class="cell"><p>15.09</p></td><td class="cell"><p>15.09</p></td><td class="cell"><p>29.22</p></td><td class="cell"><p>29.22</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><p>Table 2: <b>out-of-ten </b>results uba-t has the highest ranking on <i>R </i>for <b>best.</b><b> </b>us­pWLV is best at finding the mode, for <b>best </b>how­ever the uba-w and uba-t systems (particularly the former) both have exceptional performance for finding the mode in the <b>out-of-ten </b>task, though note that swat-S performs competitively given that its duplicate responses will reduce its chances on this metric. swat-E is the best system for <b>out-of-ten, </b>as several of the items that were empha­sized through duplication were also correct.</p><p>The results are much higher than for lex­sub (McCarthy and Navigli, 2007). There are sev­eral possible causes for this. It is perhaps easier for humans, and machines to come up with trans­lations compared to paraphrases. Though the ITA figures are comparable on both tasks, our task con­tained only a subset of the data in lexsub and we specifically avoided data where the lexsub an­notators had not been able to come up with a sub­stitute or had labelled the instance as a name e.g. measurements such as <i>pound, yard </i>or terms such as <i>mad </i>in <i>mad cow disease. </i>Another reason for this difference may be that there are many parallel corpora available for training a system for this task whereas that was not the case for lexsub.</p></section><section number="8" title="Conclusions"><p>In this paper we described the SemEval-2010 cross-lingual lexical substitution task, including the motivation behind the task, the annotation pro­cess and the scoring system, as well as the partic­ipating systems. Nine different teams with a total</p><p>systems typically supplied answers for most items. However, <b>IRST</b>-1 and <b>IRSTbs </b>did considerably better on precision com­pared to recall since they did not cover all test items.</p><p>of 15 different systems participated in the task, us­ing a variety of resources and approaches. Com­parative evaluations using different metrics helped determine what works well for the selection of cross-lingual lexical substitutes.</p></section><section number="9" title="Acknowledgements"><p>The work of the first and second authors has been partially supported by a National Science Foundation CAREER award #0747340. The work of the third author has been supported by a Royal Society UK Dorothy Hodgkin Fellowship. The authors are grateful to Samer Hassan for his help with the annotation interface.</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><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Systems</p></td><td class="cell"><p><i>R</i></p></td><td class="cell"><p><i>P</i></p></td><td class="cell"><p><i>Mode R</i></p></td><td class="cell"><p><i>ModeP</i></p></td><td class="cell"><p>dups</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SWAT-e</p></td><td class="cell"><p>174.59</p></td><td class="cell"><p>174.59</p></td><td class="cell"><p>66.94</p></td><td class="cell"><p>66.94</p></td><td class="cell"><p>968</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SWAT-S</p></td><td class="cell"><p>97.98</p></td><td class="cell"><p>97.98</p></td><td class="cell"><p>79.01</p></td><td class="cell"><p>79.01</p></td><td class="cell"><p>872</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UvT-v</p></td><td class="cell"><p>58.91</p></td><td class="cell"><p>58.91</p></td><td class="cell"><p>62.96</p></td><td class="cell"><p>62.96</p></td><td class="cell"><p>345</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UvT-g</p></td><td class="cell"><p>55.29</p></td><td class="cell"><p>55.29</p></td><td class="cell"><p>73.94</p></td><td class="cell"><p>73.94</p></td><td class="cell"><p>146</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UBA-W</p></td><td class="cell"><p>52.75</p></td><td class="cell"><p>52.75</p></td><td class="cell"><p>83.54</p></td><td class="cell"><p>83.54</p></td><td class="cell"><p>-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>WLVusp</p></td><td class="cell"><p>48.48</p></td><td class="cell"><p>48.48</p></td><td class="cell"><p>77.91</p></td><td class="cell"><p>77.91</p></td><td class="cell"><p>64</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>UBA-T</p></td><td class="cell"><p>47.99</p></td><td class="cell"><p>47.99</p></td><td class="cell"><p>81.07</p></td><td class="cell"><p>81.07</p></td><td class="cell"><p>-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>uspWLV</p></td><td class="cell"><p>47.60</p></td><td class="cell"><p>47.60</p></td><td class="cell"><p>79.84</p></td><td class="cell"><p>79.84</p></td><td class="cell"><p>30</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Colslm</p></td><td class="cell"><p>43.91</p></td><td class="cell"><p>46.61</p></td><td class="cell"><p>65.98</p></td><td class="cell"><p>69.41</p></td><td class="cell"><p>509</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ColEur</p></td><td class="cell"><p>41.72</p></td><td class="cell"><p>44.77</p></td><td class="cell"><p>67.35</p></td><td class="cell"><p>71.47</p></td><td class="cell"><p>125</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TYO</p></td><td class="cell"><p>34.54</p></td><td class="cell"><p>35.46</p></td><td class="cell"><p>58.02</p></td><td class="cell"><p>59.16</p></td><td class="cell"><p>-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IRST-1</p></td><td class="cell"><p>31.48</p></td><td class="cell"><p>33.14</p></td><td class="cell"><p>55.42</p></td><td class="cell"><p>58.30</p></td><td class="cell"><p>-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>FCC-LS</p></td><td class="cell"><p>23.90</p></td><td class="cell"><p>23.90</p></td><td class="cell"><p>31.96</p></td><td class="cell"><p>31.96</p></td><td class="cell"><p>308</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>IRSTbs</p></td><td class="cell"><p>8.33</p></td><td class="cell"><p>29.74</p></td><td class="cell"><p>19.89</p></td><td class="cell"><p>64.44</p></td><td class="cell"><p>-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>DICT</p><p>DICTCORP</p></td><td class="cell"><p>44.04 42.65</p></td><td class="cell"><p>44.04 42.65</p></td><td class="cell"><p>73.53 71.60</p></td><td class="cell"><p>73.53 71.60</p></td><td class="cell"><p>30</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></tr></table></section><references><p>Marine Carpuat and Dekai Wu. 2007. Improving statis­tical machine translation using word sense disambigua­tion. In <i>Proceedings of the Joint Conference on Empir­ical Methods in Natural Language Processing and Com­putational Natural Language Learning (EMNLP-CoNLL 2007), </i>pages 61-72, Prague, Czech Republic, June. Asso­ciation for Computational Linguistics.</p><p>Sadao Kurohashi. 2001. <b>SENSEVAL</b>-2 japanese translation task. In <i>Proceedings of the </i><b>SENSEVAL</b>-2 <i>workshop, </i>pages 37^14.</p><p>Els Lefever and Véronique Hoste. 2010. SemEval-2007 task 3: Cross-lingual word sense disambiguation. In <i>Proceed­ings of the 5th International Workshop on Semantic Eval­uations (SemEval-2010), </i>Uppsala, Sweden.</p><p>Diana McCarthy and Roberto Navigli. 2007. SemEval-2007 task 10: English lexical substitution task. In <i>Proceedings of the 4th International Workshop on Semantic Evalua­tions (SemEval-2007), </i>pages 48-53, Prague, Czech Re­public.</p><p>Diana McCarthy and Roberto Navigli. 2009. The English lexical substitution task. <i>Language Resources and Eval­uation Special Issue on Computational Semantic Analysis of Language: SemEval-2007 and Beyond, </i>43(2): 139-159.</p><p>Hwee TouNg and Yee Seng Chan. 2007. SemEval-2007 task 11 : English lexical sample task via English-Chinese paral­lel text. In <i>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007), </i>pages 54-58, Prague, Czech Republic.</p><p>Patrick Pantel and Dekang Lin. 2002. Discovering word senses from text. In <i>Proceedings of ACM SIGKDD Con­ference on Knowledge Discovery and Data Mining, </i>pages 613-619, Edmonton, Canada.</p><p>Philip Resnik and David Yarowsky. 2000. Distinguishing systems and distinguishing senses: New evaluation meth­ods for word sense disambiguation. <i>Natural Language Engineering, </i>5(3): 113-133.</p><p>Hinrich Schütze. 1998. Automatic word sense discrimina­tion. <i>Computational Linguistics, </i>24(1):97-123.</p><p>Serge Sharoff. 2006. Open-source corpora: Using the net to fish for linguistic data. <i>International Journal of Corpus Linguistics, </i>11(4):435^162.</p><p>Ravi Sinha, Diana McCarthy, and Rada Mihalcea. 2009. Semeval-2010 task 2: Cross-lingual lexical substitution. In <i>Proceedings of the NAACL-HLT Workshop SEW-2009 - Semantic Evaluations: Recent Achievements and Future Directions, </i>Boulder, Colorado, USA.</p></references></body></article>