<?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="123"/><title>SWAT: Cross-Lingual Lexical Substitution using Local Context Matching, Bilingual Dictionaries and Machine Translation</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 123-128, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Wicentowski" givenname="Richard"><org  name="Swarthmore College" country="USA" city="Swarthmore"/></author><author surname="Kelly" givenname="Maria"><org  name="Swarthmore College" country="USA" city="Swarthmore"/></author><author surname="Lee" givenname="Rachel"><org  name="Swarthmore College" country="USA" city="Swarthmore"/></author></firstpageheader><frontmatter><p><b>SWAT: Cross-Lingual Lexical Substitution using Local Context Matching, Bilingual Dictionaries and Machine Translation</b></p><p><b>Richard Wicentowski, Maria Kelly, Rachel Lee</b></p><p>Department of Computer Science Swarthmore College Swarthmore, PA 19081 USA</p><p>richardw@cs.swarthmore.edu, {mkellyl,rleel}@sccs.swarthmore.edu</p></frontmatter><abstract>We present two systems that select the most appropriate Spanish substitutes for a marked word in an English test sen­tence. These systems were official en­tries to the SemEval-2010 Cross-Lingual Lexical Substitution task. The first sys­tem, swat-E, finds Spanish substitutions by first finding English substitutions in the English sentence and then translating these substitutions into Spanish using an English-Spanish dictionary. The second system, S wat-S, translates each English sentence into Spanish and then finds the Spanish substitutions in the Spanish sen­tence. Both systems exceeded the base­line and all other participating systems by a wide margin using one of the two official scoring metrics. </abstract></header><body><section number="1" title="Introduction"><p>We present two systems submitted as official en­tries to the SemEval-2010 Cross-Lingual Lexical Substitution task (Mihalcea et al., 2010). In this task, participants were asked to substitute a single marked word in an English sentence with the most appropriate Spanish translation(s) given the con­text. On the surface, our two systems are very sim­ilar, performing monolingual lexical substitution and using translation tools and bilingual dictionar­ies to make the transition from English to Spanish.</p></section><section number="2" title="Scoring"><p>The task organizers used two scoring metrics adapted from the SemEval-2007 English Lexical Substitution task (McCarthy and Navigli, 2007). For each test item <i>i, </i>human annotators provided a multiset of substitutions, Tj, that formed the gold standard. Given a system-provided multiset an­swer <i>Si </i>for test item <i>i, </i>the <i>best </i>score for a single test item is computed using (1). Systems were allowed to provide an unlimited number of re­sponses in <i>Si, </i>but each item's <i>best </i>score was di­vided by the number of answers provided in <i>Si.</i></p><p><i>,   , <u>J2seSi </u></i><u>frequency(s </u><u>g </u><i><u>Tj)</u></i></p><doubt alpha="40.0" length="25" tooSmall="False" monospace="0.0">bestscore =--——-j——-- (1)</doubt><doubt alpha="38.5" length="13" tooSmall="False" monospace="0.0">I'-'il '\J-i\</doubt><p>The out-of-ten score, henceforth <i>oot, </i>limited sys­tems to a maximum of 10 responses for each test item. Unlike the <i>best </i>scoring method, the final score for each test item in the <i>oot </i>method is not di­vided by the actual number of responses provided by the system; therefore, systems could maximize their score by always providing exactly 10 re­sponses. In addition, since <i>Si </i>is a multiset, the 10 responses in <i>Si </i>need not be unique.</p><doubt alpha="61.0" length="41" tooSmall="False" monospace="0.0">EseSifrequency(sgT{) ootscore =---—-- (2)</doubt><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">\J-i\</doubt><p>Further details on the <i>oot </i>scoring method and its impact on our systems can be found in Section 3.4.</p><p>The final <i>best </i>and <i>oot </i>score for the system is computed by summing the individual scores for each item and, for recall, dividing by the number of tests items, and for precision, dividing by the number of test items answered. Our systems pro­vided a response to every test item, so precision and recall are the same by this definition.</p><p>For both <i>best </i>and <i>oot, </i>the Mode recall (simi­larly, Mode precision) measures the system's abil­ity to identify the substitute that was the annota­tors' most frequently chosen substitute, when such a most frequent substitute existed (McCarthy and Navigli, 2007).</p></section><section number="3" title="Systems"><p>Our two entries were Swat-E and Swat-S. Both systems used a two-step process to obtain a ranked list of substitutes. The Swat-E system first used a monolingual lexical substitution algorithm to pro­vide a ranked list of English substitutes and then these substitutes were translated into Spanish to obtain the cross-lingual result.<page local="2" global="124"/> The S wat-S sys­tem performed these two steps in the reverse or­der: first, the English sentences were translated into Spanish and then the monolingual lexical sub­stitution algorithm was run on the translated out­put to provide a ranked list of Spanish substitutes.</p><subsection number="3.1" title="Syntagmatic coherence"><p>The monolingual lexical substitution algorithm used by both systems is an implementation of the syntagmatic coherence criterion used by the IRST2 system (Giuliano et al., 2007) in the SemEval-2007 Lexical Substitution task.</p><p>For a sentence <i>Hw </i>containing the target word <i>w, </i>the IRST2 algorithm first compiles a set, <i>E, </i>of candidate substitutes for <i>w </i>from a dictionary, the­saurus, or other lexical resource. For each e e <i>E, He </i>is formed by substituting e for <i>w </i>in <i>Hw. </i>Each n-gram (2 &lt; <i>n &lt; </i>5) of <i>He </i>containing the sub­stitute e is assigned a score, /, equal to how fre­quently the n-gram appeared in a large corpus.</p><p>For all triples (e, <i>n, </i>/) where / &gt; 0, we add (e, <i>n, </i>/) to <i>E'. E' </i>is then sorted by <i>n, </i>with ties broken by /. The highest ranked item in <i>E', </i>there­fore, is the triple containing the synonym e that appeared in the longest, most frequently occurring n-gram. Note that each candidate substitute e can appear multiple times in <i>E'\ </i>once for each value of <i>n.</i></p><p>The list <i>E' </i>becomes the final output of the syn­tagmatic coherence criterion, providing a ranking for all candidate substitutes in <i>E.</i></p></subsection><subsection number="3.2" title="The Swat-E system 3.2.1 Resources"><p>The Swat-E system used the English Web IT 5-gram corpus (Brants and Franz, 2006), the Span­ish section of the WeblT European 5-gram cor­pus (Brants and Franz, 2009), Roget's online the­saurus<footnote anchor="1"/>, NLTK's implementation of the Lancaster Stemmer (Loper and Bird, 2002), Google's online English-Spanish dictionary<footnote anchor="2"/>, and SpanishDict's online dictionary<footnote anchor="3"/>. We formed a single Spanish-English dictionary by combining the translations found in both dictionaries.</p><p>!http://thesaurus.com <footnote anchor="2"/>http://www.google.com/dictionary http ://www.spanishdict.com</p><subsubsection number="3.2.2" title="Ranking substitutes"><p>The first step in the swat-E algorithm is to create a ranked list of English substitutes. For each En­glish test sentence <i>Hw </i>containing the target word <i>w, </i>we use the syntagmatic coherence criterion de­scribed above to create <i>E<footnote anchor="1"/>, </i>a ranking of the syn­onyms of <i>w </i>taken from Roget's thesaurus. We use the Lancaster stemmer to ensure that we count all morphologically similar lexical substitutes.</p><p>Next, we use a bilingual dictionary to convert our candidate English substitutes into candidate Spanish substitutes, forming a new ranked list <i>S'. </i>For each item (e, <i>n, </i>/) in <i>E', </i>and for each Spanish translation <i>s </i>of e, we add the triple (s, <i>n, </i>/) to <i>S'. </i>Since different English words can have the same Spanish translation <i>s, </i>we can end up with multiple triples in <i>S' </i>that have the same values for <i>s </i>and <i>n. </i>For example, if <i>s\ </i>is a translation of both <i>e\ </i>and e2, and the triples (ei, 4,87) and (e2,4,61) appear in <i>E', </i>then <i>S' </i>will contain the triples (si, 4, 87) and (si, 4,61). We merge all such "duplicates" by summing their frequencies. In this example, we would replace the two triples containing <i>s\ </i>with a new triple, (si, 4,148). After merging all dupli­cates, we re-sort <i>S' </i>by <i>n, </i>breaking ties by /. No­tice that since triples are merged only when both <i>s </i>and <i>n </i>are the same, Spanish substitutes can appear multiple times in <i>S'\ </i>once for each value of <i>n.</i></p><p>At this point, we have a ranked list of candi­date Spanish substitutes, <i>S'. </i>From this list <i>S', </i>we keep only those Spanish substitutes that are direct translations of our original word <i>w. </i>The reason for doing this is that some of the transla­tions of the synonyms of <i>w </i>have no overlapping meaning with <i>w. </i>For example, the polysemous English noun "bug" can mean a flaw in a com­puter program (cf. test item 572). Our thesaurus lists "hitch" as a synonym for this sense of "bug". Of course, "hitch" is also polysemous, and not ev­ery translation of "hitch" into Spanish will have a meaning that overlaps with the original "bug" sense. Translations such as "enganche", having the "trailer hitch" sense, are certainly not appro­priate substitutes for this, or any, sense of the word "bug". By keeping only those substitutes that are also translations of the original word <i>w, </i>we main­tain a cleaner list of candidate substitutes. We call this filtered list of candidates <i>S.</i></p></subsubsection><subsubsection number="3.2.3" title="Selecting substitutes"><p>For each English sentence in the test set, we now have a ranked list of cross-lingual lexical substi-<page local="3" global="125"/></p><doubt alpha="50.0" length="20" tooSmall="False" monospace="0.0">l:best ={(si,ni,/i)}</doubt><doubt alpha="25.0" length="4" tooSmall="False" monospace="0.0">2:j2</doubt><doubt alpha="35.7" length="84" tooSmall="False" monospace="0.0">3:while(rij == ri\)and(fj&gt;0.75*/i)do4:best&lt;— best U {(sj, n^, /.,•)} 5:./ •   ./ • 1</doubt><p>6: <b>end while</b></p><figure caption="Figure 1: The method for selecting multiple an­swers in thebestmethod used bySwat-E"></figure><p>tutes, <i>S. </i>In the <i>oot </i>scoring method, we selected the top 10 substitutes in the ranked list <i>S. </i>If there were less than 10 items (but at least one item) in <i>S, </i>we duplicated answers from our ranked list un­til we had made 10 guesses. (See Section 3.4 for further details on this process.) If there were no items in our ranked list, we returned the most fre­quent translations of <i>w </i>as determined by the un-igram counts of these translations in the Spanish Web IT corpus.</p><p>For our <i>best </i>answer, we returned multiple re­sponses when the highest ranked substitutes had similar frequencies. Since <i>S </i>was formed by trans­ferring the frequency of each English substitute e onto all of its Spanish translations, a single English substitute that had appeared with high frequency would lead to many Spanish substitutes, each with high frequencies. (The frequencies need not be ex­actly the same due to the merging step described above.) In these cases, we hedged our bet by re­turning each of these translations.</p><p>Representing the <i>i-th </i>item in <i>S </i>as <i>(si,rii, fa), </i>our procedure for creating the <i>best </i>answer can be found in Figure 1. We allow all items from <i>S </i>that have the same value of <i>n </i>as the top ranked item and have a frequency at least 75% that of the most frequent item to be included in the best answer.</p><p>Of the 1000 test instances, we provided a single "best" candidate 630 times, two candidates 253 times, three candidates 70 times, four candidates 30 times, and six candidates 17 times. (We never returned five candidates).</p><doubt alpha="56.0" length="25" tooSmall="False" monospace="0.0">3.3S wat-S3.3.1 Resources</doubt><p>The Swat-S system used both Google's<footnote anchor="4"/> and Ya­hoo's<footnote anchor="5"/> online translation tools, the Spanish section of the WeblT European 5-gram corpus, Roget's online thesaurus, TreeTagger (Schmid, 1994) for morphological analysis and both Google's and Ya­hoo's<footnote anchor="6"/> English-Spanish dictionaries. We formed a single Spanish-English dictionary by combining the translations found in both dictionaries.</p><footnote label="4">http://translate.google.com/  5 http://babelfish.yahoo.com/</footnote></subsubsection><subsubsection number="3.3.2" title="Ranking substitutes"><p>To find the cross-lingual lexical substitutes for a target word in an English sentence, we first trans­late the sentence into Spanish and then use the syntagmatic coherence criterion on the translated Spanish sentence.</p><p>In order to perform this monolingual Spanish lexical substitution, we need to be able to iden­tify the target word we are attempting to substitute in the translated sentence. We experimented with using Moses (Koehn et al., 2007) to perform the machine translation and produce a word alignment but we found that Google's online translation tool produced better translations than Moses did when trained on the Europarl data we had available.</p><p>In the original English sentence, the target word is marked with an XML tag. We had hoped that Google's translation tool would preserve the XML tag around the translated target word, but that was not the case. We also experimented with using quotation marks around the target word instead of the XML tag. The translation tool often preserved quotation marks around the target word, but also yielded a different, and anecdotally worse, transla­tion than the same sentence without the quotation marks. (We will, however, return to this strategy as a backoff method.) Although we did not exper­iment with using a stand-alone word alignment al­gorithm to find the target word in the Spanish sen­tence, Section 4.3 provides insights into the possi­ble performance gains possible by doing so.</p><p>Without a word alignment, we were left with the following problem: Given a translated Span­ish sentence <i>H, </i>how could we identify the word <i>w </i>that is the translation of the original English target word, <i>vl </i>Our search strategy proceeded as fol­lows.</p><p>1. We looked up <i>v </i>in our English-Spanish dictio­nary and searched <i>H </i>for one of these trans­lations (or a morphological variant), choosing the matching translation as the Spanish target word. If the search yielded multiple matches, we chose the match that was in the most similar position in the sentence to the position of <i>v </i>in the English sentence.<page local="4" global="126"/> This method identified a match in 801 of the 1000 test sentences.</p><footnote label="6">http://education.yahoo.com/reference/ dict_en_es/</footnote><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">\J-i\</doubt><p>2. If we had not found a match, we translated each word in <i>H </i>back into English, one word at a time. If one of the re-translated words was a synonym of <i>v,</i><i> </i>we chose that word as the target word. If there were multiple matches, we again used position to choose the target.</p><p>3. If we still had no match, we used Yahoo's trans­lation tool instead of Google's, and repeated steps 1. and 2. above.</p><p>4. If we still had no match, we reverted to using Google's translation tool, this time explicitly offsetting the English target word with quota­tion marks.</p><p>In 992 of the 1000 test sentences, this four-step procedure produced a Spanish sentence <i>Hw </i>with a target <i>w. </i>For each of these sentences, we pro­duced <i>E', </i>the list of ranked Spanish substitutes using the syntagmatic selection coherence crite­rion described in Section 3.1. We used the Span­ish Web IT corpus as a source of n-gram counts, and we used the Spanish translations of <i>v </i>as the candidate substitution set <i>E. </i>For the remaining 8 test sentences where we could not identify the target word, we set <i>E' </i>equal to the top 10 most frequently occurring Spanish translations of <i>v </i>as determined by the unigram counts of these trans­lations in the Spanish Web IT corpus.</p></subsubsection><subsubsection number="3.3.3" title="Selecting substitutes"><p>For each English sentence in the test set, we se­lected the single best item in <i>E<footnote anchor="1"/> </i>as our answer for the <i>best </i>scoring method.</p><p>For the <i>oot </i>scoring method, we wanted to en­sure that the translated target word <i>w, </i>identified in Section 3.3.2, was represented in our output, even if this substitute was poorly ranked in <i>E'. </i><i>Ifw</i><i> </i>ap­peared in <i>E', </i>then our <i>oot </i>answer was simply the first 10 entries in <i>E'. \îw </i>was not in <i>E', </i>then our answer was the top 9 entries in <i>E' </i>followed by <i>w.</i></p><p>As we had done with our swat-E system, if the <i>oot </i>answer contained less than 10 items, we repeated answers until we had made 10 guesses. See the following section for more information.</p></subsubsection></subsection><subsection number="3.4" title="oot selection details"><p>The metric used to calculate <i>oot </i>precision in this task (Mihalcea et al., 2010) favors systems that al­ways propose 10 candidate substitutes over those that propose fewer than 10 substitutes. For each test item the <i>oot </i>score is calculated as follows:</p><p><i>EseSi </i>frequency(s g <i>T)</i><i> </i><i>oot </i>score =---—--</p><p>The final <i>oot </i>recall is just the average of these scores over all test items. For test item <i>i, Si </i>is the multiset of candidates provided by the system, <i>Ti </i>is the multiset of responses provided by the an-notators, and frequency(s g <i>T)</i><i> </i>is the number of times each item <i>s </i>appeared in <i>T.</i></p><p>Assume that <i>T </i><i>= {feliz, feliz, contento, ale-gre}. </i>A system that produces <i>Si = {feliz, con­tento} </i>would receive a score of = 0.75. How­ever a system that produces <i>Si with feliz </i>and <i>con­tento </i>each appearing 5 times would receive a score of <i>5*2+5*1 </i>=3.75. Importantly, a system that pro­duced <i>Si = {feliz, contento} </i>plus 8 other responses that were not in the gold standard would receive the same score as the system that produced only <i>Si = {feliz, contento}, </i>so there is never a penalty for providing all 10 answers.</p><p>For this reason, in both of our systems, we en­sure that our <i>oot </i>response always contains exactly 10 answers. To do this, we repeatedly append our list of candidates to itself until the length of the list is equal to or exceeds 10, then we truncate the list to exactly 10 answers. For example, if our orig­inal candidate list was [a, b, c, d], our final <i>oot </i>response would be [a, b, c, d, a, b, c, d, a, b].</p><p>Notice that this is not the only way to produce a response with 10 answers. An alternative would be to produce a response containing [a, b, c, d] followed by 6 other unique translations from the English-Spanish dictionary. However, we found that padding the response with unique answers was far less effective than repeating the answers returned by the syntagmatic coherence algorithm.</p></subsection></section><section number="4" title="Analysis of Results"><p>Table 1 shows the results of our two systems com­pared to two baselines, dict and dictcorp, and the upper bound for the task.<footnote anchor="7"/> Since all of these systems provide an answer for every test instance, precision and recall are always the same. The upper bound for the <i>best </i>metric results from re­turning a single answer equal to the annotators' most frequent substitute. The upper bound for the <i>oot </i>metric is obtained by returning the annotator's most frequent substitute repeated 10 times.</p><footnote label="7">Details on the baselines and the upper bound can be found in (Mihalcea et al, 2010).</footnote><page local="5" global="127"/><p>Table 1 : System performance using the two scor­ing metrics, <i>best </i>and <i>oot. </i>All test instances were answered, so precision equals recall. dict and dictcorp are the two baselines.</p><p>Like the IRST2 system (Giuliano et al., 2007) submitted in the 2007 Lexical Substitution task, our system performed extremely well on the <i>oot </i>scoring method while performing no better than average on the <i>best </i>method. Further analysis should be done to determine if this is due to a flaw in the approach, or if there are other factors at work.</p><subsection number="4.1" title="Analysis of the oot method"><p>Our <i>oot </i>performance was certainly helped by the fact that we chose to provide 10 answers for each test item. One way to measure this is to score both of our systems with all duplicate candidates removed. We can see that the recall of both sys­tems drops off sharply: swat-E drops from 174.6 to 36.3, and Swat-S drops from 98.0 to 46.7. As was shown in Section 3.4, the <i>oot </i>system should always provide 10 answers; however, 12.8% of the Swat-S test responses, and only 3.2% of the Swat-E test responses contained no duplicates. In fact, 38.4% of the Swat-E responses contained only a single unique answer. Providing duplicate answers allowed us to express confidence in the substitutes found. If duplicates were forbidden, simply filling any remaining answers with other translations taken from the English-Spanish dic­tionary could only serve to increase performance.</p><p>Another way to measure the effect of always providing 10 answers is to modify the responses provided by the other systems so that they, too, always provide 10 answers. Of the 14 submitted systems, only 5 (including our systems) provided 10 answers for each test item. Neither of the two baseline systems, dict and dictcorp, provided 10 answers for each test item. Using the algorithm described in Section 3.4, we re-scored each of the systems with answers duplicated so that each re­sponse contained exactly 10 substitutes. As shown</p><p>Table 2: System performance using <i>oot </i>for the top 4 systems when providing exactly 10 substi­tutes for all answered test items ("filled oot"), as well as the score as submitted ("oot").</p><p>in Table 2, both systems still far exceed the base­line, swat-E remains the top scoring system, and S wat-S drops to 3rd place behind irst-1, which had finished 12th with its original submission.</p></subsection><subsection number="4.2" title="Analysis of oot Mode R"><p>Although the swat-E system outperformed the S wat-S system in <i>best </i>recall, <i>best </i>Mode recall ("Mode R"), and <i>oot </i>recall, the S wat-S system outperformed the swat-E system by a large mar­gin in <i>oot </i>Mode R (see Table 1). This result is easily explained by first referring to the method used to compute Mode recall: a score of 1 was given to each test instance where the <i>oot </i>response contained the annotators' most frequently chosen substitute; otherwise 0 was given. The average of these scores yields Mode R. A system can max­imize its Mode R score by always providing 10 unique answers. Swat-E provided an average of 3.3 unique answers per test item and Swat-S pro­vided 6.9 unique answers per test item. By provid­ing more than twice the number of unique answers per test item, it is not at all surprising that swat-S outperformed Swat-E in the Mode R measure.</p></subsection><subsection number="4.3" title="Analysis of S wat- S"><p>In the S wat-S system, 801 (of 1000) test sen­tences had a direct translation of the target word present in Google's Spanish translation (identi­fied by step 1 in Section 3.3.2). In these cases, the resulting output was better than those cases where a more indirect approach (steps 2-4) was necessary. The <i>oot </i>precision on the test sentences where the target was found directly was 101.3, whereas the precision of the test sentences where a target was found more indirectly was only 84.6. The 8 sentences where the unigram backoff was<page local="6" global="128"/></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></p></td><td class="cell"><p></p></td><td class="cell"><p><i>best</i></p></td><td class="cell"><p></p></td><td class="cell"><p><i>oot</i></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>R</p></td><td class="cell"><p>ModeR</p></td><td class="cell"><p>R</p></td><td class="cell"><p>ModeR</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.5</p></td><td class="cell"><p>43.2</p></td><td class="cell"><p>174.6</p></td><td class="cell"><p>66.9</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>S WAT-S</p></td><td class="cell"><p>18.9</p></td><td class="cell"><p>36.6</p></td><td class="cell"><p>98.0</p></td><td class="cell"><p>79.0</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.3</p></td><td class="cell"><p>50.3</p></td><td class="cell"><p>44.0</p></td><td class="cell"><p>73.5</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.1</p></td><td class="cell"><p>29.2</p></td><td class="cell"><p>29.2</p></td><td class="cell"><p>29.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>upper bound</p></td><td class="cell"><p>40.6</p></td><td class="cell"><p>100.0</p></td><td class="cell"><p>405.9</p></td><td class="cell"><p>100.0</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><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>System</p></td><td class="cell"><p><i>filled oot </i>R P</p></td><td class="cell"><p><i>oot </i>R P</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SWAT-E IRST-1 S WAT-S WLVUSP</p></td><td class="cell"><p>174.6 174.6 126.0 132.6</p><p>98.0 98.0</p><p>86.1 86.1</p></td><td class="cell"><p>174.6 174.6 31.5 33.1 98.0 98.0 48.5 48.5</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>71.1 71.1 66.7 66.7</p></td><td class="cell"><p>44.0 44.0</p><p>15.1 15.1</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><table caption="Table 3: Precision ofbestandootfor both sys­tems, analyzed by part of speech."></table><p>The officiai competition results showed that our two systems performed much better than the other systems on the <i>oot </i>scoring method, but that we performed only about average on the <i>best </i>scoring method.</p><p>The analysis provided here indicates that the <i>oot </i>score for swat-e would hold even if every sys­tem had its answers duplicated in order to ensure 10 answers were provided for each test item. We also we showed that a word alignment tool would likely improve the performance of s wat-s, but that this improvement would not be enough to sur­pass swat-e.</p><p>used had a precision of 77.4. This analysis in­dicates that using a word alignment tool on the translated sentence pairs would improve the per­formance of the method. However, since the pre­cision in those cases where the target word could be identified was only 101.3, using a word align­ment tool would almost certainly leave S wat-S as a distant second to the 174.6 precision achieved by swat-E.</p></subsection><subsection number="4.4" title="Analysis by part-of-speech"><p>Table 3 shows the performance of both systems broken down by part-of-speech. In the IRST2 sys­tem submitted to the 2007 Lexical Substitution task, adverbs were the best performing word class, followed distantly by adjectives, then nouns, and finally verbs. However, in this task, we found that adverbs were the hardest word class to correctly substitute. Further analysis should be done to de­termine if this is due to the difficulty of the partic­ular words and sentences chosen in this task, the added complexity of performing the lexical substi­tution across two languages, or some independent factor such as the choice of thesaurus used to form the candidate set of substitutes.</p></subsection></section><section number="5" title="Conclusions"><p>We presented two systems that participated in the SemEval-2010 Cross-Lingual Lexical Substi­tution task. Both systems use a two-step process to obtain the lexical substitutes. Swat-E first finds English lexical substitutes in the English sentence and then translates these substitutes into Spanish. swat-S first translates the English sentences into Spanish and then finds Spanish lexical substitutes using these translations.</p><table caption="Table 3: Precision ofbestandootfor both systems, analyzed by part of speech." 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>swat-e</p></td><td class="cell"><p><i>best </i>P     Mode P</p></td><td class="cell"><p><i>oot</i></p><p>P      Mode P</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>adjective noun verb adverb</p></td><td class="cell"><p>25.94 50.67 22.34 40.44 18.62 41.46 15.68 33.78</p></td><td class="cell"><p>192.78 85.78 197.87 59.11 155.16 55.12 119.51 66.22</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>s wat-s</p><p>adjective noun verb adverb</p></td><td class="cell"><p>P     Mode P 21.70 40.00 24.77 45.78 13.58 27.80 10.46 22.97</p></td><td class="cell"><p>P      Mode P 126.41 86.67 107.85 82.22 69.04 71.71 80.26 66.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></tr></table></section><references><p>T. Brants and A. Franz. 2006. Web IT 5-gram, ver. 1. LDC2006T13, Linguistic Data Consortium, Philadelphia.</p><p>T. Brants and A. Franz. 2009. Web IT 5-gram, 10 Eu­ropean Languages, ver. 1. LDC2009T25, Linguistic Data Consortium, Philadelphia.</p><p>Claudio Giuliano, Alflo Gliozzo, and Carlo Strappa-rava. 2007. FBK-irst: Lexical Substitution Task Exploiting Domain and Syntagmatic Coherence. In</p><p><i>Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-2007).</i></p><p>Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondrej Bojar, Alexan­dra Constantin, and Evan Herbst. 2007. Moses: Open source toolkit for statistical machine transla­tion. In <i>Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics Com­panion Volume Proceedings of the Demo and Poster Sessions.</i></p><p>E. Loper and S. Bird. 2002. NLTK: The Natural Language Toolkit. In <i>Proceedings of the ACL-02 Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Compu­tational Linguistics.</i></p><p>D. McCarthy and R. Navigli. 2007. SemEval-2007 Task 10: English lexical substitution task. In <i>Pro­ceedings of SemEval-2007.</i></p><p>Rada Mihalcea, Ravi Sinha, and Diana McCarthy. 2010. Semeval-2010 Task 2: Cross-lingual lex­ical substitution. In <i>Proceedings of the 5th International Workshop on Semantic Evaluations (SemEval-2010).</i></p><p>Helmut Schmid. 1994. Probabilistic part-of-speech tagging using decision trees. In <i>International Con­ference on New Methods in Language Processing.</i></p></references></body></article>