|
{ |
|
"paper_id": "R11-1045", |
|
"header": { |
|
"generated_with": "S2ORC 1.0.0", |
|
"date_generated": "2023-01-19T15:04:28.046060Z" |
|
}, |
|
"title": "Combining Relational and Attributional Similarity for Semantic Relation Classification", |
|
"authors": [ |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "", |
|
"affiliation": { |
|
"laboratory": "", |
|
"institution": "National University of Singapore", |
|
"location": { |
|
"addrLine": "13 Computing Drive", |
|
"postCode": "117417", |
|
"country": "Singapore" |
|
} |
|
}, |
|
"email": "nakov@comp.nus.edu.sg" |
|
}, |
|
{ |
|
"first": "Zornitsa", |
|
"middle": [], |
|
"last": "Kozareva", |
|
"suffix": "", |
|
"affiliation": {}, |
|
"email": "kozareva@isi.edu" |
|
} |
|
], |
|
"year": "", |
|
"venue": null, |
|
"identifiers": {}, |
|
"abstract": "We combine relational and attributional similarity for the task of identifying instances of semantic relations, such as PRODUCT-PRODUCER and ORIGIN-ENTITY, between nominals in text. We use no pre-existing lexical resources, thus simulating a realistic real-world situation, where the coverage of any such resource is limited. Instead, we mine the Web to automatically extract patterns (verbs, prepositions and coordinating conjunctions) expressing the relationship between the relation arguments, as well as hypernyms and co-hyponyms of the arguments, which we use in instance-based classifiers. The evaluation on the dataset of SemEval-1 Task 4 shows an improvement over the state-ofthe-art for the case where using manually annotated WordNet senses is not allowed.", |
|
"pdf_parse": { |
|
"paper_id": "R11-1045", |
|
"_pdf_hash": "", |
|
"abstract": [ |
|
{ |
|
"text": "We combine relational and attributional similarity for the task of identifying instances of semantic relations, such as PRODUCT-PRODUCER and ORIGIN-ENTITY, between nominals in text. We use no pre-existing lexical resources, thus simulating a realistic real-world situation, where the coverage of any such resource is limited. Instead, we mine the Web to automatically extract patterns (verbs, prepositions and coordinating conjunctions) expressing the relationship between the relation arguments, as well as hypernyms and co-hyponyms of the arguments, which we use in instance-based classifiers. The evaluation on the dataset of SemEval-1 Task 4 shows an improvement over the state-ofthe-art for the case where using manually annotated WordNet senses is not allowed.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Abstract", |
|
"sec_num": null |
|
} |
|
], |
|
"body_text": [ |
|
{ |
|
"text": "Recently, the natural language processing (NLP) community has shown renewed interest in the problem of deep language understanding, which was inspired by the notable progress in this important research direction in the last few years. Today, lexical semantics tasks such as word sense disambiguation, semantic role labeling, and textual entailment are already well-established and are gradually finding their way in real NLP applications, while a number of new semantic tasks are emerging. One such example is the task of extracting semantic relations between nominals from text, which has attracted a lot of research attention following the creation of two benchmark datasets as part of SemEval-1 Task 4 (Girju et al., 2007) and SemEval-2 Task 8 (Hendrickx et al., 2010) .", |
|
"cite_spans": [ |
|
{ |
|
"start": 705, |
|
"end": 725, |
|
"text": "(Girju et al., 2007)", |
|
"ref_id": "BIBREF4" |
|
}, |
|
{ |
|
"start": 747, |
|
"end": 771, |
|
"text": "(Hendrickx et al., 2010)", |
|
"ref_id": "BIBREF7" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "The ability to recognize semantic relations in text could potentially help many NLP applications. For example, a question answering system facing the question What causes tumors to shrink? would need to identify the CAUSE-EFFECT relation between shrinkage and radiation in order to be able to extract the answer from the following sentence: The period of tumor shrinkage after radiation therapy is often long and varied. One can also imagine a relational search engine that can serve queries such as \"find all X such that X causes wrinkles\", asking for all entities that are in a particular relation with a given entity (Cafarella et al., 2006) . Finally, modeling semantic relations has been shown to help statistical machine translation (Nakov, 2008a) .", |
|
"cite_spans": [ |
|
{ |
|
"start": 620, |
|
"end": 644, |
|
"text": "(Cafarella et al., 2006)", |
|
"ref_id": "BIBREF0" |
|
}, |
|
{ |
|
"start": 739, |
|
"end": 753, |
|
"text": "(Nakov, 2008a)", |
|
"ref_id": "BIBREF17" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "The task of identifying semantic relations in text is complicated by their heterogeneous nature. Thus, it is often addressed using non-parametric instance-based classifiers like the k nearest neighbors (kNN), which effectively reduce it to measuring the relational similarity between a testing and each of the training examples. The latter is studied in detail by Turney (2006) , who distinguishes between attributional similarity or correspondence between attributes, and relational similarity or correspondence between relations. Attributional similarity is interested in the similarity between two words (or nominals, noun phrases), A and B. In contrast, relational similarity focuses on the relationship between two pairs of words (or nominals, noun phrases), i.e., it asks how similar the relations A:B and C:D are. Measuring relational similarity directly is hard, and thus it is rarely done directly. Instead, relational similarity is typically modeled as a function of two instances of attributional similarity: (1) between A and C, and (2) between B and D.", |
|
"cite_spans": [ |
|
{ |
|
"start": 364, |
|
"end": 377, |
|
"text": "Turney (2006)", |
|
"ref_id": "BIBREF27" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "Going back to semantic relations, there is a similar split between two general lines of research. The first one learns the relation directly, e.g., using suitable patterns that can connect the arguments (Hearst, 1992; Turney and Littman, 2005; Nakov and Hearst, 2006; Kim and Baldwin, 2006; Pantel and Pennacchiotti, 2006; Davidov and Rappoport, 2008; Nakov, 2008b; Nakov and Hearst, 2008; Katrenko et al., 2010) . This is useful for context-dependent relations like CAUSE-EFFECT, which are dynamic and often episodic in nature, e.g., My Friday's exam causes me anxiety. The second line focuses on the arguments, e.g., by generalizing them over a lexical hierarchy (Rosario et al., 2002; Girju et al., 2005; Kim and Baldwin, 2007; \u00d3 S\u00e9aghdha, 2009) . This works well for relations like PART-WHOLE, which are more permanent and context-independent, e.g., door-car.", |
|
"cite_spans": [ |
|
{ |
|
"start": 203, |
|
"end": 217, |
|
"text": "(Hearst, 1992;", |
|
"ref_id": "BIBREF6" |
|
}, |
|
{ |
|
"start": 218, |
|
"end": 243, |
|
"text": "Turney and Littman, 2005;", |
|
"ref_id": "BIBREF26" |
|
}, |
|
{ |
|
"start": 244, |
|
"end": 267, |
|
"text": "Nakov and Hearst, 2006;", |
|
"ref_id": "BIBREF15" |
|
}, |
|
{ |
|
"start": 268, |
|
"end": 290, |
|
"text": "Kim and Baldwin, 2006;", |
|
"ref_id": "BIBREF10" |
|
}, |
|
{ |
|
"start": 291, |
|
"end": 322, |
|
"text": "Pantel and Pennacchiotti, 2006;", |
|
"ref_id": "BIBREF22" |
|
}, |
|
{ |
|
"start": 323, |
|
"end": 351, |
|
"text": "Davidov and Rappoport, 2008;", |
|
"ref_id": "BIBREF1" |
|
}, |
|
{ |
|
"start": 352, |
|
"end": 365, |
|
"text": "Nakov, 2008b;", |
|
"ref_id": "BIBREF18" |
|
}, |
|
{ |
|
"start": 366, |
|
"end": 389, |
|
"text": "Nakov and Hearst, 2008;", |
|
"ref_id": "BIBREF16" |
|
}, |
|
{ |
|
"start": 390, |
|
"end": 412, |
|
"text": "Katrenko et al., 2010)", |
|
"ref_id": "BIBREF9" |
|
}, |
|
{ |
|
"start": 665, |
|
"end": 687, |
|
"text": "(Rosario et al., 2002;", |
|
"ref_id": "BIBREF24" |
|
}, |
|
{ |
|
"start": 688, |
|
"end": 707, |
|
"text": "Girju et al., 2005;", |
|
"ref_id": "BIBREF3" |
|
}, |
|
{ |
|
"start": 708, |
|
"end": 730, |
|
"text": "Kim and Baldwin, 2007;", |
|
"ref_id": "BIBREF11" |
|
}, |
|
{ |
|
"start": 731, |
|
"end": 748, |
|
"text": "\u00d3 S\u00e9aghdha, 2009)", |
|
"ref_id": null |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "An important advantage of argument modeling approaches is that they can benefit from many preexisting lexical resources. For example, systems using WordNet (Fellbaum, 1998) had sizable performance gains for SemEval-1 Task 4. However, this advantage was mainly due to manually annotated WordNet senses for the relation arguments being provided for this task. There was a restricted track where using them was not allowed: this track was dominated by relation modeling approaches.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "Relation and argument modeling have their strengths and weaknesses, but there have been little attempts to combine them, which is our main objective. We use no lexical resources, thus simulating a realistic real-world situation, where the coverage of any such resource is limited. Instead, we mine the Web to extract linguistic patterns expressing the relation (verbs, prepositions, and coordinating conjunctions), as well as hypernyms and co-hyponyms of its arguments. We combine (a) relational and (b) attributional similarity between (i) the first and (ii) the second argument, 1 using weights that are tuned separately for each individual relation.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "While semantic relations can hold between different parts of speech, e.g., between a verb and a noun, we focus on relations between nominals. 2 The most relevant related publication is that of O S\u00e9aghdha and Copestake (2009) , who combine attributional and relational features using kernels. However, they are interested in a special kind of relations: between the nouns in a noun-noun compounds like steel knife. Moreover, they use the British National Corpus instead of the Web, which is known to cause data sparseness issues (Lapata and Keller, 2004) , they do not focus on linguistically motivated relational features such as verbs and prepositions explicitly, they use co-hyponyms but not hypernyms to generalize the relation arguments, and they give equal weights to the similarities between heads and between modifiers.", |
|
"cite_spans": [ |
|
{ |
|
"start": 142, |
|
"end": 143, |
|
"text": "2", |
|
"ref_id": null |
|
}, |
|
{ |
|
"start": 195, |
|
"end": 224, |
|
"text": "S\u00e9aghdha and Copestake (2009)", |
|
"ref_id": "BIBREF19" |
|
}, |
|
{ |
|
"start": 528, |
|
"end": 553, |
|
"text": "(Lapata and Keller, 2004)", |
|
"ref_id": "BIBREF13" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "The remainder of the paper is organized as follows: Section 2 introduces our Web mining methods for argument and relation modeling, Section 3 presents our experimental setup, Section 4 discusses the results, and Section 5 concludes and points to some directions for future work.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Introduction", |
|
"sec_num": "1" |
|
}, |
|
{ |
|
"text": "As we said above, we combine argument modeling and relation modeling for the task of extracting semantic relations between nominals from text.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Method 2.1 Overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "Given the heterogeneous nature of semantic relations, we use a non-parametric instance-based classifier: kNN. This effectively reduces the task to measuring the relational similarity between a given testing example and each of the training examples: we first need to find the training example that is most similar to the target testing example; then we assume they should have the same label.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Method 2.1 Overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "For argument modeling, we generalize the arguments of each training/testing example using a set of possible hypernyms and co-hyponyms. For example, given the guy who makes coffee, which is an instance of the PRODUCT-PRODUCER relation, we generate a list of potential hypernyms such as drink and beverage for coffee, and person and human for guy. We further generate cohyponyms for the arguments, e.g., tea and milk for coffee, and girl and boy for guy. These hypernyms and co-hyponyms are extracted from the Web and there is a frequency of extraction associated with each of them, which we use to build a hypernym/co-hyponym frequency vector for each argument and for each example. We then use these argument vectors to measure attributional similarity between training and testing examples.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Method 2.1 Overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "For relation modeling, we mine the Web to find verbs, prepositions and coordinating conjunctions that can express the typical relationship between the arguments of the target example, e.g., we generate verbs like make and brew, prepositions like with, and coordinating conjunctions like and for the arguments guy and coffee of the guy who makes coffee. Again, the paraphrasing verbs and prepositions and the coordinating conjunctions are extracted from the Web, and there is a frequency of extraction associated with each of them, which we incorporate into a relational vector and use to measure relational similarity between training and testing examples.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Method 2.1 Overview", |
|
"sec_num": "2" |
|
}, |
|
{ |
|
"text": "We model the arguments using a distribution over Web-derived hypernyms and co-hyponyms.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "Multiple knowledge harvesting procedures have been proposed in the literature for the automatic acquisition of hyponyms (Hearst, 1992; Pa\u015fca, 2007; Kozareva et al., 2008) and hypernyms (Ritter et al., 2009; Hovy et al., 2009) .", |
|
"cite_spans": [ |
|
{ |
|
"start": 120, |
|
"end": 134, |
|
"text": "(Hearst, 1992;", |
|
"ref_id": "BIBREF6" |
|
}, |
|
{ |
|
"start": 135, |
|
"end": 147, |
|
"text": "Pa\u015fca, 2007;", |
|
"ref_id": "BIBREF21" |
|
}, |
|
{ |
|
"start": 148, |
|
"end": 170, |
|
"text": "Kozareva et al., 2008)", |
|
"ref_id": "BIBREF12" |
|
}, |
|
{ |
|
"start": 185, |
|
"end": 206, |
|
"text": "(Ritter et al., 2009;", |
|
"ref_id": "BIBREF23" |
|
}, |
|
{ |
|
"start": 207, |
|
"end": 225, |
|
"text": "Hovy et al., 2009)", |
|
"ref_id": "BIBREF8" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "While we could have used any of them for our experiments, we chose the method of Kozareva et al. (2008) , which (i) can extract hypernyms and hyponyms simultaneously, (ii) has been shown to achieve higher accuracy than the methods described in (Pa\u015fca, 2007; Ritter et al., 2009) , and also (iii) is easy to implement. It uses a doublyanchored pattern (DAP) of the following general form:", |
|
"cite_spans": [ |
|
{ |
|
"start": 81, |
|
"end": 103, |
|
"text": "Kozareva et al. (2008)", |
|
"ref_id": "BIBREF12" |
|
}, |
|
{ |
|
"start": 244, |
|
"end": 257, |
|
"text": "(Pa\u015fca, 2007;", |
|
"ref_id": "BIBREF21" |
|
}, |
|
{ |
|
"start": 258, |
|
"end": 278, |
|
"text": "Ritter et al., 2009)", |
|
"ref_id": "BIBREF23" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "\"sem-class such as term 1 and term 2 \"", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "where sem-class stands for a semantic class, and term 1 and term 2 are members of this class.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "In our experiments, we use the following twoplaceholder form of DAP, which takes only one noun as a parameter and simultaneously extracts pairs of its hypernyms and co-hyponyms: \"* such as noun and *\"", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "We execute the pattern against Google, trying both a plural and a singular form of noun, and we collect the returned snippets. Then, we extract the terms from the * positions, and we build a frequency vector of hypernyms and co-hyponyms. Table 1 shows an example for coffee guy.", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 238, |
|
"end": 245, |
|
"text": "Table 1", |
|
"ref_id": "TABREF0" |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Argument Modeling", |
|
"sec_num": "2.2" |
|
}, |
|
{ |
|
"text": "We model the relation itself as a distribution over Web-derived verbs, prepositions, and coordinating conjunctions that can connect the target nouns. Following Nakov and Hearst (2008) , we use generalized patterns of the form: \"noun1 THAT? * noun2\" \"noun2 THAT? * noun1\"", |
|
"cite_spans": [ |
|
{ |
|
"start": 160, |
|
"end": 183, |
|
"text": "Nakov and Hearst (2008)", |
|
"ref_id": "BIBREF16" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Relation Modeling", |
|
"sec_num": "2.3" |
|
}, |
|
{ |
|
"text": "where noun1 and noun2 are inflected variants of the head nouns in the relation arguments, THAT? stands for that, which, who or the empty string, and * stands for up to eight instances 3 of the search engine's star operator.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Relation Modeling", |
|
"sec_num": "2.3" |
|
}, |
|
{ |
|
"text": "We instantiate these generalized patterns and we submit them to Google as exact phrase queries. We then collect the snippets for all returned results (up to 1,000). We split the extracted snippets into sentences, and we filter out all incomplete ones and those that do not contain the target nouns. We POS tag the sentences using the Stanford POS tagger (Toutanova et al., 2003) and we make sure that the word sequence following the second mentioned target noun is non-empty and contains at least one non-noun, i.e., that the snippet includes the entire noun phrase of the second noun in the pattern instantiation. This is because we want the second noun in the pattern instantiation to be the head of an NP: if the NP in incomplete, the second noun could be a modifier in that partial NP. We then run the OpenNLP tools 4 to shallow parse the sentences and to extract the verbs, prepositions and coordinating conjunctions connecting the two nouns. Finally, we lemmatize all extracted verbs. As a result, we end up with quadruples, each of which includes the following: (i) a pattern, i.e., a lemmatized verb, a preposition, or a coordinating conjunction, (ii) a pattern type, i.e., V for verb, P for preposition, or C for coordinating conjunction, (iii) direction, i.e., relative order of the arguments in the pattern (R marks reverse), and (iv) frequency of extraction.", |
|
"cite_spans": [ |
|
{ |
|
"start": 354, |
|
"end": 378, |
|
"text": "(Toutanova et al., 2003)", |
|
"ref_id": "BIBREF25" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Relation Modeling", |
|
"sec_num": "2.3" |
|
}, |
|
{ |
|
"text": "We concatenate the first three components of these quadruples to form typed directed patterns. We then build frequency vectors for them using the frequency of extraction to represent the semantics of the relation itself. Table 2 shows the resulting relational vector for coffee guy.", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 221, |
|
"end": 228, |
|
"text": "Table 2", |
|
"ref_id": "TABREF2" |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Relation Modeling", |
|
"sec_num": "2.3" |
|
}, |
|
{ |
|
"text": "In this section, we describe the dataset, the classifier, the similarity measures, and the way we combine relational and attributional similarity.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experiments and Evaluation", |
|
"sec_num": "3" |
|
}, |
|
{ |
|
"text": "We use with the dataset from SemEval-1 Task 4 on Classification of Semantic Relations between Nominals (Girju et al., 2009) , which is the most popular dataset for our problem; using it allows for a direct comparison to state-of-the-art systems that were evaluated on it.", |
|
"cite_spans": [ |
|
{ |
|
"start": 103, |
|
"end": 123, |
|
"text": "(Girju et al., 2009)", |
|
"ref_id": "BIBREF5" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Dataset", |
|
"sec_num": "3.1" |
|
}, |
|
{ |
|
"text": "Each example in the dataset consists of a sentence annotated with two target nominals, e 1 and e 2 , which are to be judged on whether they are in a given target relation or not. In addition, manually annotated WordNet 3.0 senses for these nominals are provided. The Web query the task organizers used to mine the sentence from the Web is also made available.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Dataset", |
|
"sec_num": "3.1" |
|
}, |
|
{ |
|
"text": "Here is a fully annotated training example (note that, for the test examples, the \"true\"/\"false\" labels are hidden from the system):", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Dataset", |
|
"sec_num": "3.1" |
|
}, |
|
{ |
|
"text": "\"The production assistant is basically the <e1>guy</e1> who makes <e2>coffee</e2> and goes to the post office.\" WordNet(e1) = \"guy%1:18:00::\", WordNet(e2) = \"coffee%1:13:00::\", Origin-Entity(e2, e1) = \"true\", Query = \"the * makes * coffee\"", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Dataset", |
|
"sec_num": "3.1" |
|
}, |
|
{ |
|
"text": "In our experiments, we ignored the WordNet senses and the Web query since having them is unrealistic for a real-world application. Table 3 shows the seven semantic relations defined by the task along with the positive/negative instance distribution and one example instance for each relation. In SemEval-1 Task 4, each relation is considered in isolation, i.e., there are seven separate classification tasks, and there are separate training and testing datasets for each of them. For each relation, the examples are annotated with true/false labels, depending on whether they are instances of the relation. Each of the seven datasets consists of 140 training and 71-93 testing examples per relation, approximately 50% of which are positive.", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 131, |
|
"end": 138, |
|
"text": "Table 3", |
|
"ref_id": "TABREF4" |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Dataset", |
|
"sec_num": "3.1" |
|
}, |
|
{ |
|
"text": "Due to the small size of the individual training datasets and because of the heterogeneity of the examples, we found it hard to train a good model such as SVM or logistic regression. Therefore, we opted for a non-parametric classifier: kNN, and more precisely, 1-nearest-neighbor. Because of its sensitivity to the similarity function, we experimented with three weighting schemes: (1) frequency, (2) TF.IDF, and (3) TF.IDF with addone smoothing for the IDF part. Each of these schemes was combined with the following cosine and Dice similarity functions: ", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Classifier and Similarity Measures", |
|
"sec_num": "3.2" |
|
}, |
|
{ |
|
"text": "EQUATION", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [ |
|
{ |
|
"start": 0, |
|
"end": 8, |
|
"text": "EQUATION", |
|
"ref_id": "EQREF", |
|
"raw_str": "cosine(A, B) = \u2211 n i=1 a i b i \u221a \u2211 n i=1 a 2 i \u221a \u2211 n i=1 b 2 i (1) Dice(A, B) = 2 \u00d7 \u2211 n i=1 min(a i , b i ) \u2211 n i=1 a i + \u2211 n i=1 b i", |
|
"eq_num": "(2)" |
|
} |
|
], |
|
"section": "Classifier and Similarity Measures", |
|
"sec_num": "3.2" |
|
}, |
|
{ |
|
"text": "We further experimented with the informationtheoretic similarity measure of Lin (1998) .", |
|
"cite_spans": [ |
|
{ |
|
"start": 76, |
|
"end": 86, |
|
"text": "Lin (1998)", |
|
"ref_id": "BIBREF14" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Classifier and Similarity Measures", |
|
"sec_num": "3.2" |
|
}, |
|
{ |
|
"text": "For each example in the SemEval-1 Task 4 dataset, we removed all modifiers from the target entities e 1 and e 2 , retaining their head nouns only; below we will still refer to them as e 1 and e 2 though. We then mined the Web to extract features, as described in Section 2 above:", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "(1) relational features: verbs, prepositions, and coordinating conjunctions connecting e 1 and e 2 (see Table 2 );", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 104, |
|
"end": 111, |
|
"text": "Table 2", |
|
"ref_id": "TABREF2" |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "(2) attributional features: hypernyms and cohyponyms of e 1 and e 2 (see Table 1 ).", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 73, |
|
"end": 80, |
|
"text": "Table 1", |
|
"ref_id": "TABREF0" |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "We used the type (1) features as a baseline, and we studied the impact of combining them with type (2) features using the following five linear weights: w mod for the modifier, w head for the head, w rel for the relation, w hyp for the hypernyms, and w coh for the co-hyponyms.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "We tuned the values of these parameters using leave-one-out cross-validation on the development set, trying all values in [0.0; 1.0] with a step of 0.1, subject to the following two constraints:", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "w mod + w head + w rel = 1 w hyp + w coh = 1", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "These tuned weights were then used to calculate the final similarity score s as follows:", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "s = w mod s m + w head s h + w rel s r s m = w hyp s hyp (m 1 , m 2 ) + w coh s coh (m 1 , m 2 ) s h = w hyp s hyp (h 1 , h 2 ) + w coh s coh (h 1 , h 2 )", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "where s hyp (m 1 , m 2 ) is the similarity between the hypernyms of the modifiers, s coh (m 1 , m 2 ) is the similarity between the co-hyponyms of the modifiers, s hyp (h 1 , h 2 ) is the similarity between the hypernyms of the heads, s coh (h 1 , h 2 ) is the similarity between the co-hyponyms of the heads, and s r is the relational similarity.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "We also did two restricted experiments: (a) with hypernyms only, i.e., setting w hyp = 1, and (b) with co-hyponyms only, i.e., setting w coh = 1.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Experimental Setup", |
|
"sec_num": "3.3" |
|
}, |
|
{ |
|
"text": "Following the experimental setup for SemEval-1 Task 4, we trained and evaluated a separate system for each of the seven relations.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "The macro-averaged accuracy over all relations is shown in Table 4 . Several interesting observations can be made about it. First, we can see consistent improvements over the corresponding baseline for all three combined systems, for all similarity measures and for all weighting schemes, ranging from 0.5% to 19.5% absolute. Second, in 15 of the 21 experimental conditions involving attributional patterns, the improvements over the corresponding baselines are statistically significant as measured by the \u03c7 2 test. Third, we improve by 1.4% absolute even over our strong baseline, Dice w/ TF.IDF, smoothed, which achieves 68.1% accuracy. Note that this baseline is better than the best accuracy of 66.0% achieved at SemEval-1 Task 4 for systems of type A, which do not use the Web query or the WordNet senses (Girju et al., 2007) . Table 4 : Overall macro-averaged results for all seven relations. The baseline system uses relational patterns only, while the following systems combine relational and attributional features using linear interpolation. Shown are the accuracy and the absolute difference (in %) compared to the baseline. The highest results in each row appear in bold. Statistically significant improvements over the baseline are marked with a star.", |
|
"cite_spans": [ |
|
{ |
|
"start": 811, |
|
"end": 831, |
|
"text": "(Girju et al., 2007)", |
|
"ref_id": "BIBREF4" |
|
} |
|
], |
|
"ref_spans": [ |
|
{ |
|
"start": 59, |
|
"end": 66, |
|
"text": "Table 4", |
|
"ref_id": null |
|
}, |
|
{ |
|
"start": 834, |
|
"end": 841, |
|
"text": "Table 4", |
|
"ref_id": null |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "Fourth, our best overall accuracy of 71.3% represents a statistically significant improvement not only over our corresponding baseline of 51.8% but also over the best result of 66.0% achieved at SemEval-1 Task 4 for systems of type A. It is also higher (but no statistically significant difference) than the state-of-the-art result of Davidov and Rappoport (2008) , who achieved 70.1%.", |
|
"cite_spans": [ |
|
{ |
|
"start": 335, |
|
"end": 363, |
|
"text": "Davidov and Rappoport (2008)", |
|
"ref_id": "BIBREF1" |
|
} |
|
], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "The evaluation results for each of the seven individual relations are shown in Table 5 . We can see that not all relations benefit equally well from using attributional patterns in addition to relational ones. The most sizable improvements are for THEME-TOOL, which shows statistically significant improvements for all evaluation measures, ranging from +7.1% to +23.9% absolute. Very large consistent improvements can be also observed for PRODUCT-PRODUCER and ORIGIN-ENTITY. The results are somewhat mixed for relations like CAUSE-EFFECT, CONTENT-CONTAINER, INSTRUMENT-AGENCY and PART-WHOLE; still, the improvements are more sizable than the decreases.", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 79, |
|
"end": 86, |
|
"text": "Table 5", |
|
"ref_id": null |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "We can further see that relations like THEME-TOOL and ORIGIN-ENTITY are best characterized by the properties of their arguments, which makes them a good fit for attributional methods. In contrast, relations like INSTRUMENT-AGENCY and PRODUCT-PRODUCER, are better expressed by patterns: verbs, prepositions and coordinations.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "The weights in Table 5 suggest that, overall, the co-hyponyms are more important than the hypernyms, and the relations are typically determined primarily by the modifier and the relational similarity. There is also a lot of variety for the individual relations. For example, for THEME-TOOL, it is the head that matters most.", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 15, |
|
"end": 22, |
|
"text": "Table 5", |
|
"ref_id": null |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "Note that for two of the relations, we achieve results that are better than the best results achieved at SemEval-1 Task 4, even by systems that used WordNet and the original search engine query. In particular, for ORIGIN-ENTITY, we achieve up to 77.8% accuracy, which is statistically significantly better than the 72.8% at SemEval-1 Task 4. We also improve for THEME-TOOL, but our 74.7% is only marginally better than 74.6%.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Results and Discussion", |
|
"sec_num": "4" |
|
}, |
|
{ |
|
"text": "We have studied the combination of relational and attributional similarity for the task of semantic relation classification in text. Using the dataset for SemEval-1 Task 4, we have shown statistically significant improvements over a strong baseline that uses relational similarity only, and even a small improvement over the state-of-the-art. We have further studied the extent of the improvement across seven individual relations.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Conclusion and Future Work", |
|
"sec_num": "5" |
|
}, |
|
{ |
|
"text": "In future work, we plan to do a similar study for the dataset for SemEval-2 Task 8, where, given its size and the specifics of the relation definitions, which are much more context-dependent, we will need to model the local context, in addition to relational and attributional similarity measures. Table 5 : Results for the individual relations. The baseline uses relational patterns only; the rest combine relational and attributional patterns for hypernyms & co-hyponyms. Shown are the accuracy and the absolute difference (in %) compared to the baseline. Statistically significant improvements are marked with a star.", |
|
"cite_spans": [], |
|
"ref_spans": [ |
|
{ |
|
"start": 298, |
|
"end": 305, |
|
"text": "Table 5", |
|
"ref_id": null |
|
} |
|
], |
|
"eq_spans": [], |
|
"section": "Conclusion and Future Work", |
|
"sec_num": "5" |
|
}, |
|
{ |
|
"text": "We will call the first relation argument a modifier and the second one a head, e.g., for PART-WHOLE, the modifier will be the PART and the head will be the WHOLE.2 A nominal is a noun or a base noun phrase (NP), excluding named entities. A base NP is a noun and its premodifiers, e.g., nouns, adjectives, determiners. For example, coffee and guy are nouns, coffee boy is a base NP, but the coffee guy from our office is a complex NP and thus not a nominal.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "", |
|
"sec_num": null |
|
}, |
|
{ |
|
"text": "Using multiple instances of the star operator increases the number of possible instantiations of the generalized pattern and allows extracting additional snippets.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "", |
|
"sec_num": null |
|
}, |
|
{ |
|
"text": "OpenNLP: http://opennlp.sourceforge.net", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "", |
|
"sec_num": null |
|
} |
|
], |
|
"back_matter": [ |
|
{ |
|
"text": "This research is partially supported (for the first author) by the SmartBook project, funded by the Bulgarian National Science Fund under Grant D002-111/15.12.2008.We would like to thank the anonymous reviewers for their detailed and constructive comments, which have helped us improve the paper.", |
|
"cite_spans": [], |
|
"ref_spans": [], |
|
"eq_spans": [], |
|
"section": "Acknowledgments", |
|
"sec_num": null |
|
} |
|
], |
|
"bib_entries": { |
|
"BIBREF0": { |
|
"ref_id": "b0", |
|
"title": "Relational Web search", |
|
"authors": [ |
|
{ |
|
"first": "Michael", |
|
"middle": [], |
|
"last": "Cafarella", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Michele", |
|
"middle": [], |
|
"last": "Banko", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Oren", |
|
"middle": [], |
|
"last": "Etzioni", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2006, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Michael Cafarella, Michele Banko, and Oren Etzioni. 2006. Relational Web search. Technical Report 2006-04-02, University of Washington, Department of Computer Science and Engineering.", |
|
"links": null |
|
}, |
|
"BIBREF1": { |
|
"ref_id": "b1", |
|
"title": "Classification of semantic relationships between nominals using pattern clusters", |
|
"authors": [ |
|
{ |
|
"first": "Dmitry", |
|
"middle": [], |
|
"last": "Davidov", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Ari", |
|
"middle": [], |
|
"last": "Rappoport", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2008, |
|
"venue": "Proceedings of ACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "227--235", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Dmitry Davidov and Ari Rappoport. 2008. Classifica- tion of semantic relationships between nominals us- ing pattern clusters. In Proceedings of ACL, pages 227-235.", |
|
"links": null |
|
}, |
|
"BIBREF2": { |
|
"ref_id": "b2", |
|
"title": "WordNet: An Electronic Lexical Database", |
|
"authors": [], |
|
"year": 1998, |
|
"venue": "", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Christiane Fellbaum, editor. 1998. WordNet: An Elec- tronic Lexical Database. MIT Press.", |
|
"links": null |
|
}, |
|
"BIBREF3": { |
|
"ref_id": "b3", |
|
"title": "On the semantics of noun compounds", |
|
"authors": [ |
|
{ |
|
"first": "Roxana", |
|
"middle": [], |
|
"last": "Girju", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Dan", |
|
"middle": [], |
|
"last": "Moldovan", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Marta", |
|
"middle": [], |
|
"last": "Tatu", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Daniel", |
|
"middle": [], |
|
"last": "Antohe", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2005, |
|
"venue": "Comput. Speech Lang", |
|
"volume": "4", |
|
"issue": "19", |
|
"pages": "479--496", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Roxana Girju, Dan Moldovan, Marta Tatu, and Daniel Antohe. 2005. On the semantics of noun com- pounds. Comput. Speech Lang., 4(19):479-496.", |
|
"links": null |
|
}, |
|
"BIBREF4": { |
|
"ref_id": "b4", |
|
"title": "Semeval-2007 task 04: Classification of semantic relations between nominals", |
|
"authors": [ |
|
{ |
|
"first": "Roxana", |
|
"middle": [], |
|
"last": "Girju", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Vivi", |
|
"middle": [], |
|
"last": "Nastase", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Stan", |
|
"middle": [], |
|
"last": "Szpakowicz", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Peter", |
|
"middle": [], |
|
"last": "Turney", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Deniz", |
|
"middle": [], |
|
"last": "Yuret", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2007, |
|
"venue": "Proceedings of Se-mEval", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "13--18", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Roxana Girju, Preslav Nakov, Vivi Nastase, Stan Sz- pakowicz, Peter Turney, and Deniz Yuret. 2007. Semeval-2007 task 04: Classification of semantic relations between nominals. In Proceedings of Se- mEval, pages 13-18.", |
|
"links": null |
|
}, |
|
"BIBREF5": { |
|
"ref_id": "b5", |
|
"title": "Classification of semantic relations between nominals", |
|
"authors": [ |
|
{ |
|
"first": "Roxana", |
|
"middle": [], |
|
"last": "Girju", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Vivi", |
|
"middle": [], |
|
"last": "Nastase", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Stan", |
|
"middle": [], |
|
"last": "Szpakowicz", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Peter", |
|
"middle": [], |
|
"last": "Turney", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Deniz", |
|
"middle": [], |
|
"last": "Yuret", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2009, |
|
"venue": "Lang. Resour. Eval", |
|
"volume": "43", |
|
"issue": "2", |
|
"pages": "105--121", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Roxana Girju, Preslav Nakov, Vivi Nastase, Stan Sz- pakowicz, Peter Turney, and Deniz Yuret. 2009. Classification of semantic relations between nomi- nals. Lang. Resour. Eval., 43(2):105-121.", |
|
"links": null |
|
}, |
|
"BIBREF6": { |
|
"ref_id": "b6", |
|
"title": "Automatic acquisition of hyponyms from large text corpora", |
|
"authors": [ |
|
{ |
|
"first": "Marti", |
|
"middle": [], |
|
"last": "Hearst", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 1992, |
|
"venue": "Proceedings of COLING", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "539--545", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Marti Hearst. 1992. Automatic acquisition of hy- ponyms from large text corpora. In Proceedings of COLING, pages 539-545.", |
|
"links": null |
|
}, |
|
"BIBREF7": { |
|
"ref_id": "b7", |
|
"title": "Semeval-2010 task 8: Multi-way classification of semantic relations between pairs of nominals", |
|
"authors": [ |
|
{ |
|
"first": "Iris", |
|
"middle": [], |
|
"last": "Hendrickx", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Su", |
|
"middle": [ |
|
"Nam" |
|
], |
|
"last": "Kim", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Zornitsa", |
|
"middle": [], |
|
"last": "Kozareva", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Diarmuid\u00f3", |
|
"middle": [], |
|
"last": "S\u00e9aghdha", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Sebastian", |
|
"middle": [], |
|
"last": "Pad\u00f3", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Marco", |
|
"middle": [], |
|
"last": "Pennacchiotti", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Lorenza", |
|
"middle": [], |
|
"last": "Romano", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Stan", |
|
"middle": [], |
|
"last": "Szpakowicz", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2010, |
|
"venue": "Proceedings of Se-mEval", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "33--38", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Iris Hendrickx, Su Nam Kim, Zornitsa Kozareva, Preslav Nakov, Diarmuid\u00d3 S\u00e9aghdha, Sebastian Pad\u00f3, Marco Pennacchiotti, Lorenza Romano, and Stan Szpakowicz. 2010. Semeval-2010 task 8: Multi-way classification of semantic relations be- tween pairs of nominals. In Proceedings of Se- mEval, pages 33-38.", |
|
"links": null |
|
}, |
|
"BIBREF8": { |
|
"ref_id": "b8", |
|
"title": "Toward completeness in concept extraction and classification", |
|
"authors": [ |
|
{ |
|
"first": "Eduard", |
|
"middle": [], |
|
"last": "Hovy", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Zornitsa", |
|
"middle": [], |
|
"last": "Kozareva", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Ellen", |
|
"middle": [], |
|
"last": "Riloff", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2009, |
|
"venue": "Proceedings of EMNLP", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "948--957", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Eduard Hovy, Zornitsa Kozareva, and Ellen Riloff. 2009. Toward completeness in concept extraction and classification. In Proceedings of EMNLP, pages 948-957.", |
|
"links": null |
|
}, |
|
"BIBREF9": { |
|
"ref_id": "b9", |
|
"title": "Using local alignments for relation recognition", |
|
"authors": [ |
|
{ |
|
"first": "Sophia", |
|
"middle": [], |
|
"last": "Katrenko", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Pieter", |
|
"middle": [ |
|
"W" |
|
], |
|
"last": "Adriaans", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Maarten", |
|
"middle": [], |
|
"last": "Van Someren", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2010, |
|
"venue": "J. Artif. Intell. Res", |
|
"volume": "38", |
|
"issue": "", |
|
"pages": "1--48", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Sophia Katrenko, Pieter W. Adriaans, and Maarten van Someren. 2010. Using local alignments for relation recognition. J. Artif. Intell. Res., 38:1-48.", |
|
"links": null |
|
}, |
|
"BIBREF10": { |
|
"ref_id": "b10", |
|
"title": "Interpreting semantic relations in noun compounds via verb semantics", |
|
"authors": [ |
|
{ |
|
"first": "Nam", |
|
"middle": [], |
|
"last": "Su", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Timothy", |
|
"middle": [], |
|
"last": "Kim", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "", |
|
"middle": [], |
|
"last": "Baldwin", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2006, |
|
"venue": "Proceedings of COLING/ACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "491--498", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Su Nam Kim and Timothy Baldwin. 2006. Interpret- ing semantic relations in noun compounds via verb semantics. In Proceedings of COLING/ACL, pages 491-498.", |
|
"links": null |
|
}, |
|
"BIBREF11": { |
|
"ref_id": "b11", |
|
"title": "Interpreting noun compounds via bootstrapping and sense collocation", |
|
"authors": [ |
|
{ |
|
"first": "Nam", |
|
"middle": [], |
|
"last": "Su", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Timothy", |
|
"middle": [], |
|
"last": "Kim", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "", |
|
"middle": [], |
|
"last": "Baldwin", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2007, |
|
"venue": "Proceedings of PACLING", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "129--136", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Su Nam Kim and Timothy Baldwin. 2007. Interpret- ing noun compounds via bootstrapping and sense collocation. In Proceedings of PACLING, pages 129-136.", |
|
"links": null |
|
}, |
|
"BIBREF12": { |
|
"ref_id": "b12", |
|
"title": "Semantic class learning from the web with hyponym pattern linkage graphs", |
|
"authors": [ |
|
{ |
|
"first": "Zornitsa", |
|
"middle": [], |
|
"last": "Kozareva", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Ellen", |
|
"middle": [], |
|
"last": "Riloff", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Eduard", |
|
"middle": [], |
|
"last": "Hovy", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2008, |
|
"venue": "Proceedings of ACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "1048--1056", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Zornitsa Kozareva, Ellen Riloff, and Eduard Hovy. 2008. Semantic class learning from the web with hyponym pattern linkage graphs. In Proceedings of ACL, pages 1048-1056.", |
|
"links": null |
|
}, |
|
"BIBREF13": { |
|
"ref_id": "b13", |
|
"title": "The Web as a baseline: Evaluating the performance of unsupervised Web-based models for a range of NLP tasks", |
|
"authors": [ |
|
{ |
|
"first": "Mirella", |
|
"middle": [], |
|
"last": "Lapata", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Frank", |
|
"middle": [], |
|
"last": "Keller", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2004, |
|
"venue": "Proceedings of HLT-NAACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "121--128", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Mirella Lapata and Frank Keller. 2004. The Web as a baseline: Evaluating the performance of unsuper- vised Web-based models for a range of NLP tasks. In Proceedings of HLT-NAACL, pages 121-128.", |
|
"links": null |
|
}, |
|
"BIBREF14": { |
|
"ref_id": "b14", |
|
"title": "An information-theoretic definition of similarity", |
|
"authors": [ |
|
{ |
|
"first": "Dekang", |
|
"middle": [], |
|
"last": "Lin", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 1998, |
|
"venue": "Proceedings of ICML", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "296--304", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Dekang Lin. 1998. An information-theoretic defini- tion of similarity. In Proceedings of ICML, pages 296-304.", |
|
"links": null |
|
}, |
|
"BIBREF15": { |
|
"ref_id": "b15", |
|
"title": "Using verbs to characterize noun-noun relations", |
|
"authors": [ |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Marti", |
|
"middle": [], |
|
"last": "Hearst", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2006, |
|
"venue": "Proceedings of AIMSA", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "233--244", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Preslav Nakov and Marti Hearst. 2006. Using verbs to characterize noun-noun relations. In Proceedings of AIMSA, pages 233-244.", |
|
"links": null |
|
}, |
|
"BIBREF16": { |
|
"ref_id": "b16", |
|
"title": "Solving relational similarity problems using the web as a corpus", |
|
"authors": [ |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Marti", |
|
"middle": [], |
|
"last": "Hearst", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2008, |
|
"venue": "Proceedings of ACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "452--460", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Preslav Nakov and Marti Hearst. 2008. Solving rela- tional similarity problems using the web as a corpus. In Proceedings of ACL, pages 452-460.", |
|
"links": null |
|
}, |
|
"BIBREF17": { |
|
"ref_id": "b17", |
|
"title": "Improved statistical machine translation using monolingual paraphrases", |
|
"authors": [ |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2008, |
|
"venue": "Proceedings of ECAI", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "338--342", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Preslav Nakov. 2008a. Improved statistical machine translation using monolingual paraphrases. In Pro- ceedings of ECAI, pages 338-342.", |
|
"links": null |
|
}, |
|
"BIBREF18": { |
|
"ref_id": "b18", |
|
"title": "Noun compound interpretation using paraphrasing verbs: Feasibility study", |
|
"authors": [ |
|
{ |
|
"first": "Preslav", |
|
"middle": [], |
|
"last": "Nakov", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2008, |
|
"venue": "Proceedings of AIMSA", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "103--117", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Preslav Nakov. 2008b. Noun compound interpretation using paraphrasing verbs: Feasibility study. In Pro- ceedings of AIMSA, pages 103-117.", |
|
"links": null |
|
}, |
|
"BIBREF19": { |
|
"ref_id": "b19", |
|
"title": "Using lexical and relational similarity to classify semantic relations", |
|
"authors": [ |
|
{ |
|
"first": "Diarmuid\u00f3", |
|
"middle": [], |
|
"last": "S\u00e9aghdha", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Ann", |
|
"middle": [], |
|
"last": "Copestake", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2009, |
|
"venue": "Proceedings of EACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "621--629", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Diarmuid\u00d3 S\u00e9aghdha and Ann Copestake. 2009. Us- ing lexical and relational similarity to classify se- mantic relations. In Proceedings of EACL, pages 621-629.", |
|
"links": null |
|
}, |
|
"BIBREF20": { |
|
"ref_id": "b20", |
|
"title": "Semantic classification with WordNet kernels", |
|
"authors": [ |
|
{ |
|
"first": "Diarmuid\u00f3", |
|
"middle": [], |
|
"last": "S\u00e9aghdha", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2009, |
|
"venue": "Proceedings of HLT-NAACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "237--240", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Diarmuid\u00d3 S\u00e9aghdha. 2009. Semantic classifica- tion with WordNet kernels. In Proceedings of HLT- NAACL, pages 237-240.", |
|
"links": null |
|
}, |
|
"BIBREF21": { |
|
"ref_id": "b21", |
|
"title": "Organizing and searching the world wide web of facts -step two: harnessing the wisdom of the crowds", |
|
"authors": [ |
|
{ |
|
"first": "Marius", |
|
"middle": [], |
|
"last": "Pa\u015fca", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2007, |
|
"venue": "Proceedings of WWW", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "101--110", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Marius Pa\u015fca. 2007. Organizing and searching the world wide web of facts -step two: harnessing the wisdom of the crowds. In Proceedings of WWW, pages 101-110.", |
|
"links": null |
|
}, |
|
"BIBREF22": { |
|
"ref_id": "b22", |
|
"title": "Espresso: leveraging generic patterns for automatically harvesting semantic relations", |
|
"authors": [ |
|
{ |
|
"first": "Patrick", |
|
"middle": [], |
|
"last": "Pantel", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Marco", |
|
"middle": [], |
|
"last": "Pennacchiotti", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2006, |
|
"venue": "Proceedings of ACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "113--120", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Patrick Pantel and Marco Pennacchiotti. 2006. Espresso: leveraging generic patterns for automat- ically harvesting semantic relations. In Proceedings of ACL, pages 113-120.", |
|
"links": null |
|
}, |
|
"BIBREF23": { |
|
"ref_id": "b23", |
|
"title": "What is this, anyway: Automatic hypernym discovery", |
|
"authors": [ |
|
{ |
|
"first": "Alan", |
|
"middle": [], |
|
"last": "Ritter", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Stephen", |
|
"middle": [], |
|
"last": "Soderland", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Oren", |
|
"middle": [], |
|
"last": "Etzioni", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2009, |
|
"venue": "Proceedings of AAAI Spring Symposium", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "88--93", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Alan Ritter, Stephen Soderland, and Oren Etzioni. 2009. What is this, anyway: Automatic hypernym discovery. In Proceedings of AAAI Spring Sympo- sium, pages 88-93.", |
|
"links": null |
|
}, |
|
"BIBREF24": { |
|
"ref_id": "b24", |
|
"title": "The descent of hierarchy, and selection in relational semantics", |
|
"authors": [ |
|
{ |
|
"first": "Barbara", |
|
"middle": [], |
|
"last": "Rosario", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Marti", |
|
"middle": [], |
|
"last": "Hearst", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Charles", |
|
"middle": [], |
|
"last": "Fillmore", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2002, |
|
"venue": "Proceedings of ACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "247--254", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Barbara Rosario, Marti Hearst, and Charles Fillmore. 2002. The descent of hierarchy, and selection in re- lational semantics. In Proceedings of ACL, pages 247-254.", |
|
"links": null |
|
}, |
|
"BIBREF25": { |
|
"ref_id": "b25", |
|
"title": "Feature-rich part-ofspeech tagging with a cyclic dependency network", |
|
"authors": [ |
|
{ |
|
"first": "Kristina", |
|
"middle": [], |
|
"last": "Toutanova", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Dan", |
|
"middle": [], |
|
"last": "Klein", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Christopher", |
|
"middle": [], |
|
"last": "Manning", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Yoram", |
|
"middle": [], |
|
"last": "Singer", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2003, |
|
"venue": "Proceedings of HLT-NAACL", |
|
"volume": "", |
|
"issue": "", |
|
"pages": "252--259", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Kristina Toutanova, Dan Klein, Christopher Manning, and Yoram Singer. 2003. Feature-rich part-of- speech tagging with a cyclic dependency network. In Proceedings of HLT-NAACL, pages 252-259.", |
|
"links": null |
|
}, |
|
"BIBREF26": { |
|
"ref_id": "b26", |
|
"title": "Corpusbased learning of analogies and semantic relations", |
|
"authors": [ |
|
{ |
|
"first": "Peter", |
|
"middle": [], |
|
"last": "Turney", |
|
"suffix": "" |
|
}, |
|
{ |
|
"first": "Michael", |
|
"middle": [], |
|
"last": "Littman", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2005, |
|
"venue": "Machine Learning", |
|
"volume": "60", |
|
"issue": "", |
|
"pages": "251--278", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Peter Turney and Michael Littman. 2005. Corpus- based learning of analogies and semantic relations. Machine Learning, 60(1-3):251-278.", |
|
"links": null |
|
}, |
|
"BIBREF27": { |
|
"ref_id": "b27", |
|
"title": "Similarity of semantic relations", |
|
"authors": [ |
|
{ |
|
"first": "Peter", |
|
"middle": [], |
|
"last": "Turney", |
|
"suffix": "" |
|
} |
|
], |
|
"year": 2006, |
|
"venue": "Comput. Linguist", |
|
"volume": "32", |
|
"issue": "3", |
|
"pages": "379--416", |
|
"other_ids": {}, |
|
"num": null, |
|
"urls": [], |
|
"raw_text": "Peter Turney. 2006. Similarity of semantic relations. Comput. Linguist., 32(3):379-416.", |
|
"links": null |
|
} |
|
}, |
|
"ref_entries": { |
|
"TABREF0": { |
|
"type_str": "table", |
|
"num": null, |
|
"content": "<table><tr><td colspan=\"2\">Frequency Hyp./co-hyp. for arg. 1/2</td></tr><tr><td>311</td><td>cohyp arg1:tea</td></tr><tr><td>175</td><td>hyper arg1:beverage</td></tr><tr><td>102</td><td>hyper arg1:drink</td></tr><tr><td>80</td><td>hyper arg1:item</td></tr><tr><td>59</td><td>hyper arg1:product</td></tr><tr><td>51</td><td>cohyp arg1:chocolate</td></tr><tr><td>32</td><td>cohyp arg1:cocoa</td></tr><tr><td>27</td><td>cohyp arg1:soda</td></tr><tr><td>24</td><td>hyper arg1:crop</td></tr><tr><td>22</td><td>hyper arg1:food</td></tr><tr><td>21</td><td>cohyp arg1:sugar</td></tr><tr><td>19</td><td>cohyp arg1:fruit</td></tr><tr><td>19</td><td>hyper arg1:stimulant</td></tr><tr><td>. . .</td><td>. . .</td></tr><tr><td>119</td><td>hyper arg2:people</td></tr><tr><td>21</td><td>hyper arg2:friend</td></tr><tr><td>. . .</td><td>. . .</td></tr></table>", |
|
"html": null, |
|
"text": "Vector of hypernyms and co-hyponyms for the two arguments of coffee guy." |
|
}, |
|
"TABREF2": { |
|
"type_str": "table", |
|
"num": null, |
|
"content": "<table/>", |
|
"html": null, |
|
"text": "Vector of paraphrases for coffee guy." |
|
}, |
|
"TABREF4": { |
|
"type_str": "table", |
|
"num": null, |
|
"content": "<table/>", |
|
"html": null, |
|
"text": "SemEval-1 Task 4: The seven semantic relations defined by the task along with the distribution of positive/negative instances and one example for each relation." |
|
} |
|
} |
|
} |
|
} |