<?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="226"/><title>ECNU: Effective Semantic Relations Classification without Complicated Features or Multiple External Corpora</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 226-229, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Chen" givenname="Yuan"><org  name="Institute for Infocomm Research" country="Singapore"/></author><author surname="Lan" givenname="Man"><org  name="Institute for Infocomm Research" country="Singapore"/></author><author surname="Su" givenname="Jian"><org  name="Institute for Infocomm Research" country="Singapore"/></author><author surname="Zhou" givenname="Zhi Min"><org  name="Institute for Infocomm Research" country="Singapore"/></author><author surname="Xu" givenname="Yu"><org  name="Institute for Infocomm Research" country="Singapore"/></author></firstpageheader><frontmatter><p><b>ECNU: Effective Semantic Relations Classification without Complicated Features or Multiple External Corpora</b></p><p><b>Yuan Chent, Man Lan™, Jian Su§, Zhi Min Zhout, </b><b>Yu</b><b> Xuf</b></p><p>^East China Normal University, Shanghai, PRC. institute for Infocomm Research, Singapore.</p><p>lanman.sg@gmail.com</p></frontmatter><abstract>This paper describes our approach to the automatic identification of semantic rela­tions between nominals in English sen­tences. The basic idea of our strategy is to develop machine-learning classifiers which: (1) make use of class-independent features and classifier; (2) make use of a simple and effective feature set without high computational cost; (3) make no use of external annotated or unannotated cor­pus at all. At SemEval 2010 Task 8 our system achieved an F-measure of 75.43% and a accuracy of 70.22%. </abstract></header><body><section number="1" title="Introduction"><p>Knowledge extraction of semantic relations be­tween pairs of nominals from English text is one important application both as an end in itself and as an intermediate step in various downstream NLP applications, such as information extraction, summarization, machine translation, QA etc. It is also useful for many auxiliary tasks such as word sense disambiguation, language modeling, para­phrasing and discourse relation processing.</p><p>In the past decade, semantic relation classifica­tion has attracted a lot of interest from researchers and a wide variety of relation classification schemes exist in the literature. However, most research work is quite different in definition of relations and granularities of various applications. That is, there is little agreement on relation inventories. SemEval 2010 Task 8 (Hendrickx et al., 2008) provides a new standard benchmark for semantic relation classification to a wider community, where it defines 9 relations includ­ing Cause-Effect, Component-Whole, Content-Container, Entity-Destination, Entity-Origin, Instrument-Agency, Member-Collection, Message-Topic,</p><p>Product-Producer, and a tenth pseudo-relation Other (where relation is not one of the 9 annotated relations).</p><p>Unlike the previous semantic relation task in SemEval 2007 Task 4, the current evaluation pro­vides neither query pattern for each sentence nor manually annotated word sense (in WordNet se­mantic) for each nominals. Since its initiative is to provide a more realistic real-world application design that is practical, any classification system must be usable without too much effort. It needs to be easily computable. So we need to take into account the following special considerations.</p><p>1. The extracted features for relation are ex­pected to be easily computable. That is, the steps in the feature extraction process are to be simple and direct for the purpose of reduc­ing errors possibly introduced by many NLP tools. Furthermore, a unified (global) feature set is set up for all relations rather than for each relation.</p><p>2. Most previous work at SemEval 2007 Task 4 leveraged on external theauri or corpora (whether unannotated or annotated) (Davi-dov and Rappoport, 2008), (Costello, 2007), (Beamer et al., 2007) and (Nakov and Hearst, 2008) that make the task adaption to different domains and languages more difficult, since they would not have such manually classified or annotated corpus available. From a practi­cal point of view, our system would make use of less resources.</p><p>3. Most previous work at Semeval 2007 Task 4 constructed several local classifiers on dif­ferent algorithms or different feature subsets, one for each relation (Hendrickx et al., 2007) and (Davidov and Rappoport, 2008). Our ap­proach is to build a global classifier for all relations in practical NLP settings.</p><page local="2" global="227"/><p>Based on the above considerations, the idea of our system is to make use of external resources as less as possible. The purpose of this work is two­fold. First, it provides an overview of our simple and effective process for this task. Second, it com­pares different features and classification strate­gies for semantic relation.</p><p>Section 2 presents the system description. Sec­tion 3 describes the results and discussions. Sec­tion 4 concludes this work.</p></section><section number="2" title="System Description"><subsection number="2.1" title="Features Extraction"><p>For each training and test sentence, we reduce the annotated target entities <i>el </i>and <i>e2 </i>to single nouns <i>nounl </i>and <i>noun2, </i>by keeping their last nouns only, which we assume to be heads.</p><p>We create a global feature set for all relations. The features extracted are of three types, i.e., lex­ical, morpho-syntactic and semantic. The feature set consists of the following 6 types of features.</p><p><b>Feature set 1: Lemma of target entities </b><b><i>el </i></b><b>and </b><b><i>el. </i></b>The lemma of the entities annotated in the given sentence.</p><p><b>Feature set 2: Stem and POS of words be­tween </b><b><i>el </i></b><b>and </b><b><i>el. </i></b>The stem and POS tag of the words between two nominals. First all the words between two nominals were extracted and then the Porter's stemming was performed to reduce words to their base forms (Porter, 1980). Meanwhile, OpenNLP postag tool was used to return part-of-speech tagging for each word.</p><p><b>Feature set 3: syntactic pattern derived from syntactic parser between </b><b><i>el </i></b><b>and </b><b><i>el. </i></b>Typically, the verb phrase or preposition phrase which con­tain the nominals are important for relation clas­sification. Therefore, OpenNLP Parser was per­formed to do full syntactic parsing for each sen­tence. Then for each nominal, we look for its par­ent node in the syntactic tree until the parent node is a verb phrase or preposition phrase. Then the label of this phrase and the verb or preposition of this phrase were extracted as the syntactic features.</p><p>Besides, we also extracted other 3 feature types with the aid of WordNet.</p><p><b>Feature set 4: WordNet semantic class of </b><b><i>el </i></b><b>and </b><b><i>el. </i></b>The WordNet semantic class of each an­notated entity in the relation. If the nominal has two and more words, then we examine the seman­tic class of <i>"wl-w2" </i>in WordNet. If no result re­turned from WordNet, we examine the semantic class of head in the nominal. Since the cost of manually WSD is expensive, the system simply used the first (most frequent) noun senses for those words.</p><p><b>Feature set 5: meronym-holonym relation between </b><b><i>el </i></b><b>and </b><b><i>el. </i></b>The meronym-holonym relation between nominals. These information are quite important for component-whole and Member-Collection relations. WordNet3.0 provides meronym and holonym information for some nouns. The features are extracted in the fol­lowing steps. First, for nominal <i>el, </i>we extract its holonym from WN and for nominal <i>e2, </i>we extract its Synonyms/Hypernyms. Then, the system will check if there is same word between <i>el's </i>holonym and <i>e2's </i>synonym &amp; hypernym. The yes or no result will be a binary feature. If yes, we also ex­amine the type of this match is <i>"part-of" </i>or <i>"mem­berjof" </i>in holonym result. Then this type is also a binary feature. After that, we exchange the posi­tion of <i>el </i>and <i>e2 </i>and perform the same process­ing. By creating these features, the system can also take the direction of relations into account.</p><p><b>Feature set 6: hyponym-hypernym rela­tion between nominal and the word of "con­tainer". </b>This feature is designed for Content-Container relation. For each nominal, WordNet returns its hypernym set. Then the system examine if the hypernym set contains the word "container". The result leads to a binary feature.</p></subsection><subsection number="2.2" title="Classifier Construction"><p>Our system is to build up a global classifier based on global feature set for all 9 non-Other relations. Generally, for this multi-class task, there are two strategies for building classifier, which both con­struct classifier on a global feature set. The first scheme is to treat this multi-class task as an multi-way classification. Since each pair of nominals corresponds to one relation, i.e., single label clas­sification, we build up a 10-way SVM classifier for all 10 relations. Here, we call it multi-way clas­sification. That is, the system will construct one single global classifier which can classify 10 rela­tions simultaneously in a run. The second scheme is to split this multi-class task into multiple binary classification tasks. Thus, we build 9 binary SVM classifiers, one for each non-Other relation. Noted that in both strategies the classifiers are built on global feature set for all relations. For the sec­ond multiple binary classification, we also experimented on different prob, thresholds, i.e., 0.<page local="3" global="228"/>25 and 0.5. Furthermore, in order to reduce errors and boost performance, we also adopt the major­ity voting strategy to combine different classifiers.</p></subsection></section><section number="3" title="Results and Discussion"><subsection number="3.1" title="System Configurations and Results"><p>The classifiers for all relations were optimized independently in a number of 10-fold cross-validation (CV) experiments on the provided train­ing sets. The feature sets and learning algorithms which were found to obtain the highest accuracies for each relation were then used when applying the classifiers to the unseen test data.</p><table caption="Table 1 summaries the 7 system configurations we submitted and their performance on the test data."></table><p>Among the above 7 system, SR5 system shows the best macro-averaged Fl measure. Table 2 de­scribes the statistics and performance obtained per relation on the SR5 system.</p><p>Table 3 shows the performance of these 7 sys­tems on the test data as a function of training set size.</p></subsection><subsection number="3.2" title="Discussion"><p>The first three systems are based on three feature sets, i.e.,Fl-F3, with different classification strat­egy. The next three systems are based on all six feature sets with different classification strategy. The last system adopts majority voting scheme on the results of four systems, i.e., SRI, SR2, SR4 and SR5. Based on the above series of exper­iments and results shown in the above 3 tables, some interesting observations can be found as fol­lows.</p><p>Obviously, although we did not perform WSD on each nominal and only took the first noun sense as semantic class, WordNet significantly improved the performance. This result is consistent with many previous work on Semeval 2007 Task 4 and once again it shows that WordNet is important for semantic relation classification. Specifically, whether for multi-way classification or multiple binary classification, the systems involved features extracted from WordNet performed better than the others not involved WN, for example, SR4 better than SRI (74.82% vs 60.08%), SR5 better than SR2 (75.43% vs 72.59%), SR6 better than SR3 (72.19% vs 68.50%).</p><p>Generally, the performance of multiple binary classifier is better than multi-way classifier. That means, given a global feature set for 9 relations, the performance of 9 binary classifiers is better than a 10-way classifier. Specifically, when F1-F3 are involved, SR2 (72.59%) and SR3 (68.50%) are both better than SRI (60.08%). However, when F1-F6 feature sets are involved, the performance of SR4 is between that of SR5 and SR6 in terms of macro-averaged <i>F\ </i>measure. With respect to ac­curacy measure (Acc), SR4 system performs the best.</p><p>Moreover, for multiple binary classification, the threshold of probability has impact on the perfor­mance. Generally, the system with prob, threshold 0. 25 is better than that with 0.5, for example, SR2 better than SR3 (72.59% vs 68.50%), SR5 better than SR6 (75.43% vs 72.19%).</p><p>As an ensemble system, SR7 combines the re­sults of SRI, SR2, SR4 and SR5. However, this majority voting strategy has not shown significant improvements. The possible reason may be that these classifiers come from a family of SVM clas­sifiers and thus the random errors are not signifi­cantly different.</p><p>Besides, one interesting observation is that SR4 system achieved the top 2 performance on TD1 data amongst all participating systems. This shows that, even with less training data, SR4 sys­tem achieves good performance.</p></subsection></section><section title="Acknowledgments"><p>This work is supported by grants from Na­tional Natural Science Foundation of China (No.60903093), Shanghai Pujiang Talent Program (No.09PJ1404500) and Doctoral Fund of Ministry of Education of China (No.20090076120029).</p><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><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>Feature Set</p></td><td class="cell"><p>Classifier</p></td><td class="cell"><p><i>P{%)</i></p></td><td class="cell"><p><i>R{%)</i></p></td><td class="cell"><p><i>Fi </i><i>(%)</i></p></td><td class="cell"><p><i>Acc </i><i>(%)</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SRI</p></td><td class="cell"><p>F1-F3</p></td><td class="cell"><p>multi-way classification</p></td><td class="cell"><p>70.69</p></td><td class="cell"><p>58.05</p></td><td class="cell"><p>60.08</p></td><td class="cell"><p>57.05</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR2</p></td><td class="cell"><p>F1-F3</p></td><td class="cell"><p>multiple binary (prob, threshold =0.25)</p></td><td class="cell"><p>74.02</p></td><td class="cell"><p>71.61</p></td><td class="cell"><p>72.59</p></td><td class="cell"><p>67.10</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR3</p></td><td class="cell"><p>F1-F3</p></td><td class="cell"><p>multiple binary (prob, threshold =0.5)</p></td><td class="cell"><p>80.25</p></td><td class="cell"><p>60.92</p></td><td class="cell"><p>68.50</p></td><td class="cell"><p>62.02</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR4</p></td><td class="cell"><p>F1-F6</p></td><td class="cell"><p>multi-way classification</p></td><td class="cell"><p>75.72</p></td><td class="cell"><p>74.16</p></td><td class="cell"><p>74.82</p></td><td class="cell"><p>70.52</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR5</p></td><td class="cell"><p>F1-F6</p></td><td class="cell"><p>multiple binary (prob, threshold =0.25)</p></td><td class="cell"><p>75.88</p></td><td class="cell"><p>75.29</p></td><td class="cell"><p><b>75.43</b></p></td><td class="cell"><p>70.22</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR6</p></td><td class="cell"><p>F1-F6</p></td><td class="cell"><p>multiple binary (prob, threshold =0.5)</p></td><td class="cell"><p>83.08</p></td><td class="cell"><p>64.72</p></td><td class="cell"><p>72.19</p></td><td class="cell"><p>65.81</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR7</p></td><td class="cell"><p>F1-F6</p></td><td class="cell"><p>majority voting based on SRI, SR2, SR4 and SR5</p></td><td class="cell"><p>74.83</p></td><td class="cell"><p>75.97</p></td><td class="cell"><p>75.21</p></td><td class="cell"><p>70.15</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><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><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>Total #</p></td><td class="cell"><p><i>P{%)</i></p></td><td class="cell"><p><i>R{%)</i></p></td><td class="cell"><p><i>Fi </i><i>(%)</i></p></td><td class="cell"><p><i>Acc </i><i>(%)</i></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>328</p></td><td class="cell"><p>83.33</p></td><td class="cell"><p>86.89</p></td><td class="cell"><p>85.07</p></td><td class="cell"><p>86.89</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Component-Whole</p></td><td class="cell"><p>312</p></td><td class="cell"><p>74.82</p></td><td class="cell"><p>65.71</p></td><td class="cell"><p>69.97</p></td><td class="cell"><p>65.71</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>192</p></td><td class="cell"><p>79.19</p></td><td class="cell"><p>81.25</p></td><td class="cell"><p>80.21</p></td><td class="cell"><p>81.25</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Entity-Destination</p></td><td class="cell"><p>292</p></td><td class="cell"><p>79.38</p></td><td class="cell"><p>86.99</p></td><td class="cell"><p>83.01</p></td><td class="cell"><p>86.99</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Entity-Origin</p></td><td class="cell"><p>258</p></td><td class="cell"><p>81.01</p></td><td class="cell"><p>81.01</p></td><td class="cell"><p>81.01</p></td><td class="cell"><p>81.01</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>156</p></td><td class="cell"><p>63.19</p></td><td class="cell"><p>58.33</p></td><td class="cell"><p>60.67</p></td><td class="cell"><p>58.33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Member-Collection</p></td><td class="cell"><p>233</p></td><td class="cell"><p>73.76</p></td><td class="cell"><p>83.26</p></td><td class="cell"><p>78.23</p></td><td class="cell"><p>83.26</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Message-Topic</p></td><td class="cell"><p>261</p></td><td class="cell"><p>75.2</p></td><td class="cell"><p>73.18</p></td><td class="cell"><p>74.17</p></td><td class="cell"><p>73.18</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>231</p></td><td class="cell"><p>73.06</p></td><td class="cell"><p>61.04</p></td><td class="cell"><p>66.51</p></td><td class="cell"><p>61.04</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Other</p></td><td class="cell"><p>454</p></td><td class="cell"><p>38.56</p></td><td class="cell"><p>40.09</p></td><td class="cell"><p>39.31</p></td><td class="cell"><p>40.09</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Micro-Average</p></td><td class="cell"><p></p></td><td class="cell"><p>76.88</p></td><td class="cell"><p>76.27</p></td><td class="cell"><p>76.57</p></td><td class="cell"><p>70.22</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Macro-Average</p></td><td class="cell"><p></p></td><td class="cell"><p>75.88</p></td><td class="cell"><p>75.29</p></td><td class="cell"><p>75.43</p></td><td class="cell"><p>70.22</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><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><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>TDl</p></td><td class="cell"><p>TD2</p></td><td class="cell"><p>TD3</p></td><td class="cell"><p>TD4</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>Fi </i><i>(%)</i></p></td><td class="cell"><p><i>Acc </i><i>(%)</i></p></td><td class="cell"><p><i>Fi </i><i>(%)</i></p></td><td class="cell"><p><i>Acc </i><i>(%)</i></p></td><td class="cell"><p><i>Fi </i><i>(%)</i></p></td><td class="cell"><p><i>Acc </i><i>(%)</i></p></td><td class="cell"><p><i>Fi </i><i>(%)</i></p></td><td class="cell"><p><i>Acc </i><i>(%)</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SRI</p></td><td class="cell"><p>52.13</p></td><td class="cell"><p>49.50</p></td><td class="cell"><p>56.58</p></td><td class="cell"><p>54.84</p></td><td class="cell"><p>58.16</p></td><td class="cell"><p>56.16</p></td><td class="cell"><p>60.08</p></td><td class="cell"><p>57.05</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR2</p></td><td class="cell"><p>46.24</p></td><td class="cell"><p>38.90</p></td><td class="cell"><p>47.99</p></td><td class="cell"><p>40.45</p></td><td class="cell"><p>69.83</p></td><td class="cell"><p>64.67</p></td><td class="cell"><p>72.59</p></td><td class="cell"><p>67.10</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR3</p></td><td class="cell"><p>39.89</p></td><td class="cell"><p>34.56</p></td><td class="cell"><p>42.29</p></td><td class="cell"><p>36.66</p></td><td class="cell"><p>65.47</p></td><td class="cell"><p>59.59</p></td><td class="cell"><p>68.50</p></td><td class="cell"><p>62.02</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR4</p></td><td class="cell"><p><b>67.95</b></p></td><td class="cell"><p><b>63.45</b></p></td><td class="cell"><p><b>70.58</b></p></td><td class="cell"><p><b>66.14</b></p></td><td class="cell"><p><b>72.99</b></p></td><td class="cell"><p><b>68.94</b></p></td><td class="cell"><p>74.82</p></td><td class="cell"><p><b>70.52</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR5</p></td><td class="cell"><p>49.32</p></td><td class="cell"><p>41.59</p></td><td class="cell"><p>50.70</p></td><td class="cell"><p>42.77</p></td><td class="cell"><p>72.63</p></td><td class="cell"><p>67.72</p></td><td class="cell"><p><b>75.43</b></p></td><td class="cell"><p>70.22</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR6</p></td><td class="cell"><p>42.88</p></td><td class="cell"><p>36.99</p></td><td class="cell"><p>45.54</p></td><td class="cell"><p>39.57</p></td><td class="cell"><p>69.87</p></td><td class="cell"><p>64.00</p></td><td class="cell"><p>72.19</p></td><td class="cell"><p>65.81</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>SR7</p></td><td class="cell"><p>58.67</p></td><td class="cell"><p>52.71</p></td><td class="cell"><p>58.87</p></td><td class="cell"><p>53.18</p></td><td class="cell"><p>72.79</p></td><td class="cell"><p>68.09</p></td><td class="cell"><p>75.21</p></td><td class="cell"><p>70.15</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><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table></section><references><p>1. Hendrickx, S. N. Kim, Z. Kozareva, P. Nakov, D. Ö Séaghdha, S. Padö, M. Pennacchiotti, L. Ro­mano and S. Szpakowicz. SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Be­tween Pairs of Nominals. In <i>Proceedings of the 5th SIGLEX Workshop on Semantic Evaluation, </i>pp.94-99, 20 fO, Uppsala, Sweden.</p><p>D. Davidov and A. Rappoport. Classification of Semantic Relationships between Nominals Using Pattern Clusters. <i>Proceedings of ACL-08: HLT, </i>pp.227-235, 2008.</p><p>F. J. Costello. UCD-FC: Deducing semantic rela­tions using WordNet senses that occur frequently<page local="4" global="229"/></p><p>Table 1: Summary of 7 system configurations and performance on the test data. Precision, Recall, Fl are macro-averaged for system's performance on 9 non-Other relations and evaluated with directionality taken into account.</p><p>Table 2: Performance obtained per relation on SR5 system. Precision, Recall, Fl are macro-averaged for system's performance on 9 non-Other relations and evaluated with directionality taken into account.</p><p>Table 3: Performance of these 7 systems on the test data as a function of training set size. The four training subsets, TDl, TD2, TD3 and TD4, have 1000, 2000,4000 and 8000 (complete) training samples respectively. Fl is macro-averaged for system's performance on 9 non-Other relations and evaluated with directionality taken into account.</p><p>in a database of noun-noun compounds. <i>ACL Se-mEval'07 Workshop, </i>pp.370C373, 2007.</p><p>B. Beamer, S. Bhat, B. Chee, A. Fister, A. Rozovskaya and R.Girju. UIUC: A knowledge-rich approach to identifying semantic relations between nominals. <i>ACL SemEval'07 Workshop, </i>pp.386-389, 2007.</p><p>I. Hendrickx, R. Morante, C. Sporieder and A. Bosch. ILK: machine learning of semantic relations with shallow features and almost no data. <i>ACL Se­mEval'07 Workshop, </i>pp.I87CI90, 2007.</p><p>R Nakov and M. A. Hearst. Solving Relational Simi­larity Problems Using the Web as a Corpus. In <i>Pro­ceedings of ACL, </i>pp.452-460, 2008.</p><p>M. Porter. An algorithm for suffix stripping. In <i>Pro­gram, </i>vol. 14, no. 3, pp.130-137, 1980.</p></references></body></article>