<?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="382"/><title>UCM3: Classification of Semantic Relations between Nominals using Sequential Minimal Optimization</title><pubinfo>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007),pages 382-385, Prague, June 2007. ©2007 Association for Computational Linguistics</pubinfo><author surname="Segura Bedmar" givenname="Isabel"><org  name="Ghent University" country="Belgium" city="Ghent"/></author><author surname="Samy" givenname="Doaa"><org  name="Ghent University" country="Belgium" city="Ghent"/></author><author surname="Martinez" givenname="Jose L."><org  name="Ghent University" country="Belgium" city="Ghent"/></author></firstpageheader><frontmatter><p><b>UC3M: Classification of Semantic Relations between Nominals using</b></p><p><b>Sequential Minimal Optimization</b></p><p><b>Isabel Segura Bedmar</b></p><p>Computer Science Department University Carlos III of Madrid</p><p>isegura@inf.uc3m.es</p><p><b>Doaa Samy</b></p><p>Computer Science Department University Carlos III of Madrid dsamy@inf.uc3m.es</p><p><b>Jose L. Martinez</b></p><p>jlmartinez@inf.uc3m.es</p></frontmatter><abstract>This paper presents a method for auto­matic classification of semantic relations between nominals using Sequential Minimal Optimization. We participated in the four categories of SEMEVAL task 4 (A: No Query, No Wordnet; B: Word-Net, No Query; C: Query, No WordNet; D: WordNet and Query) and for all train­ing datasets. Best scores were achieved in category B using a set of feature vec­tors including lexical file numbers of nominals obtained from WordNet and a new feature <i>WordNet Vector </i>designed for the task<footnote anchor="1"/>. </abstract></header><body><section number="1" title="Introduction"><p>The survey of the state-of-art reveals an increas­ing interest in automatically discovering the un­derlying semantics in natural language. In this interdisciplinary field, the growing interest is justified by the number of applications which can directly benefit from introducing semantic information. Question Answering, Information Retrieval and Text Summarization are examples of these applications (Turney and Littman, 2005; Girju et al., 2005).</p><p>In the present work and for the purpose of the SEMEVAL task 4, our scope is limited to the semantic relationships between nominals. By this definition, we understand it is the process of discovering the underlying relations between two concepts expressed by two nominals.</p><footnote label="1">This work has been partially supported by the Re­gional Government of Madrid Ander the Research Network MAVIR (S-0505/TIC-0267)</footnote><p>Within the framework of SEMEVAL, nomi-nals can occur either on the phrase, clause or the sentence level. This fact constitutes the major challenge in this task since most of the previous research limited their approaches to certain types of nominals mainly the "compound nomi-nals"(Girju et al. 2005).</p><p>The paper is divided as follows; section 2 is a brief introduction to SMO used as the classifier for the task. Section 3 is dedicated to the de­scription of the set of features applied in our ex­periments. In section 4, we discuss the experi­ment's results compared to the baselines of the SEMEVAL task and the top scores. Finally, we summarize our approach, pointing out conclu­sions and future directions of our work.</p></section><section number="2" title="Sequential Minimal Optimization"><p>We decided to use Support Vector Machine (SVM), as one of the most successful Machine Learning techniques, achieving the best per­formances for many classification tasks. Algo­rithm performance and time efficiency are key issues in our task, considering that our final goal is to apply this classification in a Question An­swering System.</p><p>Sequential Minimal Optimization (SMO) is a fast method to train SVM. SMO breaks the large quadratic programming (QP) optimization prob­lem needed to be resolved in SVM into a series of smallest possible QP problems. These small QP problems are analytically solved, avoiding, in this way, a time-consuming numerical QP optimization as an inner loop. We used Weka (Witten and Frank, 2005) an implementation of the SMO (Platt, 1998).</p><page local="2" global="383"/></section><section number="3" title="Features"><p>Prior to the classification of semantic rela­tions, characteristics of each sentence are auto­matically extracted using GATE (Cunningham et al., 2002). GATE is an infrastructure for de­veloping and deploying software components for Language Engineering. We used the following GATE components: English Tokenizer, Part-Of-Speech (POS) tagger and Morphological ana­lyser.</p><p>The set of features used for the classification of semantic relations includes information from different levels: word tokens, POS tags, verb lemmas, semantic information from WordNet, etc. Semantic features are only applied in cate­gories B and D.</p><p>On the lexical level, the set of word features include the two nominals, their heads in case one of the nominals in question or both are com­pound nominals ( e.g. the relation between <i>&lt;e1&gt;tumor shrinkage&lt;/e1&gt; </i>and <i>&lt;e2&gt;radiation therapy </i>&lt;/e2&gt; is actually between the head of the first <i>"shrinkage' </i>and <i>"radiation therapy"). </i>More features include: the two words before the first nominal, the two words after the second nominal, and the word list in-between (Wang et al., 2006).</p><p>On the POS level, we opted for using a set of POS features since word features are often too sparse. This set includes POS tags of the two words occurring before the first nominal and the two words occurring after the second nominal together with the tag list of the words in-between (Wang et al., 2006). POS tags of nomi-nals are considered redundant information.</p><p>Information regarding verbs and prepositions, occurring in-between the two nominals, is highly considered. In case of the verb, the system takes into account the verb token and the information concerning the voice and lemma. In the same way, the system keeps track of the prepositions occurring between both nominals. In addition, a feature, called <i>numinter, </i>indicating the number of words between nominals is considered.</p><p>Other important feature is the path from the first nominal to the second nominal. This feature is built by the concatenation of the POS tags be­tween both nominals.</p><p>The feature related to the query provided for each sentence is only considered in the categories C and D according to the SEMEVAL re­strictions.</p><p>On the semantic level, we used features ob­tained from WordNet. In addition to the Word­Net sense keys, provided for each nominal, we extracted its synset number and its lexical file number.</p><p>Based on the work of Rosario, Hearst and Fillmore (2002), we suppose that these lexical file numbers can help to determine if the nomi-nals satisfy the restrictions for each relation. For example, in the relation Theme-Tool, the theme should be an object, an event, a state of being, an agent, or a substance. Else, it is possible to af­firm that the relation is false.</p><p>For the Part-Whole relation and due to its relevance in this classification task, a feature indicating metonymy relation in WordNet was taken into account.</p><p>Furthermore, we designed a new feature, called <i>WordNet vector. </i>For constructing this vector, we selected the synsets of the third level of depth in WordNet and we detected if each is ancestor or not of the nominal. It is a binary vec­tor, i.e. if the synset is ancestor of the nominal it is assigned the value 1, else it is assigned the value 0. In this way, we worked with two vec­tors, one for each nominal. Each vector has a dimension of 13 coordinates. Each coordinate represents one of the 13 nodes in the third level of depth in WordNet. Our initial hypothesis con­siders that this representation for the nominals could perform well on unseen data.</p></section><section number="4" title="Experiment Results"><p>Cross validation is a way to test the ability of the model to classify unseen examples. We trained the system using 10-fold cross-validation; the fold number recommended for small training datasets. For each relation and for each category (A, B, C, D) we selected the set of features that obtained the best results using the indicated cross validation.</p><doubt alpha="62.8" length="191" tooSmall="False" monospace="0.0">We submitted 16 sets of results as we partici­pated in the four categories (A, B, C, D). We also used all the possible sizes of the training dataset (1: 1 to 35, 2:1 to 70, 3:1 to 106, 4:1 to</doubt><p>140).</p><page local="3" global="384"/><p>For some learning algorithms such as decision trees and rule learning, appropriate selection of features is crucial. For the SVM model, this is not so important due to its learning mechanism, where irrelevant features are usually balanced between positive and negative examples for a given binary classification problem. However, in the experiments we observed that certain fea­tures have strong influence on the results, and its inclusion or elimination from the vector, influ­enced remarkably the outcomes.</p><p>In this section, we will briefly discuss the ex­periments in the four categories highlighting the most relevant observations.</p><p>In category A, we expected to obtain better results, but the overall performance of the sys­tem has decreased in the seven relations. This shows that our system has over-fitted the train­ing set. The contrast between the F score values in the cross-validation and the final test results demonstrates this fact. For all the relations in the category A4, we obtained an average of F=43.1% [average score of all participating teams: F=58.0% and top average score: F=64.8%].</p><p>In Product-Producer relation, only two fea­tures were used: the two heads of the nominals. In training, we obtained an average F= 60% us­ing cross-validation, while in the final test data, we achieved an average score F=57.7%. For the relation Theme-Tool, other set of features was employed: nominals, their heads, verb, preposi­tion and the list of word between both nominals. Based on the results of the 10-fold cross valida­tion, we expected to obtain an average of the F=70%. Nevertheless, the score obtained is F =30%.</p><p>In category B, our system has achieved better scores. Our average score F is 64.3% and it is above the average of participating teams (F=63.6%) and the baseline.</p><p>Best results in this category were achieved in the relations:  Instrument-Agency (F=73.7%), (F=76.4%). However, for the relation Theme-Tool   the   system   obtained   lower scores (F=49.1%).</p><doubt alpha="62.5" length="40" tooSmall="False" monospace="0.0">Product-Producer   (F=73.9%), Part-Whole</doubt><p>It is obvious that introducing WordNet infor­mation has improved notably the results com­pared with the results obtained in the category</p><p>A.</p><p>In categories C and D, only three groups have participated. In category C (as in category A), the system results have decreased obviously (F=45.3%) with respect to the expected scores in the 10-fold cross validation. Moreover, the score obtained is lower than the average score of all participants (F=58.4%) and the best score (F=65.1%). For example, in training the Instru­ment-Agent relation, the system achieved an average F=78% using 10-fold cross-validation, while for the final score it only obtained</p><p>F=50.7%.</p><p>Results reveal that the main reason behind the low scores in A and C, is the absence of infor­mation from WordNet. Hence, the vector design needs further consideration in case no semantic information is provided.</p><p>In category D, both WordNet senses and query were used, we achieved an average score F=58.8%. The average score for all participants is F=60.6% and the best system achieved F=62.6%. However, the slight difference shows that our system worked relatively well in this category.</p><table caption="Table 1 Scores for A4, B4, C4 and D4" 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>A: No Query, No WordNet</p></td><td class="cell"><p>B:    No Query, WordNet</p></td><td class="cell"><p>C: No Query, No WordNet</p></td><td class="cell"><p>D: Query, Word-Net</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Prec   Rec F</p></td><td class="cell"><p>Prec   Rec F</p></td><td class="cell"><p>Prec   Rec F</p></td><td class="cell"><p>Prec   Rec F</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Cause-Effect</p></td><td class="cell"><p>50.0   51.2 50.6</p></td><td class="cell"><p>66.7   73.2 69.8</p></td><td class="cell"><p>42.9   36.6 39.5</p></td><td class="cell"><p>59.0   56.1 57.5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Instrument-Agency</p></td><td class="cell"><p>47.5    50.0 48.7</p></td><td class="cell"><p>73.7   73.7 73.7</p></td><td class="cell"><p>51.4    50.0 50.7</p></td><td class="cell"><p>67.5   71.1 69.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Product-Producer</p></td><td class="cell"><p>65.3    51.6 57.7</p></td><td class="cell"><p>83.7   66.1 73.9</p></td><td class="cell"><p>67.4    50.0 57.4</p></td><td class="cell"><p>74.5   61.3 67.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Origin-Entity</p></td><td class="cell"><p>50.0   27.8 35.7</p></td><td class="cell"><p>63.0   47.2 54.0</p></td><td class="cell"><p>54.5    33.3 41.4</p></td><td class="cell"><p>63.3    52.8 57.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Theme-Tool</p></td><td class="cell"><p>50.0   27.6 35.6</p></td><td class="cell"><p>50.0   48.3 49.1</p></td><td class="cell"><p>47.4   31.0 37.5</p></td><td class="cell"><p>40.9   31.0 35.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Part-Whole</p></td><td class="cell"><p>26.5   34,6 30.0</p></td><td class="cell"><p>72.4   80.8 76.4</p></td><td class="cell"><p>34.0   61.5 43.8</p></td><td class="cell"><p>57.1    76.9 65.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Content-Container</p></td><td class="cell"><p>48.4   39.5 43.5</p></td><td class="cell"><p>57.6   50.0 53.5</p></td><td class="cell"><p>48.6   44.7 46.6</p></td><td class="cell"><p>63.6   55.3 59.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Avg for UC3M</p></td><td class="cell"><p>48.2   40.3 43.1</p></td><td class="cell"><p>66.7   62.8 64.3</p></td><td class="cell"><p>49.4   43.9 45.3</p></td><td class="cell"><p>60.9   57.8 58.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Avg for all systems</p></td><td class="cell"><p>59.2   58.7 58.0</p></td><td class="cell"><p>65.3    64.4 63.6</p></td><td class="cell"><p>59.9    59.0 58.4</p></td><td class="cell"><p>64.9   60.4 60.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Max Avg F</p></td><td class="cell"><p>64.8</p></td><td class="cell"><p>72.4</p></td><td class="cell"><p>65.1</p></td><td class="cell"><p>62.6</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="4" global="385"/><p>Both run time and accuracy depend critically on the values given to two parameters: the upper bound on the coefficient's values in the equation for the hyperplane (-C), and the degree of the polynomials in the non-linear mapping (-E) (Witten and Frank, 2005). Both are set to 1 by default. The best settings for a particular dataset can be found only by experimentation.</p><p>We made numerous experiments to find the best value for the parameter C (C=1, C=10, not remarkably affected. Probably, this is due to the small size of the training set.</p><doubt alpha="44.4" length="45" tooSmall="False" monospace="0.0">C=100, C=1000, C=10000), but the results were</doubt></section><section number="5" title="Conclusions and Future Work"><p>In our first approach to automatic classifica­tion of semantic relations between nominals and as expected from the training phase, our system achieved its best performance using WordNet information. In general, we obtained better scores in category 4 (size of training: 1 to 140), i.e., when all the training examples are used.</p><p>On the other hand, overfitting the training data (most probably due to the small size of training dataset) is the main reason behind the low scores obtained by our system.</p><p>These facts lead us to the conclusion that se­mantic features from WordNet, in general, play a key role in the classification task. However, the relevance of WordNet-related features var­ies. For example, lexical file numbers proved to be highly effective, while the use of the <i>Word-Net Vector </i>did not improve significantly the re­sults. Thus, we consider that a level 3 <i>WordNet Vector </i>is rather abstract to represent each nomi­nal. Developing a <i>WordNet Vector </i>with a deeper level (&gt; 3) could be more effective as the repre­sentation of nouns is more descriptive. Query features, on the other hand, did not im­prove the performance of the system. This is due to the fact that the same query could represent both positive and negative examples of the rela­tion. However, to improve results in categories A and C, more features need to introduced, es­pecially context and syntactic information such as chunks or dependency relations.</p><p>To improve results across the whole dataset, wider use of semantic information is necessary. For example, the immediate hypernym for each synset obtained from WordNet could help in improving the system performance (Nastase et al., 2006). Besides, information regarding the entity features could help in the classification of some relations like Origin-Entity or Product-Producer. Other semantic resources such as VerbNet, FrameNet, PropBank, etc. could also be used.</p><p>Furthermore, we consider introducing a Word Sense Disambiguation module to obtain the cor­responding synsets of the nominals. Also, in­formation concerning the synsets of the list of the context words could be of great value for the classification task (Wang et al., 2006).</p></section><references><p>Hamish Cunningham, Diana Maynard and Kalina Bontcheva, Valentin Tablan, Cristian Ursu. 2002. <i>The GATE User Guide. </i>http://gate.ac.uk/</p><p>Roxana Girju, Dan Moldovan, Marta Tatu and Daniel An-tohe. 2005. On the semantics of noun compunds. <i>Com­puter Speech and Language 19 </i>pp. 479-496.</p><p>Vivi Nastase, Jelber Sayyad-Shirbad, Marina Sokolova and Stan Szpakowicz. 2006. Learning noun-modifier seman­tic relations with corpus-based and WordNet-based fea­tures. In <i>Proc. of the 21st National Conference on Artifi­cial Intelligence (AAAI2006). </i>Boston, MA.</p><p>John C. Platt. 1998. Sequential Minimal Optimization: A Fast Algorithm for Training Support Vector Machines, <i>Microsoft Research Technical Report MSR-TR-98-14.</i></p><p>Barbara Rosario, Marti A. Hearst, and Charles Fillmore. 2002. "The descent of hierarchy, and selection in rela­tions semantics". In <i>Proceedings of the 40 th Annual Meeting of the Association for Computacional Linguis­tics (ACL '02), </i>Philadelphia, PA, pages 417-424.</p><p>Ian H. Witten, Eibe Frank. 2005. Data Mining: Practical machine learning tools and techniques. <i>Morgan Kauf­mann.</i></p><p>Peter D. Turney and Michael L. Littman. 2005. Corpus-based learning of analogies and semantic rela-tions. <i>Ma­chine Learning, in press.</i></p><p>Ting Wang, Yaoyong Li, Kalina Bontcheva, Hamish Cun­ningham and Ji Wang. 2006. Automatic Extraction of Hierarchical Relations from Text. In <i>Proceedings of the Third European Semantic Web Conference (ESWC 2006), </i>Lecture Notes in Computer Science 4011, Springer, 2006.</p></references></body></article>