<?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="215"/><title>LCC-SRN: LCC's SRN System for SemEval 2007 Task 4</title><pubinfo>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007),pages 215-218, Prague, June 2007. ©2007 Association for Computational Linguistics</pubinfo><author surname="Badulescu" givenname="Adriana"><org  name="Language Computer Corporation" country="USA" city="Richardson"/></author><author surname="Srikanth" givenname="Munirathnam"><org  name="Language Computer Corporation" country="USA" city="Richardson"/></author></firstpageheader><frontmatter><p><b>LCC-SRN: LCC's SRN System for SemEval 2007 Task 4</b></p><p><b>Adriana Badulescu Munirathnam Srikanth</b></p><p>Language Computer Corporation Language Computer Corporation</p><p>1701 N Collins Blvd #2000 1701 N Collins Blvd #2000</p><p>Richardson, TX, 75080 Richardson, TX, 75080</p><p>adriana@languagecomputer. com srikanth@languagecomputer. com</p></frontmatter><abstract>This document provides a description of the Language Computer Corporation (LCC) SRN System that participated in the SemE-val 2007 Semantic Relation between Nominals task. The system combines the outputs of different binary and multi-class classifiers build using machine learning al­gorithms like Decision Trees, Semantic Scattering, Iterative Semantic Specializa­tion, and Support Vector Machines. </abstract></header><body><section number="1" title="Introduction"><p>The Semantic Relations between Nominals task from SemEval 2007 focuses on identifying the se­mantic relations that hold between two arguments manually annotated with word senses (Girju et al, 2007).</p><p>The previous work in identifying semantic rela­tions between nominals focuses on finding one or more relations in text for specific syntactic patterns or constructions (like genitives and noun com­pounds) using semi-automated and automated sys­tems. An overview of some of these methods can be found in (Badulescu, 2004).</p><p>The LCC SRN system, developed during the SRN training period, was for us, the beginning of a different approach to semantic relations detection: detecting semantic relations in text without using a syntactic pattern. Our existing work on semantic relation detection was on detecting semantic rela­tions in text (one or more at a time) at different levels in the sentence using different syntactic pat­terns like genitives, noun compounds, verb­arguments, etc.</p><p>For SRN, we built a new system that combines the output of the pattern dependent classifiers with the new pattern-independent classifiers for better results.</p><p>The remainder of this paper is organized as fol­lows: Section 2 describes our system, Section 3 details the experimental results, and Section 4 summarizes the conclusions.</p></section><section number="2" title="System description"><p>The system consists of two types of classifiers: classifiers that do not use the syntactic parsed tree and that were built specifically for the SemEval 2007 Task 4(SRN) and classifiers that use specific syntactic pattern to determine the semantic rela­tions and there were previously developed at LCC and then adapted to the SRN task (SRNPAT).</p><p>The classifiers for each type were built from an­notated examples using supervised <b>machine learn­ing algorithms </b>like Decision Trees (DT)<footnote anchor="1"/>, Support Vector Machines <b><i>(SVM)</i></b><footnote anchor="2"/>, Semantic Scattering <b><i>(SS) </i></b>(Moldovan and Badulescu, 2005) , Iterative Semantic Specialization <b><i>(ISS) </i></b>(Girju, Badulescu, and Moldovan, 2006), Naïve Bayes <b><i>(NB)<footnote anchor="3"/> </i></b>and Maximum Entropy (ME)<footnote anchor="4"/>.</p><p>The outputs of different classifiers (built using different types of machine learning algorithms were <b>combined </b>and ranked using predefined rules.</p><figure caption="Figure 1 shows thearchitectureof our SRN system."></figure><footnote label="1">C5.0., http://www.rulequest.com/see5-info.html</footnote><footnote label="2">LIBSVM, www.csie.ntu.edu.tw/~cjlin/libsvm/</footnote><footnote label="3">jBNC, http://jbnc.sourceforge.net</footnote><footnote label="4"> http://homepages.inf.ed.ac.uk/s0450736/maxent_tool- kit.html</footnote><page local="2" global="216"/><p>Sentences</p><p>Text Processing Tools</p><p>Annotations</p><p>Annotated tree</p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">1</doubt><p>Argument Detection [Arg1Arg2Pattern, Argl, Arg2]</p><p>Pattern Matching [Pattern, NPArg1, NPArg2]</p><p>Feature Extraction</p><p>Featu reSetsSRN [Arg1Arg2Pattern, Arg1, Arg2]</p><p>FeatureSetsSRNPAT [Pattern, NPArg1, NPArg2]</p><doubt alpha="100.0" length="2" tooSmall="False" monospace="0.0">Li</doubt><p>[Arg1, Arg2, Relation, Score,Classifier] [NPArg1, NPArg2, Relation,</p><p>Score, Classifier]</p><p>Relation Selection</p><doubt alpha="65.5" length="29" tooSmall="False" monospace="0.0">[Arg1, Arg2, Relation, Score]</doubt><p>Generate Output</p><p>REL1: SENTID Value</p><p>REL7: SENTID Value</p><figure caption="Figure 1. The architecture of our SRN system."></figure><subsection number="2.1" title="Text Preprocessing"><p>The sentences were processed using an in-house text tokenizer, Brill's part-of-speech tagger, an in-house WordNet-based concept detector, an in-house Named Entity Recognizer, and an in-house syntactic parser.</p><p>Then, the syntactic and semantic information obtained using these tools (concepts, part of speech, named entities, etc) or obtained from the sensekeys for the arguments as provided by the Task 4 organizers (e.g. word senses, lemmas, etc) were mapped into the syntactic trees. If an argu­ment corresponds to more than one tree node, the annotation was mapped to the phrase containing the two nodes.</p></subsection><subsection number="2.2" title="Learning and Classification Methods"><p>The core of our system is the learning and clas­sification module.</p><p>We used two types of methods: pattern-dependent that uses the syntactic parsed trees for extracting and assigning a label to the arguments and pattern-independent that creates classifiers form all the examples disregarding the pattern in the tree.</p><subsubsection number="2.2.1" title="Pattern-independent Methods (SRN)"><p>Considering the limited number of examples for each pattern, we developed pattern-independent methods for classifying the semantic relations us­ing the provided argument annotations and the context from the sentence.</p><p>We built two types of <b>classifiers: binary </b>that focuses on building a classifier for a specific rela­tion (SRNREL) and <b>multi-class </b>methods that build classifiers for all the SRN relations (SRN). Table 1 presents the accuracy of the classifiers built using different machine learning algorithms.</p><p>The classifiers were built using lexical, seman­tic, and syntactic features of the arguments, their phrases, their clauses, their common phrase/clause, and their modifier or head phrase. The system uses WordNet, an in-house Named Entity Recognizer, and an in-house Syntactic Parser for determining the values of some of these features. Table 2 pre­sents the list of features used by the SRN classifi­ers.</p><p><b>Argument's lexical, semantic, and syntactic features: </b>the surface form, the label (POS tag or phrase label), the named entity (human, group, location, etc), the WordNet hierarchy (entity, group, abstraction, etc), the Semantic Scattering class (e.g. object, substance, etc), the grammatical role (sub­ject or object of the clause), the syntactic parser structure, the POS Pattern (the sequence of POS of the words from the argument), and the phrase pattern (the sequence of labels of <u>the phrases, words from the argument);</u>_ <b>Argument's phrase features:</b><b> </b>surface form, label, gram­<u>matical role, named entity, POS pattern, Phrase patterns; </u><b>Argument's Modifier/Head features: </b>the label, surface forms, NE, and WN Hierarchy for the first modifier, post <u>modifier, pre-modifier, and head;</u> <b>Arguments' common tree node features:</b><b> </b>label, named entity, grammatical role, POS pattern, and phrase pattern, <u>the tree path between arguments, and their order in tree; </u><b>Arguments' clause: </b>label, verb, voice, POS pattern, phrase <u>pattern.</u>_</p><table caption="Table 2. The list of features used for the SRN classi­fiers."></table></subsubsection><subsubsection number="2.2.2" title="Pattern-dependent Methods (SRNPAT)"><p>The second type of methods we used, were for particular patterns frequent in the training corpus. Table 3 shows the list of most frequent <b>patterns </b>in the training corpus. For having general pattern and covering the arguments that correspond to more than one node in a tree, we considered as argument the noun phrase that contains the nominal instead of the node for the nominal. 40 LCC relations and respectively Part-Whole rela­tion for the most frequent patterns from the SRN corpus (Table 3).<page local="3" global="217"/></p><table caption="Table 1. The accuracy of the SRNREL classifiers built using different machine learning algorithms." 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>Relation</b></p></td><td class="cell"><p><b>DT</b></p></td><td class="cell"><p><b>SVM</b></p></td><td class="cell"><p><b>ME</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>1</b></p></td><td class="cell"><p>52.10</p></td><td class="cell"><p>46.15</p></td><td class="cell"><p>46.67</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>2</b></p></td><td class="cell"><p>41.40</p></td><td class="cell"><p>30.76</p></td><td class="cell"><p>60.00</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>3</b></p></td><td class="cell"><p>61.70</p></td><td class="cell"><p>51.61</p></td><td class="cell"><p>63.33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>4</b></p></td><td class="cell"><p>59.30</p></td><td class="cell"><p>52.17</p></td><td class="cell"><p>53.33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>5</b></p></td><td class="cell"><p>58.60</p></td><td class="cell"><p>39.99</p></td><td class="cell"><p>50.00</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>6</b></p></td><td class="cell"><p>71.70</p></td><td class="cell"><p>24.99</p></td><td class="cell"><p>73.33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>7</b></p></td><td class="cell"><p>50.00</p></td><td class="cell"><p>57.13</p></td><td class="cell"><p>43.33</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Avg</b></p></td><td class="cell"><p>56.40</p></td><td class="cell"><p>43.26</p></td><td class="cell"><p>55.71</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><p><b><u>Pattern name</u></b></p><p>Noun compounds: NN1 NN2</p><doubt alpha="100.0" length="7" tooSmall="False" monospace="0.0">Example</doubt><p>If you are cleaning a <i>&lt;e1&gt;coffee&lt;/e1&gt; &lt;e2&gt;maker&lt;/e2&gt; </i>that hasn't been cleaned regularl271076ad y, repeat this step again with a fresh <u>vinegar and water mixture.</u>_</p><p>Of-genitives:</p><doubt alpha="60.0" length="10" tooSmall="False" monospace="0.0">NP1 of NP2</doubt><p>S-genitives: NP1 's NP2</p><p>Prepositional constructions: NP1 IN NP2</p><p>Verbal construc­tions:</p><doubt alpha="66.7" length="9" tooSmall="False" monospace="0.0">NP1VB NP2</doubt><p>Verbal preposi­tional construc­tions:</p><doubt alpha="61.5" length="13" tooSmall="False" monospace="0.0">NP1 VB IN NP2</doubt><p>The incoming <i>&lt;e1&gt;chairman&lt;/e1&gt; </i>of <i>the &lt;e2&gt;committee&lt;/e2&gt; </i>is promising an array of oversight investigations that could provoke sharp disagreement with Republicans and the White</p><doubt alpha="71.4" length="7" tooSmall="False" monospace="0.0">House._</doubt><p>This is the <i>&lt;e1&gt;government&lt;/e1&gt;s &lt;e2&gt;effort&lt;/e2&gt; </i>to encourage more employers to open up childcare centres at the respective ministries and gov­<u>ernment departments.</u>_</p><p>I believe that unless we take this issue seriously, the red squirrel is facing eventual <i>&lt;e1&gt;extinction&lt;/e1&gt; </i>from <i><u>the &lt;e2&gt;woods&lt;/e2&gt; of Scotland. </u></i>On both of my systems, <i>the &lt;e1&gt;reboot&lt;/e1&gt; </i>produced <i>the omi­nous &lt;e2&gt;message&lt;/e2&gt; 'Missing</i> <i><u>operating system '.</u></i><i><u></u>_</i></p><p>Manila radio station DZMM quoted survivors as saying that <i>the &lt;e1 &gt;fre&lt;/e1 &gt; </i>started with <i>an &lt;e2&gt;explosion&lt;/e2&gt; </i>in the cargo hold and spread across the ship within min­utes.</p><table caption="Table 3. The training corpus."></table><p>most frequent patterns found in the</p><p>For the pattern-dependent methods we adapted some of our existing binary and multi-class <b>classi­fiers </b>to work with the SRN relations.</p><p>For the SRN system we used only one <b>binary </b>classifier built for the Part-Whole relation (relation 6) using the ISS learning algorithm and trained/tested on the examples used in (Girju, Badulescu, and Moldovan, 2006) and different <b>multi-class </b>classifiers for the first 4 patterns from algorithms trained on a corpus annotated with 40 semantic relations (extracted from Wall Street Journal articles from the TreeBank collection and LATimes articles from TREC 9 collection) that includes the 7 SRN relations (or equivalents). (Badulescu, 2004) gives more details on this list of relations (definitions, examples, distribution on corpus, etc). Table 4 shows the <b>accuracy </b>of these classifiers on other WSJ and LAT articles for the the list of 40 LCC relations and the Part-Whole Rela­tion.</p><table caption="Table 3 built using DT, SVM, SS, and NB learning"></table><table caption="Table 4. The accuracy of the SRNPAT classifiers for"></table></subsubsection></subsection><subsection number="2.3" title="Relation Selection"><p>Any of the SRN or SRNPAT classifiers can return a relation for a pair of arguments. The best relation is selected by weighting them using the following predefined rules:</p><p>■ The relations returned by the SRN classifiers weight more than the ones returned by SRNPAT classifiers because they were trained on the task annotated examples</p><p>■ The relations returned by the binary classifiers weight more than the ones returned by multi-class classifiers because they focus on one relation and therefore are more precise.</p></subsection></section><section number="3" title="Experimental Results"><subsection number="3.1" title="Experiments on Testing"><p>During the competition we performed several experiments to assess the correct combination of classifiers that leads to the best results.</p><p>The organizer provided 140 examples for each of the 7 relations. For testing the classifiers we trained the system on the first 110 examples and tested it on the last 30 of them.</p><p>We performed different sets of experiments.</p><p>■ <b>Experiments with one type of classifiers. </b>These experiments showed that ME has a best per­formance (55.1) 10.05 more than DT and 8.05 more than SV. ME also got the highest score for Cause-Effect, while DT obtained the best score for Product-Producer.</p><p>■ <b>Experiments with multiple classifiers. </b>These experiments showed that DT+SV+SS+ISS has the best score (66.72) followed by DT+SS+ISS with 55.66. Also by adding the SS and ISS classifiers the DT score increased with 10.51, the SV score with 5.81 and the DT+SV with 20.57.</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></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Pattern cluster</b></p></td><td class="cell"><p><b>SS</b></p></td><td class="cell"><p><b>DT</b></p></td><td class="cell"><p><b>NB</b></p></td><td class="cell"><p><b>SVM</b></p></td><td class="cell"><p><b>ISS</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Noun compounds</p></td><td class="cell"><p>52.54</p></td><td class="cell"><p>47.8</p></td><td class="cell"><p>53.45</p></td><td class="cell"><p>74.79</p></td><td class="cell"><p>73.59</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>S-genitives</p></td><td class="cell"><p>62.27</p></td><td class="cell"><p>56.2</p></td><td class="cell"><p>58.27</p></td><td class="cell"><p>72.66</p></td><td class="cell"><p>87.26</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Of-genitives</p></td><td class="cell"><p>67.55</p></td><td class="cell"><p>53.1</p></td><td class="cell"><p>54.63</p></td><td class="cell"><p>72</p></td><td class="cell"><p>87.26</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Prepositional con­structions</p></td><td class="cell"><p>43.48</p></td><td class="cell"><p>43.3</p></td><td class="cell"><p>41.92</p></td><td class="cell"><p>64.52</p></td><td class="cell"><p>75.97</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><page local="4" global="218"/><p><b>■ Experiments with types of methods. </b>These experiments showed that the SRN methods (with a score 0.44) are better than the SRNPAT methods (with a score of 0.41) with 0.03 which was ex­pected since SRN were trained on provided exam­ples.</p><p>Table 5 shows the results of our SRN system when using specific classifiers or a combination of classifiers. The time did not permit us to do any experiments with the ME and NB classifiers.</p><p>Table 5. The results of some of our experiments with the different classifiers on the testing corpus.</p><p>We submitted the DT+SS+ISS version because of its closeness to the normal distribution rather than DT+SV+SS+ISS that had a better f-measure but it was closer to All-True. The evaluation re­sults showed that the testing examples we used were representative and the DT+SV+SS+ISS pro­duce better results.</p></subsection><subsection number="3.2" title="Results"><p>Table 6 shows the results obtained by our sys­tem on the evaluation corpus for the B4 case (using WordNet but not the query and all the training ex­amples.</p><p>Table 7 shows a comparison of our results with the following baseline systems: <b><i>All-True, </i></b>a system that always returns true, <b><i>Majority, </i></b>a system that always returns the majority value from the training, and <b><i>Prob-Match, </i></b>a system that randomly generate the value. We have obtained a larger precision and accuracy than the All-True and the Prob-Match systems. However, we obtained a lower recall and therefore an F-measure.</p></subsection><subsection number="3.3" title="Discussions"><p>The results are promising. However, there is still room for improvement. The system was developed in a limited time, and therefore it could have been benefited from more features, feature selection, more experiments, a more complex relation selec­tion scheme (using learning), more patterns, and more types of machine learning algorithms (espe­cially unsupervised ones).</p></subsection></section><section number="4" title="Conclusion"><p>We presented a system for classifying the semantic relations between nominals that combines the re­sults of different methods (pattern-dependent or pattern-independent) and machine learning algo­rithms (decision tree, support vector machines, se­mantic scattering, maximum entropy, naïve bayes, etc). The classifiers use lexical, semantic, and syn­tactic features and external resources like WordNet and an in-house Named Entity dictionary.</p><table caption="Table 7. Comparison with the baselines." 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><b>System</b></p></td><td class="cell"><p><b>Preci­sion</b></p></td><td class="cell"><p><b>Recall</b></p></td><td class="cell"><p><b>F-measure</b></p></td><td class="cell"><p><b>Accuracy</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>All-True</b></p></td><td class="cell"><p>48.5</p></td><td class="cell"><p>100.0</p></td><td class="cell"><p>64.8</p></td><td class="cell"><p>48.5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Majority</b></p></td><td class="cell"><p>81.3</p></td><td class="cell"><p>42.9</p></td><td class="cell"><p>30.8</p></td><td class="cell"><p>57.0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Prob-Match</b></p></td><td class="cell"><p>48.5</p></td><td class="cell"><p>48.5</p></td><td class="cell"><p>48.5</p></td><td class="cell"><p>51.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>LCC-SRN</b></p></td><td class="cell"><p>55.9</p></td><td class="cell"><p>57.8</p></td><td class="cell"><p>51.4</p></td><td class="cell"><p>53.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table 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>Classifier Combination</b></p></td><td class="cell"><p><b>Average F-measure</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>DT</b></p></td><td class="cell"><p>45.05</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SV</b></p></td><td class="cell"><p>47.05</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>ME</b></p></td><td class="cell"><p>55.10</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>DT+SV</b></p></td><td class="cell"><p>46.15</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>DT+SS+ISS</b></p></td><td class="cell"><p><i>55.66</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SV+SS+ISS</b></p></td><td class="cell"><p>52.96</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>DT+SV+SS+ISS</b></p></td><td class="cell"><p>66.72</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SRN</b></p></td><td class="cell"><p>44.31</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>SRNPAT</b></p></td><td class="cell"><p>41.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></tr></table><table caption="Table 6. The results of our system on the evaluation corpus." 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><b>Relation</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>F-measure</b></p></td><td class="cell"><p><b>Accuracy</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>1</b></p></td><td class="cell"><p>50.8</p></td><td class="cell"><p>73.2</p></td><td class="cell"><p>60.0</p></td><td class="cell"><p>50.0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>2</b></p></td><td class="cell"><p>54.5</p></td><td class="cell"><p>31.6</p></td><td class="cell"><p>40.0</p></td><td class="cell"><p>53.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>3</b></p></td><td class="cell"><p>66.7</p></td><td class="cell"><p>100.0</p></td><td class="cell"><p>80.0</p></td><td class="cell"><p>66.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>4</b></p></td><td class="cell"><p>80.0</p></td><td class="cell"><p>22.2</p></td><td class="cell"><p>34.8</p></td><td class="cell"><p>63.0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>5</b></p></td><td class="cell"><p>42.2</p></td><td class="cell"><p>65.5</p></td><td class="cell"><p>51.4</p></td><td class="cell"><p>42.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>6</b></p></td><td class="cell"><p>39.6</p></td><td class="cell"><p>80.8</p></td><td class="cell"><p>53.2</p></td><td class="cell"><p>48.6</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>7</b></p></td><td class="cell"><p>57.1</p></td><td class="cell"><p>31.6</p></td><td class="cell"><p>40.7</p></td><td class="cell"><p>51.4</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>55.9</p></td><td class="cell"><p>57.8</p></td><td class="cell"><p>51.4</p></td><td class="cell"><p>53.7</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></section><references><p>Adriana Badulescu. 2004. Classification of Semantic Relations between Nouns. PhD Dissertation. Univer­sity of Texas at Dallas.</p><p>Dan Moldovan and Adriana Badulescu. 2005. A Seman­tic Scattering Model for the Automatic Interpretation of Genitives. In <i>Proceedings of HLT/EMNLP 2005.</i></p><p>Roxana Girju, Adriana Badulescu, and Dan Moldovan. 2006. Automatic Discovery of Part-Whole Relations.</p><p><i>Computation Linguistics, </i>32:1.</p><p>Roxana Girju et al. 2007. Classification of Semantic Relations between Nominals: Description of Task 4 in SemEval-1, In <i>Proceedings of ACL-2007, SemE-val-1 Workshop.</i></p></references></body></article>