<?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="202"/><title>FBK_NK: A WordNet-Based System for Multi-Way Classification of Semantic Relations</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 202-205, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Negri" givenname="Matteo"><org  name="FBK-Irst Trento" country="Italy"/></author><author surname="Kouylekov" givenname="Milen"><org  name="FBK-Irst Trento" country="Italy"/></author></firstpageheader><frontmatter><p><b>FBKJVK: a WordNet-based System for Multi-Way Classification of Semantic Relations</b></p><p><b>Matteo Negri and Milen Kouylekov</b></p><p>FBK-Irst Trento, Italy</p><p>{negri,kouylekov}@fbk.eu</p></frontmatter><abstract>We describe a WordNet-based system for the extraction of semantic relations be­tween pairs of nominals appearing in English texts. The system adopts a lightweight approach, based on training a Bayesian Network classifier using large sets of binary features. Our features con­sider: <i>i) </i>the context surrounding the an­notated nominals, and <i>ii) </i>different types of knowledge extracted from WordNet, in­cluding direct and explicit relations be­tween the annotated nominals, and more general and implicit evidence <i>(e.g. </i>seman­tic boundary collocations). The system achieved a Macro-averaged Fl of 68.02% on the "Multi-Way Classification of Se­mantic Relations Between Pairs of Nom­inals" task (Task #8) at SemEval-2010. </abstract></header><body><section number="1" title="Introduction"><p>The "Multi-Way Classification of Semantic Re­lations Between Pairs of Nominals" task at SemEval-2010 (Hendrickx et al., 2010) consists in: <i>i) </i>selecting from an inventory of nine possi­ble relations the one that most likely holds be­tween two annotated nominals appearing in the in­put sentence, and <i>ii) </i>specifying the order of the nominals as the arguments of the relation. In con­trast with the semantic relations classification task (Task #4) at SemEval-2007 (Girju et al., 2007), which treated each semantic relation separately as a single two-class (positive vs. negative) classifi­cation task, this year's edition of the challenge pre­sented participating systems with a more difficult and realistic <i>multi-way </i>setup, where the relation <i>Other </i>can also be assigned if none of the nine re­lations is suitable for a given sentence. Examples of the possible markable relations are reported in Table l<footnote anchor="1"/>.</p><p>The objective of our experiments with the pro­posed task is to develop a Relation Extraction sys­tem based on shallow linguistic processing, taking the most from available thesauri and ontologies. As a first step in this direction, our submitted runs have been obtained by processing the input sen­tences only to lemmatize their terms, and by using WordNet as the sole source of knowledge.</p><p>Similar to other approaches (Moldovan and Badulescu, 2009; Beamer et al., 2009), our sys­tem makes use of <i>semantic boundaries </i>extracted from the WordNet IS-A backbone. Such bound­aries <i>{i.e. </i>divisions in the WordNet hierarchy that best generalize over the training examples) are used to define pairs of high-level synsets with high correlation with specific relations. For in­stance, <i>&lt;microorganism#l, happening#l&gt; </i>and <i>&lt;writing#l, consequence#l&gt; </i>are extracted from the training data as valid high-level collocations respectively for the relations <i>Cause-Effect </i>and <i>Message-Topic. </i>Besides exploiting the Word-Net IS-A hierarchy, the system also uses the holo-/meronymy relations, and information de­rived from the WordNet glosses to capture specific relations such as <i>Member-Collection </i>and <i>Product-Producer. </i>In addition, the context surrounding the annotated nominals is represented as a <i>bag-of-words/synonyms </i>to enhance the relation extraction process. Several experiments have been carried out encoding all the information as large sets of binary features (up to ^6200) to train a Bayesian Network classifier available in the Weka<footnote anchor="2"/> toolkit. To capture both the <i>relations </i>and the <i>order </i>of their arguments, training sentences having oppo­site argument directions for the same relation have been handled separately, and assigned to different classes (thus obtaining 18 classes for the nine tar­get relations, plus one for the <i>Other </i>relation).<page local="2" global="203"/></p><doubt alpha="65.7" length="137" tooSmall="False" monospace="0.0">'in the first example the order of the nominals is (&lt;e2&gt;,&lt;el&gt;), while in the others is (&lt;el&gt;,&lt;e2&gt;)2http ://www.cs.waikato .ac.nz/ml/weka/</doubt><p>The following sections overview our experi­ments, describing the features used by the sys­tem (Section 2), and the submitted runs with the achieved results (Section 3). A concluding discus­sion on the results is provided in Section 4.</p></section><section number="2" title="Features used"><p>The system uses two types of boolean features: WordNet features, and context features.</p><subsection number="2.1" title="WordNet features"><p>WordNet features consider different types of knowledge extracted from WordNet 3.0.</p><p><b>Semantic boundary collocations. </b>Collocations of high-level synsets featuring a high correlation with specific relations are acquired from the train­ing set using a bottom-up approach. Starting from the nominals annotated in the training sentences (&lt;el&gt; and &lt;e2&gt;), the WordNet IS-A backbone is climbed to collect all their ancestors. Then, all the ancestors' collocations occurring at least <i>n </i>times for at most <i>m </i>relations are retained, and treated as boolean features (set to 1 for a given sentence if its annotated nominals appear among their hy-ponyms). The <i>n </i>and <i>m </i>parameters are optimized on the training set.</p><p><b>Holo-/meronymy relations. </b>These boolean fea­tures are set to 1 every time a pair of annotated nominals in a sentence is <i>directly </i>connected by holo-/meronyny relations. They are particularly appropriate to capture the <i>Component-Whole </i>and <i>Member-Collection </i>relations, as in the 8th exam­ple in Table 1 (where <i>tree#l </i>is an <i>holonym </i>of <i>forest#l).</i><i> </i>Due to time constraints, we did not explore the possibility to generalize these fea­tures considering transitive closures of the nomi­nals' hypo-/hypernyms. This possibility could al­low to handle sentences like <i>"A &lt;el&gt;herd&lt;/el&gt; is a large group of &lt;e2&gt;animals&lt;/e2&gt;." </i>Here, though <i>herdttl </i>and <i>animaWl </i>are not directly con­nected by the meronymy relation, all the <i>herdttl </i>meronyms have <i>animaWl </i>as a common ancestor.</p><p><b>Glosses. </b>Given a pair of annotated nominals &lt;el &gt;,&lt;e2&gt;, these features are set to 1 every time either &lt;el&gt; appears in the gloss of &lt;e2&gt;, or vice-versa. They are intended to support the dis­covery of relations in the case of consecutive nom­inals <i>(e.g. honey#l </i>and <i>bee#l </i>in the 3rd example in Table 1), where contextual information does not provide sufficient clues to make a choice. In our experiments we extracted features from both tok-enized and lemmatized words (both nominals, and gloss words). Also in this case, due to time con­straints we did not explore the possibility to gener­alize the feature considering the nominals' hypo-/hypernyms. This possibility could allow to handle sentences like examples 1 and 4 in Table 1. For instance in example 4, the gloss of <i>"bottle" </i>con­tains two hypernyms of <i>wine#l, </i>namely <i>drink#3 </i>and <i>liquid#l, </i>that could successfully trigger the <i>Content-Container </i>relation.</p><p><b>Synonyms. </b>While the previous features operate with the annotated nominals, WordNet synonyms are used to generalize the other terms in the sen­tence, allowing to extract different types of con­textual features (see the next Section).</p></subsection><subsection number="2.2" title="Context features"><p>Besides the annotated nominals, also specific words (and word combinations) appearing in the surrounding context often contribute to trigger the target relations.<page local="3" global="204"/> Distributional evidence is cap­tured by considering word contexts <i>before, be­tween, </i>and <i>after </i>the annotated nominals. To this aim, we experimented with windows of different size, containing words that occur in the training set a variable number of times. Both the parame­ters <i>{i.e. </i>the size of the windows, and the number of occurrences) are optimized on training data. In our experiments we extracted contextual features from lemmatized sentences.</p><table caption="Table 1: SemEval-2010 Task #8 semantic relations." 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>1</p></td><td class="cell"><p>Cause-Effect(e2,el )</p></td><td class="cell"><p>A person infected with a particular &lt;el&gt;flu&lt;/el&gt; &lt;e2&gt;virus&lt;/e2&gt; strain develops an antibody against that virus.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>2</p></td><td class="cell"><p>Instrument-Agency(el,e2)</p></td><td class="cell"><p>The &lt;el&gt;river&lt;/el&gt; once powered a &lt;e2&gt;grist mill&lt;/e2&gt;.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>3</p></td><td class="cell"><p>Product-Producer(el ,e2)</p></td><td class="cell"><p>The &lt;el&gt;honey&lt;/el &gt; &lt;e2&gt;bee&lt;/e2&gt; is the third insect genome published by scientists, after a lab workhorse, the fruit fly, and a health menace, the mosquito.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>4</p></td><td class="cell"><p>Content-Container(el,e2)</p></td><td class="cell"><p>I emptied the &lt;el&gt;wine&lt;/el&gt; &lt;e2&gt;bottle&lt;/e2&gt; into my glass and toasted my friends.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>5</p></td><td class="cell"><p>Entity-Origin(el ,e2)</p></td><td class="cell"><p>&lt;el&gt;This book&lt;/el&gt;is from the 17th &lt;e2&gt;century&lt;/e2&gt;.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>6</p></td><td class="cell"><p>Entity-Destination(el,e2)</p></td><td class="cell"><p>&lt;el&gt;Suspects&lt;/el&gt; were handed over to the &lt;e2&gt;police station&lt;/e2&gt;.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>7</p></td><td class="cell"><p>Component-Who le(el ,e2)</p></td><td class="cell"><p>&lt;el&gt;Headlights&lt;/el&gt; are considered as the eyes of the &lt;e2&gt;vehicle&lt;/e2&gt;.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>8</p></td><td class="cell"><p>Member-Collection(el,e2)</p></td><td class="cell"><p>Mary  looked  back and  whispered:     T know  every  &lt;el&gt;tree&lt;/el&gt;   in this &lt;e2&gt;forest&lt;/e2&gt;, every scent'.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>9</p></td><td class="cell"><p>Message-Topic(el ,e2)</p></td><td class="cell"><p>Here   we   offer  a   selection   of  our   favourite   &lt;el&gt;books&lt;/el&gt;   on military &lt;e2&gt;history&lt;/e2&gt;.</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></subsection></section><section number="3" title="Submitted runs and results"><p>Our participation to the SemEval-2010 Task #8 consisted in four runs, with the best one (FBK_NK-RES1) achieving a Macro-averaged Fl of 68.02% on the test data. For this submis­sion, the overall training and test running times are about 12'30" and 1'30" respectively, on an Intel Core2 Quad 2.66GHz with 4GB RAM.</p><p><b>FBK_NK-RES1. </b>This run has been obtained adopting a conservative approach, trying to min­imize the risk of overfitting the training data. The features used can be summarized as follows:</p><p>• Semantic boundary collocations: all the col­locations of &lt;el&gt; and &lt;e2&gt; ancestors oc­curring at least 10 times in the training set <i>(m </i>param.), for at most 3 relations <i>(n </i>param.);</p><p>• Holo-/meronymy relations between the anno­tated nominals;</p><p>• Glosses: handled at the level of <i>tokens;</i></p><p>• Context features: <i>left, between, </i>and <i>right </i>context windows of size 3-ALL-3 words re­spectively. Number of occurrences: 25 <i>{left), </i>10 <i>{between), </i>25 <i>{right).</i></p><p>On the <b>training set, </b>the Bayesian Network classi­fier (trained with 2239 features, and evaluated with 10-fold cross-validation) achieves an Accuracy of 65.62% (5249 correctly classified instances out of 8000), and a Macro Fl of 78.15%.</p><p><b>FBK_NK-RES2.   </b>Similar to the first run, but:</p><p>• Semantic boundary collocations: <i>m=9, </i>n=3;</p><p>• Glosses: handled at the level of <i>lemmas;</i></p><p>• Context features: <i>left, between, </i>and <i>right </i>context windows of size 4-ALL-l words re­spectively (occurrences: 25-10-25).</p><p>Based on the observation of system's behaviour on the training data, the objectives of this run were to: <i>i) </i>add more collocations as features, <i>ii) </i>increase the importance of terms appearing in the <i>left </i>con­text, <i>Hi) </i>reduce the importance of terms appearing in the <i>right </i>context, and <i>iv) </i>increase the possibil­ity of matching the nominals with gloss terms by considering their respective lemmas. On the <b>train­ing set, </b>the classifier (trained with 2998 features) achieves 66.92% Accuracy (5353 correctly classi­fied instances), and a Macro Fl of 79.56%.</p><p><b>FBKJVK-RES3. </b>Similar to the second run, but considering the synonyms of the most frequent sense of the words <i>between </i>&lt;el&gt; and &lt;e2&gt;.</p><p>The goal of this run was to generalize the con­text <i>between </i>nominals, by considering word lem­mas. On the <b>training set, </b>the classifier (trained with 2998 features) achieves an Accuracy of 64.94% (5195 correctly classified instances), and a Macro Fl of 77.38%.</p><p><b>FBK_NK-RES4. </b>Similar to the second run, but considering semantic boundary collocations oc­curring at least 7 times in the training set <i>(m </i>param.), for at most 3 relations <i>{n </i>param.).</p><p>The goal of this run was to further increase the number of collocations used as features. On the <b>training set, </b>the classifier (trained with 6233 fea­tures) achieves achieves 68.12% Accuracy (5449 correct classifications), and 82.24% Macro Fl.</p><p>As regards the results on the test set, Table 2 re­ports the scores achieved by each run using differ­ent portions of the training set (1000, 2000, 4000, 8000 examples), while Figure 1 shows the learn­ing curves for each relation of our best run.</p></section><section number="4" title="Discussion and conclusion"><p>As can be seen from Table 2, the results contra­dict our expectations about the effectiveness of our less conservative configurations and, in particular, about the utility of using larger amounts of se­mantic boundary collocations. The performance<page local="4" global="205"/></p><table caption="Table 2: Test results (Macro-averaged Fl) using different amounts of training sentences." 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>Run</p></td><td class="cell"><p>1000</p></td><td class="cell"><p>2000</p></td><td class="cell"><p>4000</p></td><td class="cell"><p>8000</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>FBK_NK-RES1</p></td><td class="cell"><p>55.71</p></td><td class="cell"><p>64.06</p></td><td class="cell"><p>67.80</p></td><td class="cell"><p><b>68.02</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>FBK_NK-RES2</p></td><td class="cell"><p>54.27</p></td><td class="cell"><p>63.68</p></td><td class="cell"><p>67.08</p></td><td class="cell"><p>67.48</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>FBK_NK-RES3</p></td><td class="cell"><p>54.25</p></td><td class="cell"><p>62.73</p></td><td class="cell"><p>66.11</p></td><td class="cell"><p>66.90</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>FBKJSÏK-RES4</p></td><td class="cell"><p>44.11</p></td><td class="cell"><p>58.85</p></td><td class="cell"><p>63.06</p></td><td class="cell"><p>65.84</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><doubt alpha="0.0" length="19" tooSmall="False" monospace="0.0">1000 2000 4000 8000</doubt><p>Number of Training Examples</p><figure caption="Figure 1: Learning curves on the test set (FB K_NK-RES 1 )."></figure><p>decrease from Run2 to Run4<footnote anchor="3"/> clearly indicates an overfitting problem. Though suitable to model the training data, the additional collocations were not encountered in the test set. This caused a bias to­wards the <i>Other </i>relation, which reduced the over­all performance of the system.</p><p>Regarding our best run, Figure 1 shows dif­ferent system's behaviours with the different tar­get relations. For some of them <i>{e.g. Entity-Destination, Cause-Effect) </i>better results are mo­tivated by the fact that they are often triggered by frequent unambiguous word patterns <i>{e.g. "&lt;el&gt;has been moved to a &lt;e2&gt;", "&lt;el&gt; causes &lt;e2&gt;"). </i>Such relations are effectively handled by the context features which, in contrast, are inadequate for those expressed with high lex­ical variability. This is particularly evident with the <i>Other </i>relation, for which the acquired context features poorly discriminate positive from nega­tive examples even on the training set.</p><p>For some relations additional evidence is suc­cessfully brought by the WordNet features. For instance, the good results for <i>Member-Collection </i>demonstrate the usefulness of the holo-/meronymy features.</p><p>As regards semantic boundary collocations, to check their effectiveness we performed a <i>post-hoc </i>analysis of those used in our best run. Such anal­ysis was done in two ways: <i>i) </i>by counting the number of collocations acquired on the training set for each relation <i>Ri, </i>and <i>ii) </i>by calculating the ambiguity of each <i>Ri</i><i>'s</i><i> </i>collocation on the training set <i>{i.e. </i>the average number of other relations activated by the collocation). The analysis re­vealed that the top performing relations <i>{Member-Collection, Entity-Destination, Cause-Effect, </i>and <i>Content-Container) </i>are those for which we ac­quired lots of unambiguous collocations. These findings also explain the poor performance on the <i>Instrument-Agency </i>and the <i>Other </i>relation. For <i>Instrument-Agency </i>we extracted the lowest num­ber of collocations, which were also the most am­biguous ones. For the <i>Other </i>relation the high am­biguity of the collocations extracted is not com­pensated by their huge number (around 50% of the total collocations acquired).</p><footnote label="3">The only difference between Run2 and Run4 is the addi­tion of around 4000 semantic boundary collocations, which lead to an overall 2.4% Fl performance decrease. The de­crease mainly comes in terms of Recall (from 65.91% in Run2to 63.35%in Run4).</footnote><p>In conclusion, considering <i>i)</i><i> </i>the level of pro­cessing required (only lemmatization), <i>ii)</i><i> </i>the fact that WordNet is used as the sole source of knowl­edge, and <i>Hi)</i><i> </i>the many possible solutions left unexplored due to time constraints, our results demonstrate the validity of our approach, de­spite its simplicity. Future research will focus on a better use of semantic boundary colloca­tions, on more refined ways to extract knowledge from WordNet, and on integrating other knowl­edge sources <i>{e.g. </i>SUMO, YAGO, Cyc).</p></section><section title="Acknowledgments"><p>The research leading to these results has received funding from the European Community's Sev­enth Framework Programme (FP7/2007-2013) un­der Grant Agreement n. 248531 (CoSyne project).</p></section><references><p>B. Beamer, A. Rozovskaya, and R. Girju 2008. <i>Au­tomatic Semantic Relation Extraction with Multiple Boundary Generation. </i>Proceedings of The National Conference on Artificial Intelligence (AAAI).</p><p>R. Girju, R Nakov, V. Nastase, S. Szpakowicz, R Tur-ney, and D. Yuret 2007. <i>SemEval-2007 task 04: Classification of semantic relations between nomi­nals. </i>Proceedings of the 4th Semantic Evaluation Workshop (SemEval-2007).</p><p>I. Hendrickx et al. 2010. <i>SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominals </i>Proceedings of the 5th SIGLEX Workshop on Semantic Evaluation.</p><p>D. Moldovan, A. Badulescu 2005. <i>A Semantic Scatter­ing Model for the Automatic Interpretation of Gen­itives. </i>Proceedings of The Human Language Tech­nology Conference (HLT).</p></references></body></article>