<?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="427"/><title>UMCC-DLSI: Integrative Resource for Disambiguation Task</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 427^-32, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Fernandez Orquín" givenname="Antonio"><org  name="University of Alicante" country="Spain" city="Alicante"/></author><author surname="Gutiérrez Vázquez" givenname="Yoan"><org  name="University of Alicante" country="Spain" city="Alicante"/></author><author surname="Montoyo Guijarro" givenname="Andrés"><org  name="University of Alicante" country="Spain" city="Alicante"/></author><author surname="Vázquez Pérez" givenname="Sonia"><org  name="University of Alicante" country="Spain" city="Alicante"/></author></firstpageheader><frontmatter><p><b>UMCC-DLSI: Integrative resource for disambiguation task</b></p><p><b>Yoan Gutiérrez </b>and <b>Antonio Fernandez</b></p><p>DI, University of Matanzas Autopista a Varadero km 3<footnote anchor="1"/>/<footnote anchor="2"/>Matanzas, Cuba yoan.gutierrez,antonio.fernandez@umcc.cu</p><p><b>Andres Montoyo </b>and <b>Sonia Vazquez</b></p><p>DLSI, University of Alicante Carretera de San Vicente S/N Alicante, Spain montoyo,svazquez@dlsi.ua.es</p></frontmatter><abstract>This paper describes the UMCC-DLSI system in SemEval-2010 task number 17 (All-words Word Sense Disambiguation on Specific Domain). The main purpose of this work is to evaluate and compare our computational resource of WordNet's mappings using 3 different methods: Relevant Semantic Tree, Relevant Semantic Tree 2 and an Adaptation of k-clique's Technique. Our proposal is a non-supervised and knowledge-based system that uses Domains Ontology and SUMO. </abstract></header><body><section number="1" title="Introduction"><p>Ambiguity is the task of building up multiple alternative linguistic structures for a single input (Kozareva et al, 2007). Word Sense Disambiguation (WSD) is a key enabling-technology that automatically chooses the intended sense of a word in context. In this task, one of the most used lexical data base is WordNet (WN) (Fellbaum, 1998). WN is an online lexical reference system whose design is inspired by current psycholinguistic theories of human lexical memory. Due to the great popularity of WN in Natural Language Processing (NLP), several authors (Magnini and Cavaglia, 2000), (Niles and Pease, 2001), (Niles and Pease, 2003), (Valitutti, 2004) have proposed to incorporate to the semantic net of WN, some taxonomies that characterize, in one or several concepts, the senses of each word. In spite of the fact that there have been developed a lot of WordNet's mappings, there isn't one unique resource to integrate all of them in a single system approach.  To solve this need we have developed a resource that joins WN<footnote anchor="1"/>, the SUMO Ontology<footnote anchor="2"/>, WordNet Domains<footnote anchor="3"/>and WordNet Affect<footnote anchor="4"/>. Our purpose is to test the advantages of having all the resources together for the resolution of the WSD task.</p><p>The rest of the paper is organized as follows. In Section 2 we describe the architecture of the integrative resource. Our approach is shown in Section 3. Next section presents the obtained results and a discussion. And finally the conclusions in Section 5.</p></section><section number="2" title="Background and techniques"><subsection number="2.1" title="Architecture of the integrative resource"><p>Our integrative model takes WN 1.6 as nucleus and links to it the SUMO resource. Moreover, WordNet Domains 2.0 (WND) and WordNet Affect 1.1 (WNAffects) are also integrated but mapped instead to WN 2.0. From the model showed in Figure 1, a computational resource has been built in order to integrate the mappings above mentioned.</p><p>The model integrator's proposal provides a software that incorporates bookstores of programming classes, capable to navigate inside the semantic graph and to apply any type of possible algorithm to a net. The software architecture allows to update WN's version.</p><p>In order to maintain the compatibility with other resources mapped to WN, we have decided to use WN 1.6 version. However, the results can be offered in anyone of WN's versions.</p><footnote label="1"> http://www.cogsci.princeton.edu/ wn/ 2 http://suo.ieee.org  3 http://wndomains.fbk.eu/  4 http://wndomains.fbk.eu/wnaffect.html</footnote><page local="2" global="428"/><p><u>WN integrative model</u></p><p>Figure 1 : WordNet integrative model</p></subsection><subsection number="2.2" title="The k-clique's Technique"><p>Formally, a clique is the maximum number of actors who have all possible ties presented among themselves. A "Maximal complete sub-graph" is such a grouping, expanded to include as many actors as possible.</p><p>"A k-clique is a subset of vertices <i>C </i>such that, for every <i>i,j </i>e C, the distance <i>d(i,j</i><i>)k. </i>The 1-clique is identical to a clique, because the distance between the vertices is one edge. The 2-clique is the maximal complete sub-graph with a path length of one or two edges". (Cavique et al, 2009)</p></subsection></section><section number="3" title="The Proposal"><p>Our proposal consists in accomplishing three runs with different algorithms. Both first utilize the domain's vectors; the third method utilizes k-cliques' techniques.</p><p>This work is divided in several stages:</p><p>1. Pre-processing of the corpus (lemmatization with Freeling) (Atserias et al, 2006).</p><p>2. Context selection (For the first (3.1), and the third (3.3) run the context window was constituted by the sentence that contains the word to disambiguate; in the second run the context window was constituted by the sentence that contains the word to disambiguate, the previous sentence and the next one).</p><p>3. Obtaining the domain vector, this vector is used in first and the second runs (when the lemma of the words in the analyzed sentence is obtained, the integrative resource of WordNet's Mappings is used to get the respective senses from each lemma).</p><p>4. Obtaining the all resource vector: SUMO, Affects, and Domain resource. This is only for the third run (3.3).</p><p>5. Relevant Semantic Tree construction (Addition of concepts parents to the vectors. For the first (3.1) and second (3.2) runs only Domain resource is used; for the third (3.3) run all the resources are used).</p><p>6. Selection of the correct senses (the first and the second runs use the same way to do the selection; the third run is different. We make an exception: For the verb "be" we select the sense with the higher frequency according to Freeling.</p><subsection number="3.1" title="Relevant Semantic Tree"><p>With this proposal we measure how much a concept is correlated to the sentence, similar to Reuters Vector (Magnini et al, 2002), but with a different equation. This proposal has a partial similarity with the Conceptual Density (Agirre and Rigau, 1996) and DRelevant (Vazquez et al., 2004) to get the concepts from a hierarchy that they associate with the sentence.</p><p>In order to determine the Association Ratio (RA) of a domain in relation to the sentence, the Equation 1 is used.</p><doubt alpha="61.1" length="18" tooSmall="False" monospace="0.0">RA{D,f) =YJRA{D,fi</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(1)</doubt><doubt alpha="83.3" length="6" tooSmall="False" monospace="0.0">where:</doubt><p><i>RA(D,w) = P(D,w) * </i>log.</p><doubt alpha="50.0" length="6" tooSmall="False" monospace="0.0">P(D,w)</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(2)</doubt><p>/: is a set of words <i>w.</i></p><p><i>fi. </i>is a i-th word of the phrase /.</p><p><i>P(D, w): </i>is joint probability distribution.</p><p><i>P{D): </i>is marginal probability.</p><p>From now, vectors are created using the Senseval-2's corpus. Next, we show an example:</p><p>For the phrase: "But it is unfair to dump on teachers as distinct from the educational establishment".</p><p>By means of the process <i>Pres-processing</i> analyzed in previous stage 1 we get the lemma and</p><p>the following vector. 428<page local="3" global="429"/></p><p>Phrase [unfair; dump; teacher, distinct, educational; establishment]</p><p>Each lemma is looked for in WordNet's integrative resource of mappings and it is correlated with concepts of WND.</p><p>Table 1 : Initial Domain Vector</p><p>After obtaining the Initial Domain Vector we apply the Equation 3 in order to build the Relevant Semantic Tree related to the phrase.</p><doubt alpha="52.2" length="23" tooSmall="False" monospace="0.0">DN(CI,Df)=RAJZI-»«%M(3)</doubt><p>Where <i>DN:</i><i> </i>is a normalized distance <i>CP. </i>is the Initial Concept which you want to add the ancestors.</p><p><i>Df: </i>is Parent Domain.</p><p><i>RAjCI: </i>is a Association Ratio of the child Concept.</p><p><i>TD:</i><i> </i>is Depth of the hierarchic tree of the resource to use.</p><p><i>MP: </i>is Minimal Path.</p><p>Applying the Equation 3 the algorithm to decide which parent domain will be added to the vector is shown here:</p><doubt alpha="38.9" length="18" tooSmall="False" monospace="0.0">i£(DN(CI,Df)&gt; 0) {</doubt><p>if ( <i>Df </i>not exist)</p><p><i>Df </i>is added to the vector with <i>DN</i><i> </i>value; else <i>Df </i>value = <i>Df </i>value + <i>DN;</i></p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">}</doubt><p>As a result the Table 2 is obtained.</p><p>This vector represents the Domain tree associated to the phrase.</p><p>After the Relevant Semantic Tree is obtained, the Domain Factotum is eliminated from the tree. Due to the large amount of WordNet synsets, that do not belong to a specific domain, but rather they can appear in almost all of them, the Factotum domain has been created. It basically includes two types of synsets: Generic synsets, which are hard to classify in a particular domain; and Stop Senses synsets which appear frequently in different contexts, such as numbers, week days, colors, etc. (Magnini and Cavaglia, 2000), (Magnini et al, 2002). Words that contain this synsets are frequently in the phrases, therefore the senses associated to this domain are not selected.</p><figure caption="Figure 2: Relevant semantic tree"></figure><p>After processing the patterns that characterize the sentence, the following stage is to determine the correct senses, so that the next steps ensue:</p><p>1. Senses that do not coincide with the grammatical category of Freeling are removed.</p><table caption="Table 2: Final Domain Vector" 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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Vector</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>Domains</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>1.63</p></td><td class="cell"><p>Social-Science</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.9</p></td><td class="cell"><p>Administration</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.9</p></td><td class="cell"><p>Pedagogy</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.8</p></td><td class="cell"><p>RootDomain</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Psychoanalysis</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Economy</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Quality</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Politics</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Buildings</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Commerce</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Environment</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.11</p></td><td class="cell"><p>Factotum</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.11</p></td><td class="cell"><p>Psychology</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.11</p></td><td class="cell"><p>Architecture</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.11</p></td><td class="cell"><p>Pure_Science</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></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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Vector</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>Domains</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.9</p></td><td class="cell"><p>Pedagogy</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.9</p></td><td class="cell"><p>Administration</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Buildings</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Politics</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Environment</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Commerce</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Quality</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Psychoanalysis</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.36</p></td><td class="cell"><p>Economy</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></tr></table><page local="4" global="430"/><p>2. For each word to disambiguate all candidate senses are obtained. Of each sense the relevant vector are obtained using the Equation 4, and according to the previous Equation 3 parent concepts are added.</p><doubt alpha="33.3" length="27" tooSmall="False" monospace="0.0">RA(D,s) = P(D,s)*\og2-^-(4)</doubt><p>where <i>s: </i>is a sense of word.</p><p><i>P(D,s): </i>is joint probability distribution between Domain concept <i>D </i>and the sense <i>s.</i></p><p><i>P{D): </i>is marginal probability of the Domain concept.</p><p>3. The one that accumulates the bigger value of relevance is assigned as correct sense. The following process is applied:</p><p>For each coincidence of the elements in the senses' domain vector with the domain vector of the sentence, the RA value of the analyzed elements is accumulated. The process is described in the Equation 5.</p><p>where <i>AC: </i>The <i>RA </i>value accumulated for the analyzed elements.</p><p><i>VRA: </i>Vector of relevant domains of the sentence with the format: <i>VRA </i>[domain — value <i>RA].</i></p><p><i>Vs: </i>Vector of relevant domain of the sense with the format: <i>Vs </i>[domain].</p><p><i>Vsk'. </i>Is a k-th domain of the vector <i>Vs.</i></p><p><i>VRA[Vsh\: </i>Represents the value of <i>RA </i>assigned to the domain <i>Vsk </i>for the value <i>VRA.</i><i></i></p><p>The <i>J2i=i </i><i>VRAi </i>term normalizes the result.</p></subsection><subsection number="3.2" title="Relevant Semantic Tree 2"><p>This run is the same as the first one with a little difference, the context window is constituted by the sentence that contains the word to disambiguate, the previous sentence and the next one.</p></subsection><subsection number="3.3" title="Adaptation of k-clique's technique to the WSD"><p>They are applied, of the section 3, the steps from the 1 to the 5, where the semantic trees of concepts are obtained.</p><p>Then they are already obtained for all the words of the context, all the senses discriminated according to Freeling (Atserias et al., 2006).</p><p>Then a sentence's net of knowledge is built by means of minimal paths among each sense and each concept at trees. Next the k-clique's technique is applied to the net of knowledge to obtain cohesive subsets of nodes.</p><p>To obtain the correct sense of each word it is looked, as proposed sense, the sense belonging to the subset containing more quantities of nodes and if it has more than a sense for the same word, the more frequent sense is chosen according to Freeling.</p></subsection></section><section number="4" title="Results and Discussion"><p>The conducted experiments measure the influence of the aforementioned resources in the disambiguation task. We have evaluated them individually and as a whole. In the Table 3 it is represented each one of the inclusions and combinations experimented with the Relevant Semantic Tree method.</p><p>As it can be observed, in the evaluation for specific domain corpus the best results are reached when only domain resource is used.   But this is not a conclusion about the resources inclusion because the use of this method for global domain, for example with the task English All words from adding all the resources showed good results. This is due to the fact that the global domain includes information of different contexts, exactly what</p><doubt alpha="66.0" length="47" tooSmall="False" monospace="0.0">Senseval-2 (Agirre et al, 2010), the experiment</doubt><p>is representing in the mentioned resources. For 430 this reason, in the experiment with global domain and the inclusion of all the resource obtained better results than using this method with specific domain, 42% of recall and 45% of precision (Gutierrez, 2010).<page local="5" global="431"/></p><table caption="Table 3: Evaluation of integrated resources" 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><b>Resources</b></p></td><td class="cell"><p><b>Precision</b></p></td><td class="cell"><p><b>Recall</b></p></td><td class="cell"><p><b>Attempted</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>WNAffect</b></p></td><td class="cell"><p>0.242</p></td><td class="cell"><p>0.237</p></td><td class="cell"><p>97.78%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SUMO</b></p></td><td class="cell"><p>0.267</p></td><td class="cell"><p>0.261</p></td><td class="cell"><p>98.5%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>WND</b></p></td><td class="cell"><p>0.328</p></td><td class="cell"><p>0.322</p></td><td class="cell"><p>98.14%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>WND&amp;</b></p></td><td class="cell"><p>0.308</p></td><td class="cell"><p>0.301</p></td><td class="cell"><p>97.78%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SUMO</b></p></td><td class="cell"><p></p></td><td class="cell"><p></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>WND &amp;</b></p></td><td class="cell"><p>0.308</p></td><td class="cell"><p>0.301</p></td><td class="cell"><p>97.78%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SUMO &amp;</b></p></td><td class="cell"><p></p></td><td class="cell"><p></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>WNAffect</b></p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p></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><p>For example, with the k-clique's technique, utilizing the English All word task from Senseval-2's corpus, the results for the test with global dominion were: with single domain inclusion 40 % of precision and recall; but with the three resources 41.7 % for both measures.</p><p>Table 4 shows the obtained results for the test data set. The average performance of our system is 32% and we ranked on 27-th position from 27 participating systems. Although, we have used different sources of information and various approximations, in the future we have to surmount a number of obstacles.</p><p>One of the limitations comes from the usage of the POS-tagger Freeling which introduces some errors in the grammatical discrimination. Representing a loss of 3.7% in the precision of our system.</p><p>The base of knowledge utilized in the task was WordNet 1.6; but the competition demanded the results with WordNet 3.0. In order to achieve this we utilized mappings among versions where 119 of 1398 resulting senses emitted by Semeval-2 were did not found. This represents an 8.5%.</p><p>In our proposal, the sense belonging to the Factotum Domain was eliminated, what disabled that the senses linked to this domain went candidates to be recovered. 777 senses of 1398 annotated like correct for Semeval-2 belong to domain Factotum, what represents that the 66% were not recovered by our system. Considering the senses that are not correlated to Factotum, that is, that correlate to another domains, we are speaking about 621 senses to define; The system would emit results of a 72,4%. Senses selected correctly were 450, representing a 32%. However, 189 kept on like second candidates to be elected. This represents a 13.5%. If a technique of more precise decision takes effect, the results of the system could be increased largely.</p></section><section number="5" title="Conclusion and future works"><p>For our participation in the Semeval-2 task 17 (All-words Word Sense Disambiguation on Specific Domain), we presented three methods for disambiguation approach which uses an <b>Methods  </b>I <b>Precision </b>I <b>Recall </b>I <b>Attempted</b> integrative resource of WordNet mappings. We conducted an experimental study with the trail data set, according to which the RelevantSemantic Tree reaches the best performance. Our current approach can be improved with the incorporation of more granularities in the hierarchy of WordNet Domains. Because it was demonstrated that to define correct senses associated to specific domains an improvement of 72.4% is obtained. At this moment, only domain information is used in our first and second method. Besides was demonstrated for specific domains, the inclusion of several resources worsened the results with the first and second proposal method, the third one has been not experimented yet. Despite the fact that we have knowledge of SUMO, WordNet-Affect and WordNet Domain in our third method we still not obtain a relevant result.</p><p>It would be convenient to enrich our resource with other resources like Frame-Net, Concept-Net or others with the objective of characterizing even more the senses of the words.</p></section><section title="Acknowledgments"><p>This paper has been supported partially by Ministerio de Ciencia e Innovation - Spanish Government (grant no. TIN2009-13391-C04-01), and Conselleria d'Educacio - Generalitat Valenciana (grant no. PROMETEO/2009/119 and ACOMP/2010/288).</p><table caption="Table 4: Evaluation results" 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><b>Relevant Domains Tree</b></p></td><td class="cell"><p>0.328</p></td><td class="cell"><p>0.322</p></td><td class="cell"><p>98.14%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Relevant Semantic Tree 2</b></p></td><td class="cell"><p>0.321</p></td><td class="cell"><p>0.315</p></td><td class="cell"><p>98.14%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Relevant Cliques</b></p></td><td class="cell"><p>0.312</p></td><td class="cell"><p>0.303</p></td><td class="cell"><p>97.35%</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 disambiguation using conceptual density. In <i>Proceedings of the 16th International Conference on Computational Linguistic (COLING'96), </i>Copenhagen, Denmark.</p><p>Eneko Agirre, Oier Lopez de Lacalle, Christiane Fellbaum, Shu-kai Hsieh, Maurizio Tesconi, Monica<page local="6" global="432"/></p><p>Monachini, Piek Vossen, and Roxanne Segers. 2010. Semeval-2010 task 17: All-words word sense disambiguation on a specific domain. In <i>Proceedings of the 5th International Workshop on Semantic Evaluations (SemEval-2010), Association for Computational Linguistics.</i><i></i></p><p>Jordi Atserias, Bernardino Casas, Elisabet Comelles, Meritxell Gonzalez, Lluis Padro, and Muntsa Padro. 2006. Freeling 1.3: Syntactic and semantic services in an open-source nlp library. In <i>Proceedings of the fifth international conference on Language Resources and Evaluation (LREC 2006), ELRA.</i></p><p>Luis Cavique, Armando B. Mendes, and Jorge M. Santos. 2009. An algorithm to discover the k-clique cover in networks. In <i>EPIA '09: Proceedings of the 14th Portuguese Conference on Artificial Intelligence, </i>pages 363-373, Berlin, Heidelberg. Springer-Verlag.</p><p>Christiane Fellbaum. 1998. <i>WordNet: An Electronic Lexical Database. </i>The MIT Press.</p><p>Yoan Gutierrez. 2010. Resolution de ambiguedad semantica mediante el uso de vectores de conceptos relevantes.</p><p>Zornitsa Kozareva, Sonia Vazquez, and Andres Montoyo. 2007. Ua-zsa: Web page clustering on the basis of name disambiguation. In <i>Semeval I. 4th International Wordshop on Semantic Evaluations.</i></p><p>Bernardo Magnini and Gabriela Cavaglia. 2000. Integrating subject field codes into wordnet. In <i>Proceedings of Third International Conference on Language Resources and Evaluation (LREC-2000)</i>.</p><p>Bernardo Magnini, Carlo Strapparava, Giovanni Pezzulo, and Alfio Gliozzo. 2002. Comparing ontology-based and corpus-based domain annotations in wordnet. In <i>Proceedings of the First International WordNet Conference, </i>pages 146-154.</p><p>Ian Niles and Adam Pease. 2001. Towards a standard upper ontology. In <i>FOIS, </i>pages 2-9.</p><p>Ian Niles and Adam Pease. 2003. Linking lexicons and ontologies: Mapping wordnet to the suggested upper merged ontology. In <i>IKE, </i>pages 412—416.</p><p>Ro Valitutti.   2004.   Wordnet-affect: an affective extension of wordnet. In <i>Proceedings </i><i>ofthe</i><i> 4th International Conference on Language Resources and Evaluation, </i>pages 1083-1086.</p><p>Sonia Vazquez, Andres Montoyo, and German Rigau. 2004. Using relevant domains resource for word sense disambiguation. In <i>IC-AI, </i>pages 784-789.</p></references></body></article>