<?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="434"/><title>UPV-WSD : Combining different WSD Methods by means of Fuzzy Borda Voting</title><pubinfo>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007),pages 434-437, Prague, June 2007. ©2007 Association for Computational Linguistics</pubinfo><author surname="Buscaldi" givenname="Davide"><org  name="Universidad Politecnica de Valencia" country="Spain" city="Valencia"/></author><author surname="Rosso" givenname="Paolo"><org  name="Universidad Politecnica de Valencia" country="Spain" city="Valencia"/></author></firstpageheader><frontmatter><p><b>UPV-WSD : Combining different WSD Methods by means of Fuzzy Borda Voting</b></p><p><b>Davide Buscaldi </b>and <b>Paolo Rosso</b></p><p>DSIC, Dpto. Sistemas Informaticos y Computation Universidad Politecnica de Valencia Valencia, Spain {dbuscaldi,prosso}@dsic.upv.es</p></frontmatter><abstract>This paper describes the WSD system devel­oped for our participation to the SemEval-1. It combines various methods by means of a fuzzy Borda voting. The fuzzy Borda vote-counting scheme is one of the best known methods in the field of collective decision making. In our system the different disam­biguation methods are considered as experts that give a preference ranking for the senses a word can be assigned. Then the prefer­ences are evaluated using the fuzzy Borda scheme in order to select the best sense. The methods we considered are the sense fre­quency probability calculated over SemCor, the Conceptual Density calculated over both hyperonyms and meronyms hyerarchies in WordNet, the extended Lesk by Banerjee and Pedersen, and finally a method based on WordNet domains. </abstract></header><body><section number="1" title="Introduction"><p>One of the lessons learned from our previous experi­ence at Senseval-3<footnote anchor="1"/> (Buscaldi et al., 2004; Vazquez et al., 2004) is that the integration of different sys­tems usually works better than a standalone system. In our opinion this reflects the reality where humans do not apply always the same rule in order to disam-biguate the same ambigue word; for instance, if we consider the sentences "He <i>hit a home run" </i>and <i>"The thermometer hit 100 degrees'", </i>in the first case the sport domain helps in determining the right sense for <i>hit, </i>whereas in the latter the disambiguation is car­ried out mostly depending on the fact that the subject of the sentence is an object.</p><footnote label="1"> http://www.senseval.org</footnote><p>The combination of distinct methods represents itself a major problem. If the methods return dif­ferent answers, how can we select the best one? In this sense the available choices are the following:</p><p><i>• Rule-based </i>selection: a set of rules that can be both hand-made or automatically learned from examples;</p><p><i>• Probability-based: </i>the output of the methods is normalized in the range [0,1] and is considered as a probability. Then the values are multiplied in order to obtain the sense with a maximum probability.</p><p><i>• Vote-based: </i>the output of the methods is con­sidered as a weighted vote. Then a voting scheme is used in order to obtain the most voted sense.</p><p>In our previous participation with the R2D2 project (Vazquez et al., 2004) the selection was rule-based, with hand-made rules that attempted to take into ac­count the reliability of the various method. We sub­sequently attempted to learn automatically the rules, but the results of these experiments did not allow to determine clearly which method was to be used in each context.</p><p>Working with probabilities can be problematic due to the null probabilities that make necessary the adoption of smoothing techniques. Therefore, we opted for a voting scheme, in this case the fuzzy Borda (Nurmi, 2001; Garcia Lapresta and Martinez<page local="2" global="435"/></p><p>Panero, 2002), one of the best known methods in the field of collective decision making. With this scheme the disambiguation methods are considered as experts providing a preference ranking over the sense of the word.</p><p>The methods we choose as experts are the sense probability calculated over SemCor, the Conceptual Density algorithm by (Rosso et al., 2003), the ex­tended Lesk by (Banerjee and Pedersen, 2002), and an algorithm that takes into account the domains of the word to be disambiguated and the context words. In the following sections we describe in detail the fuzzy Borda scheme and each WSD expert.</p></section><section number="2" title="The Fuzzy Borda voting scheme"><p>The original Borda vote-counting scheme was in­troduced in 1770 by Jean Charles de Borda, and adopted by the French Academy of Sciences with the purpose of selecting its members. In the classical Borda count each expert gives a mark to each alter­native, according to the number ofalternatives worse than it. The fuzzy variant (Nurmi, 2001; Garcia Lapresta and Martinez Panero, 2002) is a natural ex­tension that allows the experts to show numerically how much some alternatives are preferred to the oth­ers, evaluating their preference intensities from 0 to 1.</p><p>Let R<footnote anchor="1"/> <i>,R<footnote anchor="2"/>,...,Rm</i><i> </i>be the fuzzy prefer­ence relations of m experts over n alternatives <i>x1,x2,...,xn.</i><i> </i>For each expert k we obtain a matrix of preference intensities:</p><p>where each r<b>j </b>= <i>ß</i><i>Rk </i>(x<b>i </b><i>,X</i><i>j </i>), with <i>/j</i><i>,Rk </i>: <i>X</i><i> </i>x X — [0,1] being the membership function of Rk. The number r<b>j </b>G [0,1] is considered as the degree of confidence with which the expert k prefers xi to <i>x</i><i>j</i>. The final value assigned by the expert k to each al­ternative <i>x</i><i>i </i>is:</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">n</doubt><doubt alpha="53.3" length="15" tooSmall="False" monospace="0.0">rk(xi)=]Trkj(1)</doubt><doubt alpha="27.3" length="11" tooSmall="False" monospace="0.0">j=1,rj &gt;0.5</doubt><p>which coincides with the sum of the entries greater than 0.5 in the i-th row in the preference matrix. The threshold 0.5 ensure the relation Rkto be an ordinary preference relation (Garcia Lapresta and Martinez</p><p>Panero, 2002).</p><p>Therefore, the definitive fuzzy Borda count for an alternative x<i>i </i>is obtained as the sum of the values assigned by each expert:</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">m</doubt><doubt alpha="38.1" length="21" tooSmall="False" monospace="0.0">r(xi) =53rk(xi)(2)k=1</doubt><p>In order to fill the preference matrix with the correct confidence values, the output weights <i>w1 </i><i>,w2,...</i><i> ,wn </i>of each expert k are transformed to fuzzy confidence values by means of the following transformation:</p><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">kwi</doubt><doubt alpha="83.3" length="6" tooSmall="False" monospace="0.0">JWi+Wj</doubt><p>An example of how fuzzy Borda is used to combine the votes in order to obtain the right sense of the target word is shown in Section 4.</p></section><section number="3" title="WSD Experts"><p>We considered five experts in order to carry out the disambiguation process. Sense probability and the extended lesk were available for every word, while the Conceptual Density was calculated only for nouns. Therefore, all the experts were available only for the nouns. For each expert different con­texts were taken into account, depending on the spe­cific characteristics of each expert.</p><subsection number="3.1" title="Sense Probability"><p>This expert is the simplest one: its votes are calcu­lated using only the frequency count in SemCor of the WordNet senses of the word. The transformation of the frequency counts to the preference ranking is done according to Formula (3). Zero frequency are normalized to 1 .</p></subsection><subsection number="3.2" title="Conceptual Density"><p><i>Conceptual Density </i>(CD) was originally introduced by (Agirre and Rigau, 1996). It is computed on WordNet subhierarchies, determined by the <i>hyper-nymy </i>(or <i>is-a) </i>relationship. Our formulation (Rosso et al., 2003) of the Conceptual Density of a WordNet subhierarchy <i>s </i>is:</p><doubt alpha="53.8" length="13" tooSmall="False" monospace="0.0">CD(m,f,n)= ma</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(4)</doubt><table class="main" frame="box" rules="all" border="0" 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><b>k </b><i>k</i></p><p><b>r21</b></p></td><td class="cell"><p><i>k k</i></p><p><i>r 22</i></p></td><td class="cell"><p><i>k</i></p><p><i>... r1n</i></p><p><i>k</i></p><p><i>. . . r2n</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>V</b></p></td><td class="cell"><p><i>krn1</i></p></td><td class="cell"><p><i>krn2</i></p></td><td class="cell"><p><i>k</i></p><p><i>. . . r</i></p><p><i>nn</i></p></td><td class="cell"><p><i>1</i></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><page local="3" global="436"/><p>Where m are the <i>relevant </i>synsets in the subhierar-chy, n is the total number of synsets in the subhierar-chy.The relevant synsets are both the synsets of the word to be disambiguated and those of the context words.</p><p>The WSD system based on this formula par­ticipated at the Senseval-3 competition as the CIAOSENSO system (Buscaldi et al., 2004), ob­taining 75.3% in precision over nouns in the all-words task (baseline: 70.1%). These results were obtained with a context window of two nouns, the one preceding and the one following the word. In Senseval-3 the WSD system took also into account the frequency of senses depending on their rank. In SemEval-1 we do not, because of the presence of the Sense Probability expert.</p><p>The CD-based expert uses a context oftwo nouns for the disambiguation process too. The weights from Formula (4) are used for computing the fuzzy confidence values that are used to fill the preference matrix after they are transformed according to For­mula (3).</p><p>A second CD-based expert exploits the <i>holonymy, </i>or <i>part-of </i>relationship instead of <i>hyperonymy. </i>This expert uses as context all the nouns in the sentence of the word to be disambiguated.</p></subsection><subsection number="3.3" title="Extended Lesk"><p>This expert is based on the algorithm by (Banerjee and Pedersen, 2002), a WordNet-enhanced version of the well-known dictionary-based algorithm pro­posed by (Lesk, 1986). The original Lesk was based on the comparison of the gloss of the word to be dis-ambiguated with the context words and their glosses. This enhancement consists in taking into account also the glosses of concepts related to the word to be disambiguated by means of various WordNet re­lationships. Then similarity between a sense of the word and the context is calculated by means of <i>over­laps. </i>The word is assigned the sense obtaining the best overlap match with the glosses of the context words and their related synsets.</p><p>The weights used as input for Formula (3) are the similarity values between the senses of the world and the context words. The context for this ex­pert consists of 4 WordNet words (disregarding their Part-Of-Speech) located in the same sentence of the word to be disambiguated, i.e., words with POS noun, verb, adjective or adverb that can be found in</p><p>WordNet.</p></subsection><subsection number="3.4" title="WordNet Domains"><p>This expert uses WordNet Domains (Magnini and Cavaglia, 2000) in order to provide the system with domain-awareness. All WordNet words in the same sentence of the target word are used as context. The weight for each sense is obtained by counting the number of times the same domain of the sense ap­pears in the context (all senses of context words are considered). We decided to not take into account the "factotum" domain.</p></subsection></section><section number="4" title="Example"><p>In this example we will consider only the sense probability and extended Lesk experts for simplic­ity.</p><p>Let us consider the following phrase: <i>"And he has kept mum on how his decision might affect a bid for United Airlines , which includes a big stake by British Airways PLC." </i>with <i>affect </i>as target word. We can observe that in WordNet the verb <i>affect </i>has 5 senses. The sense count values are 43 for the first sense, 11 for the second, 4 for both the third and the fourth one, and 0 for the last one. We decided to nor­malize the cases with 0 occurrences to 1. After ap­plying the transformation (3) to the sense counts, we obtain the following preference matrix for the sense probability expert:</p><p>sense probability expert are 3.60 for <b>affect (1)</b>, 2.38 for <b>affect(2), </b>0.8 for <b>affect(3) </b>and <b>affect(4), </b>and 0 for <b>affect(5), </b>obtained from the sum of the rows where the value is greater than 0.5.</p><p>The extended Lesk expert calculates the following similarity scores for thesenses of<i>affect, </i>with context words <i>decision, might, bid </i>and <i>include: </i>respectively 107, 70, 35 , 63 and 71 for senses 1 to 5. After apply­ing the transformation (3) to the weights, we obtain the preference matrix for this expert:<page local="4" global="437"/></p><table class="main" frame="box" rules="all" border="0" 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></p></td><td class="cell"><p>0.5</p></td><td class="cell"><p>0.80 0.91</p></td><td class="cell"><p>0.91</p></td><td class="cell"><p>0.98</p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>0.20</p></td><td class="cell"><p>0.5 0.73</p></td><td class="cell"><p>0.73</p></td><td class="cell"><p>0.92</p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>0.09</p></td><td class="cell"><p>0.27 0.5</p></td><td class="cell"><p>0.5</p></td><td class="cell"><p>0.8</p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>0.09</p></td><td class="cell"><p>0.27 0.5</p></td><td class="cell"><p>0.5</p></td><td class="cell"><p>0.8</p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>^ 0.02</p></td><td class="cell"><p>0.08 0.2</p></td><td class="cell"><p>0.2</p></td><td class="cell"><p>0.5</p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Therefore, the</p></td><td class="cell"><p>final fuzzy</p></td><td class="cell"><p>Borda</p></td><td class="cell"><p>counts by the</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><p>In this case the final fuzzy Borda counts are 2.58 for the first sense, 1.2 for sense 2, 0 for sense 3, 0.64 and 1 . 71 for senses 4 and 5 respectively.</p><p>Finally, the sum of Borda counts of every expert for each sense (see Table 4) are used to disambiguate the word.</p><table caption="Table 1: Borda Count for the verbaffectin the ex­ample phrase."></table></section><section number="5" title="Results"><p>The system was not tested before SemEval. Our par­ticipation was limited to the All-Word and Coarse­Grained tasks (without the sense inventory provided by the organizers). The results are compared to the best system and the MFS (Most Frequent Sense) baseline. We calculated also the partial results over nouns in the all word task, obtaining that the MFS baseline in this case is about 0. 633, whereas our sys­tem obtains 0. 520.</p><p>Table 2: Recall obtained by our system (upv-wsd) in each task we participated in, compared with the most frequent sense baseline and the best system in the task.</p></section><section number="6" title="Conclusions"><p>The combination of different systems allowed us to attain higher recall than with our previous system used in Senseval-3. However, overall results were not as good as expected. Partial results over the nouns show that the CD expert did not perform as in the Senseval-3 and that the CD formula needs to include sense frequency ranking in order to achieve a good performance. As a further work we plan to add a weight reflecting the reliability of each expert.</p></section><section title="Acknowledgements"><p>We would like to thank the TIN2006-15265-C06-04 research project for partially supporting this work. We would also like to thank Prof. Eugene Levner of the Holon Institute of Technology for inspiring us to use the fuzzy Borda voting scheme.</p><table class="main" frame="box" rules="all" border="0" 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>0.5</p></td><td class="cell"><p>0.60</p></td><td class="cell"><p>0.75</p></td><td class="cell"><p>0.63</p></td><td class="cell"><p>0.60</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.40</p></td><td class="cell"><p>0.5</p></td><td class="cell"><p>0.67</p></td><td class="cell"><p>0.53</p></td><td class="cell"><p>0.49</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.25</p></td><td class="cell"><p>0.33</p></td><td class="cell"><p>0.5</p></td><td class="cell"><p>0.36</p></td><td class="cell"><p>0.33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.37</p></td><td class="cell"><p>0.47</p></td><td class="cell"><p>0.64</p></td><td class="cell"><p>0.5</p></td><td class="cell"><p>0.47</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.40</p></td><td class="cell"><p>0.51</p></td><td class="cell"><p>0.67</p></td><td class="cell"><p>0.53</p></td><td class="cell"><p>0.5</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 caption="Table 1: Borda Count for the verbaffectin the example phrase." 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>sense no:</p></td><td class="cell"><p>1</p></td><td class="cell"><p>2</p></td><td class="cell"><p>3</p></td><td class="cell"><p>4</p></td><td class="cell"><p>5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>expert 1</p></td><td class="cell"><p>3.60</p></td><td class="cell"><p>2.38</p></td><td class="cell"><p>0.80</p></td><td class="cell"><p>0.80</p></td><td class="cell"><p>0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>expert 2</p></td><td class="cell"><p>2.58</p></td><td class="cell"><p>1.20</p></td><td class="cell"><p>0</p></td><td class="cell"><p>0.64</p></td><td class="cell"><p>1.71</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>total:</p></td><td class="cell"><p>6.18</p></td><td class="cell"><p>3.58</p></td><td class="cell"><p>0.80</p></td><td class="cell"><p>1.44</p></td><td class="cell"><p>1.71</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><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></tr><tr class="row"><td class="cell"></td><td class="cell"><p>task</p></td><td class="cell"><p>upv-wsd</p></td><td class="cell"><p>MF S</p></td><td class="cell"><p>best system</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>coarse-grained awt</p></td><td class="cell"><p>0.786 0.420</p></td><td class="cell"><p>0.789 0.471</p></td><td class="cell"><p>0.832 0.537</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></tr></table></section><references><p>Eneko Agirre and German Rigau. 1996. Word sense dis­ambiguation using conceptual density. In <i>COLING, </i>pages 16-22.</p><p>Satanjeev Banerjee and Ted Pedersen. 2002. An adapted lesk algorithm for word sense disambiguation using wordnet. In <i>Proceedings ofCICLing 2002, </i>pages 136— 145, London, UK. Springer-Verlag.</p><p>Davide Buscaldi, Paolo Rosso, and Francesco Masulli.</p><p>2004. The upv-unige-CIAOSENSO WSD System.</p><p>In <i>Proc. of Senseval-3 Workshop, </i>Barcelona (Spain), July. ACL.</p><p>Jose Luis Garcia Lapresta and Miguel Martinez Panero. 2002. Borda Count Versus Approval Voting: A Fuzzy Approach. <i>Public Choice, </i>112(1-2):167—184.</p><p>Michael Lesk. 1986. Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone. In <i>Proc. ofSIGDOC '86, </i>pages 24—26.</p><p>Bernardo Magnini and Gabriela Cavaglia. 2000. Inte­grating Subject Field Codes into WordNet. In <i>Proc. of the 2ndLREC Conference, </i>pages 1413—1418, Athens, Greece.</p><p>Hannu Nurmi. 2001. Resolving Group Choice Para­doxes Using Probabilistic and Fuzzy Concepts. <i>Group Decision and Negotiation, </i>10(2):177—199.</p><p>Paolo Rosso, Francesco Masulli, Davide Buscaldi, Fer-ran Pla, and Antonio Molina. 2003. Automatic noun sense disambiguation.   In <i>Proc. of CICLing 2003,</i> pages 273—276.</p><p>Sonia Vazquez, Rafael Romero, Armando Suarez, An­dres Montoyo, Manuel Garcia, M. Teresa Martin, M. Angel Garcia, Alfonso Urena, Davide Buscaldi, Paolo Rosso, Antonio Molina, FerranPla, and Encarna <i>Proc.</i><i> ofSenseval-3 Workshop.</i></p><doubt alpha="60.9" length="46" tooSmall="False" monospace="0.0">Segarra. 2004. The R2D2 Team at SENSEVAL-3. In</doubt></references></body></article>