<?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="242"/><title>UBA: Using Automatic Translation and Wikipedia for Cross-Lingual Lexical Substitution</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 242-247, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Basile" givenname="Pierpaolo"><org  name="University of Bari" country="Italy" city="Bari"/></author><author surname="Semeraro" givenname="Giovanni"><org  name="University of Bari" country="Italy" city="Bari"/></author></firstpageheader><frontmatter><p><b>UBA: Using Automatic Translation and Wikipedia for Cross-Lingual Lexical Substitution</b></p><p><b>Pierpaolo Basile</b></p><p>Dept. of Computer Science University of Bari "Aldo Moro" Via E. Orabona, 4 70125 Bari (ITALY)</p><p>basilepp@di.uniba.it</p></frontmatter><abstract>This paper presents the participation of the University of Bari (UBA) at the SemEval-2010 Cross-Lingual Lexical Substitution Task. The goal of the task is to substi­tute a word in a language <i>Ls,</i><i> </i>which oc­curs in a particular context, by provid­ing the best synonyms in a different lan­guage <i>Lt </i>which fit in that context. This task has a strict relation with the task of automatic machine translation, but there are some differences: Cross-lingual lexi­cal substitution targets one word at a time and the main goal is to find as many good translations as possible for the given tar­get word. Moreover, there are some con­nections with Word Sense Disambiguation (WSD) algorithms. Indeed, understand­ing the meaning of the target word is nec­essary to find the best substitutions. An important aspect of this kind of task is the possibility of finding synonyms with­out using a particular sense inventory or a specific parallel corpus, thus allowing the participation of unsupervised approaches. UBA proposes two systems: the former is based on an automatic translation system which exploits Google Translator, the lat­ter is based on a parallel corpus approach which relies on Wikipedia in order to find the best substitutions. </abstract></header><body><section number="1" title="Introduction"><p>The goal of the Cross-Lingual Lexical Substitu­tion (CLLS) task is to substitute a word in a lan­guage <i>Ls,</i><i> </i>which occurs in a particular context, by providing the best substitutions in a different language <i>Lt.</i><i> </i>In SemEval-2010 the source lan­guage <i>Ls</i><i> </i>is English, while the target language <i>Lt </i>is Spanish. Clearly, this task is related to Lexical <b>Giovanni Semeraro</b></p><footnote>semeraro@di.uniba.it</footnote><p>Substitution (LS) (McCarthy and Navigli, 2007) which consists in selecting an alternative word for a given one in a particular context by preserving its meaning. The main difference between the LS task and the CLLS one is that in LS source and target languages are the same. CLLS is not a easy task since neither a list of candidate words nor a specific parallel corpus are supplied by the orga­nizers. However, this opens the possibility of us­ing several knowledge sources, instead of a single one fixed by the task organizers. Therefore, the system must identify a set of candidate words in <i>Lt </i>and then select only those words which fit the context. From another point of view, the cross-lingual nature of the task allows to exploit auto­matic machine translation methods, hence the goal is to find as many good translations as possible for the given target word. A thorough description of the task can be found in (Mihalcea et al., 2010; Sinhaetal.,2009).</p><p>To easily understand the task, an example fol­lows. Consider the sentence:</p><p><i>During the siege, George Robertson had appointed Shuja-ul-Mulk, who was a <b>bright</b></i> <i>boy only 12 years old and the youngest surviving son of Aman-ul-Mulk, as the ruler of Chitral.</i></p><p>In the previous sentence the target word is <b>"bright". </b>Taking into account the meaning of the word <b>"bright" </b>in this particular context, the best substitutions in Spanish are: <b>"inteligente", "brillante" </b>and <b>"listo".</b></p><p>We propose two systems to tackle the problem of CLLS: the first is based on an automatic trans­lation system which exploits the API of Google Translator<footnote anchor="1"/>, the second is based on a parallel cor­pus approach which relies on Wikipedia. In par­ticular, in the second approach we use a struc­tured version of Wikipedia called DBpedia (Bizer et al., 2009).<page local="2" global="243"/> Both systems adopt several lexical resources to select the list of possible substitutions for a given word. Specifically, we use three differ­ent dictionaries: Google Dictionary, Babylon Dic­tionary and Spanishdict. Then, we combine the dictionaries into a single one, as described in Sec­tion 2.1.</p><footnote label="1"> http://code.google.eom/p/google-api-translate-java/</footnote><p>The paper is organized as follows: Section 2 de­scribes the strategy we adopted to tackle the CLLS task, while results of an experimental session we carried out in order to evaluate the proposed ap­proaches are presented in Section 3. Conclusions are discussed in Section 4.</p></section><section number="2" title="Methodology"><p>Generally speaking, the problem of CLLS can be coped with a strategy which consists of two steps, as suggested in (Sinha et al., 2009):</p><p><i>• candidate collection: </i>in this step several re­sources are queried to retrieve a list of po­tential translation candidates for each target word and part of speech;</p><p><i>• candidate selection: </i>this step concerns the ranking of potential candidates, which are the most suitable ones for each instance, by using information about the context.</p><p>Regarding the candidate collection, we exploit three dictionaries: Google Dictionary, Babylon Dictionary and Spanishdict. Each dictionary is modeled using a strategy described in Section 2.1. We use the same approach to model each dictio­nary in order to make easy both the inclusion of fu­ture dictionaries and the integration with the can­didate selection step.</p><p>Candidate selection is performed in two dif­ferent ways. The first one relies on the auto­matic translation of the sentence in which the tar­get word occurs, in order to find the best substitu­tions. The second method uses a parallel corpus built on DBpedia to discover the number of doc­uments in which the target word is translated by one of the potential translation candidates. Details about both methods are reported in Section 2.2</p><subsection number="2.1" title="Candidate collection"><p>This section describes the method adopted to re­trieve the list of potential translation candidates for each target word and part of speech.</p><p>Our strategy combines several bi-lingual dictio­naries and builds a single list of candidates for each target word. The involved dictionaries meet the following requirements:</p><p>1. the source language <i>Ls</i><i> </i>must be English and the target one <i>Lt </i>must be Spanish;</p><p>2. each dictionary must provide information about the part of speech; 3. the dictionary must be freely available.</p><p>Moreover, each candidate has a score <i>Sij </i>com­puted by taking into account its rank in the list of possible translations supplied by the <i>i </i><i>— </i><i>th </i>dictionary. Formally, let us denote by <i>D = </i><i>{d\, d2, ■ ■ ■, dn} </i>the set of <i>n </i>dictionaries and by <i>Li </i>= {ci, C2,..., <i>cmi}</i><i> </i>the list of potential candi­dates provided by <i>di. </i>The score is computed by the following equation:</p><doubt alpha="32.3" length="31" tooSmall="False" monospace="0.0">Sij = l--i-j£{1,2,...,riii} (1)</doubt><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">Tfli</doubt><p>Since each list <i>Li </i>has a different size, we adopt a score normalization strategy based on Z-score to merge the lists in a unique one. Z-score nor­malizes the scores according to the average <i>ß </i>and standard deviation <i>a. </i>Given the list of scores <i>L</i><i> </i><i>=</i><i> </i><i>{s\,</i><i> </i><i>S2, </i><i>■</i><i> </i><i>■</i><i> </i><i>■</i>, <i>sn},</i><i> </i><i>ß</i><i> </i>and <i>a</i><i> </i>are computed on <i>L </i>and the normalized score is defined as:</p><doubt alpha="36.4" length="11" tooSmall="False" monospace="0.0">sl=S-^(2)(j</doubt><p>Then, all the lists <i>Li </i>are merged in a single list <i>M.</i><i> </i>The list <i>M</i><i> </i>contains all the potential candi­dates belonging to all the dictionaries with the re­lated score. If a candidate occurs in more than one dictionary, only the occurrence with the maximum score is chosen.</p><p>At the end of the candidate collection step the list <i>M </i>of potential translation candidates for each target word is computed. It is important to point out that the list <i>M </i>is sorted and supplies an initial rank, which can be then modified by the candidate selection step.</p></subsection><subsection number="2.2" title="Candidate selection"><p>While the candidate collection step is common to the two proposed systems, the problem of candi­date selection is faced by using different strategies in the two systems.</p><page local="3" global="244"/><p>The first system, called unibaTranslate, uses a method based on google-api-translate-java<footnote anchor="2"/>. The main idea behind unibaTranslate is to look for a potential candidate in the translation of the target sentence. Sometimes, no potential can­didates occur into the translation. When this hap­pens the system uses some heuristics to discover a possible translation.</p><p>For example, given the target word <b>"raw" </b>and the potential candidates <i>M </i><i>={puro, crudo, sin re-finar, de baja calidad, agrietado, al natural, bozal, asado,frito andbruto}, </i>the two possible scenarios are:</p></subsection></section><section number="1." title="a potential candidate occurs into the transla­tion:"><p><i>• Sen'- </i><i>The <b>raw </b>honesty of that basic crudeness makes you feel stronger in a way.</i></p><p><i>• Ses: </i><i>La <b>cruda </b>honestidad de esa crudeza de base que te hace sentir mas fuerte en un camino.</i></p><p><i>2. </i>no potential candidates occur into the trans­lation, but a correct translation of the target word is provided:</p><p><i>• Sen: </i><i>Many institutional investors are now deciding that they are getting a <b>raw </b>deal from the company boards of Aus­tralia.</i></p><p><i>• Ses: </i><i>Muchos inversores institucionales estan ahora decidiendo que estan recibi-endo un trato <b>injusto </b>de los directorios de las empresas de Australia.</i></p><p>In detail, the strategy can be split in several steps:</p><p>1. Retrieve the list <i>M </i>of potential translation candidates using the method described in Section 2.1.</p><p>2. Translate the target sentence <i>Sen </i>from En­glish to Spanish, using the google-api-translate-java, which results into the sentence</p><doubt alpha="75.0" length="4" tooSmall="False" monospace="0.0">Ses-</doubt><p>3. Enrich <i>M </i>by adding multiword expressions. To implement this step, the two bigrams which contain the target word and the only trigram in which the target word is the <i>2nd</i>term are taken into to account.</p><footnote label="2">http://code.google.com/p/google-api-translate-java/</footnote><p>Coming back to the first sentence in the previ­ous example, the following n-grams are built: <i>"the raw", "raw honesty" </i>and <i>"the raw hon­esty". </i>For each n-gram, candidate transla­tions are looked for using Google Dictionary. If translations are found, they are added to <i>M </i>with an initial score equal to 0.</p><p>4. Fix a window <i>W<footnote anchor="3"/> </i>of <i>n </i>words to the right and to the left of the target word, and perform the following steps:</p><p>(a) for each candidate in M, try to find Cfc in <i>W. </i>If Cfc occurs in <i>W, </i>then add 2 to the score of    in M;</p><p>(b) if no exact match is found in the previ­ous step, perform a new search by com­paring Cfc with the words in <i>W </i>using the Levenshtein distance<footnote anchor="4"/>(Levenshtein, 1966). If the Levenshtein distance is greater than 0.8, then add 2 to the score of Cfc in <i>M.</i></p><p>5. If no exact/partial match is found in the pre­vious steps, probably the target word is trans­lated with a word which does not belong to <i>M.</i><i> </i>To overcome this problem, we implement a strategy able to discover a possible transla­tion in <i>Ses </i>which is not in <i>M.</i><i> </i>This approach involves three steps:</p><p>(a) for each word <i>Wi </i>in <i>Sen, </i>a list of poten­tial translations <i>Pi</i><i> </i>is retrieved;</p><p>(b) if a word in <i>Pi</i><i> </i>is found in <i>Ses, </i>the word is removed from <i>Ses<footnote anchor="5"/> ;</i></p><p>(c) at this point, <i>Ses </i>contains a list <i>R </i>of words with no candidate translations. A score is assigned to those words by tak­ing into account their position in <i>Ses</i>with respect to the position of the target word in <i>Sen, </i>using the following equa­tion:</p><doubt alpha="61.5" length="13" tooSmall="False" monospace="0.0">1_\posc-post\</doubt><doubt alpha="80.0" length="5" tooSmall="False" monospace="0.0">L-max</doubt><p>where <i>posc </i>is the translation candidate position in <i>Ses,</i><i> post </i>is the target word position in <i>Sen </i>and <i>Lmax </i>is the maxi­mum length between the length of <i>Sen</i>and <i>Ses-</i><page local="4" global="245"/></p><footnote label="3">The window W is the same for both S en  and S es .</footnote><footnote label="4">A normalized Levenshtein distance is adopted to obtain a value in [0, 1],</footnote><footnote label="5">A partial match based on normalized Levenshtein dis­tance is implemented.</footnote><p>Moreover, the words not semanti-cally related to the potential candidates (found using Spanish WordNet<footnote anchor="6"/>) are re­moved from <i>R. </i>In detail, for each candi­date in M a list of semantically related words in Spanish WordNet<footnote anchor="7"/> is retrieved which results in a set <i>WN</i><i> </i>of related words. Words in <i>R</i><i> </i>but not in <i>WN</i><i> </i>are removed from <i>R. </i>In the final step, the list <i>R </i>is sorted and the first word in <i>R </i>is added to <i>M </i>assigning a score equal to 2.</p><p>6. In the last step, the list <i>M </i>is sorted. The out­put of this process is the ranked list of poten­tial candidates.</p><p>It is important to underline that both <i>Sen </i>and <i>Ses </i>are tokenized, part-of-speech tagged and lem-matized. Lemmatization plays a key role in the matching step, while part-of-speech tagging is needed to query both the dictionaries and the Spanish WordNet. We adopt META (Basile et al., 2008) and FreeLing (Atserias et al., 2006) to per­form text processing for English and Spanish re­spectively.</p><p>The second proposed system, called unibaWiki, is based on the idea of automati­cally building a parallel corpus from Wikipedia. We use a structured version of Wikipedia called DBpedia (Bizer et al., 2009). The main idea be­hind DBpedia is to extract structured information from Wikipedia and then to make this information available. The main goal is to have access easily to the large amount of information in Wikipedia. DBpedia opens new and interesting ways to use Wikipedia in NLP applications.</p><p>In CLLS task, we use the extended abstracts of English and Spanish provided by DBpedia. For each extended abstract in Spanish which has the corresponding extended abstract in English, we build a document composed by two fields: the for­mer contains the English text <i>(texten) </i>and the lat­ter contains the Spanish text <i>(textes)- </i>We adopt Lucene<footnote anchor="8"/> as storage and retrieval engine to make the documents access fast and easy.</p><p>The idea behind unibaWiki is to count, for each potential candidate, the number of docu­ments in which the target word occurs in <i>texten</i>and the potential candidate occurs in <i>textes- </i>A score equal to the number of retrieved documents is assigned, then the candidates are sorted accord­ing to that score.</p><footnote label="6">http://www.lsi.upc.edu/~nlp/projectes/ewn.html  7 The semantic relations of hyperonymy, hyponymy and "similar to" are exploited. 8 http://lucene.apache.org/</footnote><p>Given the list <i>M </i>of potential candidates and the target word <i>t,</i><i> </i>for each e <i>M</i><i> </i>we perform the following query:</p><p><i>texten </i><i>'■</i><i> t </i>AND <i>textes </i><i>'■</i><i> </i><i>Ck</i> where the field name is followed by a colon and by the term you are looking for.</p><p>It is important to underline here that multiword expressions require a specific kind of query. For each multiword expression we adopt the Phrase-Query which is able to retrieve documents that contain a specific sequence of words instead of a single keyword.</p><subsection number="2.3" title="Implementation"><p>To implement the candidate collection step we de­veloped a lava application able to retrieve infor­mation from dictionaries. For each dictionary, a different strategy has been adopted. In particular:</p><p>1. <i>Google Dictionary: </i>Google Dictionary web­site is queried by using the HTTP protocol and the answer page is parsed;</p><p>2. <i>Spanishdict: </i>the same strategy adopted for Google Dictionary is used for the Spanishdict website<footnote anchor="9"/> ;</p><p>3. <i>Babylon Dictionary: </i>the original file avail­able from the Babylon website<footnote anchor="10"/> is converted to obtain a plain text file by using the Unix utility <i>dictconv. </i>After that, an application queries the text file in an efficient way by means of a hash map.</p><p>Both candidate selection systems are developed in lava. Regarding the unibaWiki system, we adopt Lucene to index DBpedia abstracts. The output of Lucene is an index of about 680 Mbytes, 277,685 documents and about 1,500,000 terms.</p></subsection></section><section number="3" title="Evaluation"><p>The goal of the evaluation is to measure the sys­tems' ability to find correct Spanish substitutions for a given word. The dataset supplied by the or­ganizers contains 1,000 instances in XML format.</p><footnote label="9">http ://www. spanishdict.com/  10 www.babylon.com</footnote><page local="5" global="246"/><p>Moreover, the organizers provide trial data com­posed by 300 instances to help the participants during the development of their systems.</p><p>The systems are evaluated using two scoring types: <b>best </b>scores the best guessed substitution, while out-of-ten <b>(oot) </b>scores the best 10 guessed substitutions. For each scoring type, precision (P) and recall <i>(R)</i><i> </i>are computed. Mode precision (P-<i>mode) </i>and mode recall <i>(R-mode) </i>calculate preci­sion and recall against the substitution chosen by the majority of the annotators (if there is a ma­jority), respectively. Details about evaluation and scoring types are provided in the task guidelines (McCarthy et al., 2009).</p><p>Results of the evaluation using trial data are reported in Table 1 and Table 2. Our systems are tagged as <b>UBA-T </b>and <b>UBA-W, </b>which de­note unibaTranslate and unibaWiki, re­spectively. Systems marked as <i>BL-1 </i>and <i>BL-2 </i>are the two baselines provided by the organiz­ers. The baselines use Spanishdict dictionary to retrieve candidates. The system <i>BL-1 </i>ranks the candidates according to the order returned on the online query page, while the <i>BL-2 </i>rank is based on candidate frequencies in the Spanish Wikipedia.</p><p>Results obtained using trial data show that our systems are able to overcome the baselines. Only the best score achieved by <i>UBA-W </i>is below <i>BL-1. </i>Moreover, our strategy based on Wikipedia <i>(UBA-</i><i>W)</i><i> </i>works better than the one proposed by the or­ganizers <i>(BL-2).</i></p><p>Results of the evaluation using test data are re­ported in Table 3 and Table 4, which include all the participants. Results show that <i>UBA-T </i>obtains the highest recall using <b>best </b>scoring strategy. More­over, both systems <i>UBA-T </i>and <i>UBA-W </i>achieve the highest P-mode and P-mode using <b>oot </b>scoring strategy. It is worthwhile to point out that the pres­ence of duplicates affect recall <i>(R)</i><i> </i>and precision <i>(P),</i><i> </i>but not P-mode and P-mode. For this reason some systems, such as <i>SWAT-E, </i>obtain very high recall <i>(R)</i><i> </i>and low P-mode using <b>oot </b>scoring. Du­plicates are not produced by our systems, but we performed an a posteriori experiment in which du­plicates are allowed. In that experiment, the first candidate provided by <i>UBA-T </i>has been duplicated ten times in the results. Using that strategy, <i>UBA-T </i>achieves a recall (and precision) equal to 271.51. This experiment proves that also our system is able to obtain the highest recall when duplicates are al­lowed into the results. Moreover, it is important to underline here that we do not know how other par­ticipants generate duplicates in their results. We adopted a trivial strategy to introduce duplicates.</p><p>Finally, Table 5 reports some statistics about <i>UBA-T </i>and the number of times (AO the candidate translation is taken from Spanish WordNet <i>(Spanish </i><i>WN)</i><i> </i>or multiword expressions <i>(Multi­word exp.</i><page local="6" global="247"/><i>). </i>The number of instances in which the candidate is a correct substitution is reported in column C. Analyzing the results we note that most errors are due to part-of-speech tagging. For example, given the following sentence:</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><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Tab</p></td><td class="cell"><p>le 3: <b>best </b>results (test data)</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>System</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>P-mode</p></td><td class="cell"><p>R-Mode</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-1</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>BL-2</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"><p><b>UBA-T</b></p></td><td class="cell"><p><b>27.15</b></p></td><td class="cell"><p><b>27.15</b></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><b>UBA-W</b></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>USPWLV</p></td><td class="cell"><p>26.81</p></td><td class="cell"><p>26.81</p></td><td class="cell"><p><b>58.85</b></p></td><td class="cell"><p><b>58.85</b></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>27.59</p></td><td class="cell"><p>25.99</p></td><td class="cell"><p>59.16</p></td><td class="cell"><p>56.24</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>21.62</p></td><td class="cell"><p>20.56</p></td><td class="cell"><p>45.01</p></td><td class="cell"><p>44.58</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>19.47</p></td><td class="cell"><p>18.15</p></td><td class="cell"><p>40.03</p></td><td class="cell"><p>37.72</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>22.16</p></td><td class="cell"><p>15.38</p></td><td class="cell"><p>45.95</p></td><td class="cell"><p>33.47</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>22.51</p></td><td class="cell"><p>13.21</p></td><td class="cell"><p>45.27</p></td><td class="cell"><p>28.26</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.62</p></td><td class="cell"><p>8.39</p></td><td class="cell"><p>15.31</p></td><td class="cell"><p>14.95</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Table 4: <b>oot </b>results (test data)</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>System</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>P-mode</p></td><td class="cell"><p>R-Mode</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-1</p></td><td class="cell"><p>44.04</p></td><td class="cell"><p>44.04</p></td><td class="cell"><p>73.53</p></td><td class="cell"><p>73.53</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-2</p></td><td class="cell"><p>42.65</p></td><td class="cell"><p>42.65</p></td><td class="cell"><p>71.60</p></td><td class="cell"><p>71.60</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>UBA-T</b></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"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>UBA-W</b></p></td><td class="cell"><p>52.75</p></td><td class="cell"><p>52.75</p></td><td class="cell"><p><b>83.54</b></p></td><td class="cell"><p><b>83.54</b></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"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Colslm</p></td><td class="cell"><p>46.61</p></td><td class="cell"><p>43.91</p></td><td class="cell"><p>69.41</p></td><td class="cell"><p>65.98</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"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SWAT-E</p></td><td class="cell"><p><b>174.59</b></p></td><td class="cell"><p><b>174.59</b></p></td><td class="cell"><p>66.94</p></td><td class="cell"><p>66.94</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"></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"></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"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ColEur</p></td><td class="cell"><p>44.77</p></td><td class="cell"><p>41.72</p></td><td class="cell"><p>71.47</p></td><td class="cell"><p>67.35</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>33.14</p></td><td class="cell"><p>31.48</p></td><td class="cell"><p>58.30</p></td><td class="cell"><p>55.42</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>29.74</p></td><td class="cell"><p>8.33</p></td><td class="cell"><p>64.44</p></td><td class="cell"><p>19.89</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>35.46</p></td><td class="cell"><p>34.54</p></td><td class="cell"><p>59.16</p></td><td class="cell"><p>58.02</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"></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><td class="cell"></td></tr></table><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>Table 1 <b>: best </b>resul</p></td><td class="cell"><p>ts (trial c</p></td><td class="cell"><p>ata)</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>System</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>P-mode</p></td><td class="cell"><p>R-Mode</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-1</p></td><td class="cell"><p>24.50</p></td><td class="cell"><p>24.50</p></td><td class="cell"><p>51.80</p></td><td class="cell"><p>51.80</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-2</p></td><td class="cell"><p>14.10</p></td><td class="cell"><p>14.10</p></td><td class="cell"><p>28.38</p></td><td class="cell"><p>28.38</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>UBA-T</b></p></td><td class="cell"><p><b>26.39</b></p></td><td class="cell"><p><b>26.39</b></p></td><td class="cell"><p><b>59.01</b></p></td><td class="cell"><p><b>59.01</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>UBA-W</b></p></td><td class="cell"><p>22.18</p></td><td class="cell"><p>22.18</p></td><td class="cell"><p>48.65</p></td><td class="cell"><p>48.65</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Table 2: <b>oot </b>results (trial data)</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>System</p></td><td class="cell"><p>P</p></td><td class="cell"><p>R</p></td><td class="cell"><p>P-mode</p></td><td class="cell"><p>R-Mode</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-1</p></td><td class="cell"><p>38.58</p></td><td class="cell"><p>38.58</p></td><td class="cell"><p>71.62</p></td><td class="cell"><p>71.62</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>BL-2</p></td><td class="cell"><p>37.83</p></td><td class="cell"><p>37.83</p></td><td class="cell"><p>68.02</p></td><td class="cell"><p>68.02</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>UBA-T</b></p></td><td class="cell"><p>44.16</p></td><td class="cell"><p>44.16</p></td><td class="cell"><p><b>78.38</b></p></td><td class="cell"><p><b>78.38</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>UBA-W</b></p></td><td class="cell"><p><b>45.15</b></p></td><td class="cell"><p><b>45.15</b></p></td><td class="cell"><p>72.52</p></td><td class="cell"><p>72.52</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><i>Sen: </i>You will still be responsible for the shipping and handling fees, and for the cost of <b>return­ing </b>the merchandise.</p><p><i>Ses: </i>Usted seguira siendo responsable de los gas­tos de envio y manipulacion y, para los gastos de <b>devolucion </b>de la mercancia.</p><p>where the target word is the verb <i>return. </i>In this case the verb is used as noun and the algorithm suggests correctly <i>devolucion </i>(noun) as substitu­tion instead of <i>devolver </i>(verb). The gold standard provided by the organizers contains <i>devolver </i>as substitution and there is no match between <i>devolu­cion </i>and <i>devolver </i>during the scoring.</p><p><u>Table 5: <i>UBA-T </i>statistics.</u></p></section><section number="4" title="Conclusions"><p>We described our participation at SemEval-2 Cross-Lingual Lexical Substitution Task, propos­ing two systems called <i>UBA-T </i>and <i>UBA-W. </i>The first relies on Google Translator, the second is based on DBpedia, a structured version of Wikipedia. Moreover, we exploited several dictio­naries to retrieve the list of candidate substitutions.</p><p><i>UBA-T </i>achieves the highest recall among all the participants to the task. Moreover, the results proved that the method based on Google Transla­tor is more effective than the one based on DBpe­dia.</p></section><section title="Acknowledgments"><p>This research was partially funded by Regione Puglia under the contract POR PUGLIA 2007-2013 - Asse I Linea 1.1 Azione 1.1.2 - Bando "Aiuti agli Investimenti in Ricerca per le PMI" -Fondo per le Agevolazioni alia Ricerca, project ti­tle: "Natural Browsing".</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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Strategy</b></p></td><td class="cell"><p><b>N</b></p></td><td class="cell"><p><b>C</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Spanish WN</p></td><td class="cell"><p>34</p></td><td class="cell"><p>11</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Multiword exp.</p></td><td class="cell"><p>21</p></td><td class="cell"><p>11</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></tr></table></section><references><p>Jordi Atserias, Bernardino Casas, Elisabet Comelles, Meritxell Gonzalez, Llufs Padro, and Muntsa Padro. 2006. FreeLing 1.3: Syntactic and semantic services in an open-source NLP library. In <i>Proceedings of the 5th International Conference on Language Re­sources and Evaluation (LREC06), </i>pages 48-55.</p><p>Pierpaolo Basile, Marco de Gemmis, Anna Lisa Gen­tile, Leo Iaquinta, Pasquale Lops, and Giovanni Se-meraro. 2008. META - MultilanguagE Text Ana­lyzer. In <i>Proceedings of the Language and Speech Technnology Conference - LangTech 2008, Rome, Italy, February 28-29, </i>pages 137-140.</p><p>Christian Bizer, Jens Lehmann, Georgi Kobilarov, Sören Auer, Christian Becker, Richard Cyganiak, and Sebastian Hellmann. 2009. DBpedia-A crys­tallization point for the Web of Data. <i>Web Seman­tics: Science, Services and Agents on the World Wide Web, </i>Issue 7:154-165.</p><p>Vladimir Iosifovich Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and re­versals. In <i>Soviet Physics-Doklady, </i>volume 10.</p><p>Diana McCarthy and Roberto Navigli. 2007. SemEval-2007 Task 10: English Lexical Sub­stitution Task. In <i>Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-2007), </i>pages 48-53, Prague, Czech Re­public, June. Association for Computational Lin­guistics.</p><p>Diana McCarthy, Rada Sinha, and Ravi Mihal-cea. 2009. Cross Lingual Lexical Sub­stitution. http://lit.csci.unt.edu/DOCS/task2clls-documentation.pdf.</p><p>Rada Mihalcea, Ravi Sinha, and Diana McCarthy. 2010. SemEval-2010 Task 2: Cross-Lingual Lexical Substitution. In <i>Proceedings of the 5th International Workshop on Semantic Evaluations (SemEval-2010). </i>Association for Computational Linguistics.</p><p>Ravi Sinha, Diana McCarthy, and Rada Mihalcea. 2009. SemEval-2010 Task 2: cross-lingual lexical substitution. In <i>SEW '09: Proceedings of the Work­shop on Semantic Evaluations: Recent Achieve­ments and Future Directions, </i>pages 76-81, Morris-town, NJ, USA. Association for Computational Lin­guistics.</p></references></body></article>