ACL-OCL / Base_JSON /prefixU /json /U07 /U07-1009.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "U07-1009",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T03:08:49.174331Z"
},
"title": "Extending Sense Collocations in Interpreting Noun Compounds",
"authors": [
{
"first": "Su",
"middle": [
"Nam"
],
"last": "Kim",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Melbourne VIC 3010",
"location": {
"country": "Australia"
}
},
"email": "snkim@csse.unimelb.edu.au"
},
{
"first": "\u2665",
"middle": [],
"last": "Meladel",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Melbourne VIC 3010",
"location": {
"country": "Australia"
}
},
"email": ""
},
{
"first": "Timothy",
"middle": [],
"last": "Baldwin",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Melbourne VIC 3010",
"location": {
"country": "Australia"
}
},
"email": ""
},
{
"first": "Nicta",
"middle": [],
"last": "Vrl",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Melbourne VIC 3010",
"location": {
"country": "Australia"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper investigates the task of noun compound interpretation, building on the sense collocation approach proposed by Moldovan et al. (2004). Our primary task is to evaluate the impact of similar words on the sense collocation method, and decrease the sensitivity of the classifiers by expanding the range of sense collocations via different semantic relations. Our method combines hypernyms, hyponyms and sister words of the component nouns, based on WORDNET. The data used in our experiments was taken from the nominal pair interpretation task of SEMEVAL-2007 (4th International Workshop on Semantic Evaluation 2007). In our evaluation, we test 7-way and 2-way class data, and show that the inclusion of hypernyms improves the performance of the sense collocation method, while the inclusion of hyponym and sister word information leads to a deterioration in performance.",
"pdf_parse": {
"paper_id": "U07-1009",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper investigates the task of noun compound interpretation, building on the sense collocation approach proposed by Moldovan et al. (2004). Our primary task is to evaluate the impact of similar words on the sense collocation method, and decrease the sensitivity of the classifiers by expanding the range of sense collocations via different semantic relations. Our method combines hypernyms, hyponyms and sister words of the component nouns, based on WORDNET. The data used in our experiments was taken from the nominal pair interpretation task of SEMEVAL-2007 (4th International Workshop on Semantic Evaluation 2007). In our evaluation, we test 7-way and 2-way class data, and show that the inclusion of hypernyms improves the performance of the sense collocation method, while the inclusion of hyponym and sister word information leads to a deterioration in performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "This paper investigates the automatic interpretation of noun compounds (i.e. NCs), such as paper submission and computer science department. NC interpretation is a well-known problem that aims to predict the semantic relation (i.e. SR) between a head noun and its modifying nominal(s) (i.e. modifiers). SRs, simply put, encapsulate how the head noun and the other nominals in a noun compound are related. As English noun phrases are rightheaded, the head noun occurs after all modifying nouns. For example, brick house is interpreted as a house that is modified by the word brick, which exhibits a PRODUCT-PRODUCER relationship between the two nouns in the compound. In contrast, the modifier and head in house brick exhibits a PART-WHOLE relationship, which is interpreted as a brick from a house, rather than the former interpretation of a house made of bricks. The set of SRs that we are concerned with in this paper is defined in Section 5.1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Research on NCs can be categorised into four main groups: defining SRs, disambiguating the syntax of NCs, disambiguating the semantics of NCs, and interpreting NCs via SRs. Each task is detailed in Section 2.1. Interpreting NCs has received much attention of late, and the problem has been addressed in areas of machine translation (MT), information extraction (IE), and applications such as questionanswering (QA). NCs pose a considerable challenge to computational linguistics due to the following issues (Lapata, 2002) : (1) NCs are extremely productive; (2) the semantic relationship between the head noun and its modifier(s) is implicit; and (3) the interpretation of an NC can vary due to contextual and pragmatic factors. Due to these challenges, current NC interpretation methods are too error-prone to be employed directly in NLP applications without human intervention or preprocessing.",
"cite_spans": [
{
"start": 507,
"end": 521,
"text": "(Lapata, 2002)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we investigate the task of NC interpretation based on sense collocation. It has been shown that NCs with semantically similar components share the same SR ; this is encapsulated by the phrase sense collocation in Moldovan et al. (2004) . For example, ap-ple pie has the same interpretation as banana cake of PRODUCT-PRODUCER. This can be predicted by the fact that the modifiers of both NCs (apple and banana, respectively) are semantically similar (they are both fruit), and the head nouns of both NCs (pie and cake, respectively) are a type of baked edible concoction. That the two NCs are based on the same combination of semantic classes is a strong predictor of the fact that they have the same SR.",
"cite_spans": [
{
"start": 228,
"end": 250,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "One obvious problem when proceduralising semantic collocation in an interpretation method is data sparseness, i.e. we can't expect to find instances for all combinations of semantic classes, particularly if we have a rich inventory of semantic classes such as WORDNET. One approach to ameliorating the data spareness is bootstrapping, in the manner of , where new data is induced by substituting the components of the NCs with semantically similar terms. Our approach in this paper is to add related terms as features into a classifier. The related terms we add are the NC components' hypernyms, hyponyms, and sister words, based on the hypothesis that these related words can contribute to the disambiguation of SRs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The remainder of this paper is structured as follows. In Section 2 we introduce previous research on NC interpretation and then talk specifically about the research directly relevant to this work. Section 3 and Section 4 describe our motivation and method, respectively. We describe the data used in our experiments in Section 5 and present the results of our experiments in Sections 6 and 7. Finally, we conclude our work in Section 8.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This section presents a short description of the computational tasks relating to NCs, and then reviews research directly impinging on this research.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The major tasks related to NCs involve syntactic and semantic disambiguation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "2.1"
},
{
"text": "The first step in semantic disambiguation is the task of defining what relations exist in NCs. This has gained much attention in recent decades, as well as controversy, (Downing, 1977; Levi, 1979; Finin, 1980) . In the study conducted by Levi (1979) , it was claimed that there were 9 distinct SRs, which could be discretely defined and interpreted within NCs, while Finin (1980) claimed an unlimited number of SRs. The problems surrounding this task involve the issue of granularity versus coverage, which to date remains widely debated.",
"cite_spans": [
{
"start": 169,
"end": 184,
"text": "(Downing, 1977;",
"ref_id": "BIBREF2"
},
{
"start": 185,
"end": 196,
"text": "Levi, 1979;",
"ref_id": "BIBREF15"
},
{
"start": 197,
"end": 209,
"text": "Finin, 1980)",
"ref_id": "BIBREF4"
},
{
"start": 238,
"end": 249,
"text": "Levi (1979)",
"ref_id": "BIBREF15"
},
{
"start": 367,
"end": 379,
"text": "Finin (1980)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "2.1"
},
{
"text": "Syntactic disambiguation (called bracketing) is required when NCs are composed of more than 2 components, such as in the case of computer science department, introducing the need for phrasal disambiguation (Lauer, 1995; Nakov, 2005) . Lauer (1995) proposed probabilistic models (based on dependency and adjacency analyses of the data). Later Nakov (2005) built upon this by adding linguistic features into these probabilistic models.",
"cite_spans": [
{
"start": 206,
"end": 219,
"text": "(Lauer, 1995;",
"ref_id": "BIBREF14"
},
{
"start": 220,
"end": 232,
"text": "Nakov, 2005)",
"ref_id": "BIBREF17"
},
{
"start": 235,
"end": 247,
"text": "Lauer (1995)",
"ref_id": "BIBREF14"
},
{
"start": 342,
"end": 354,
"text": "Nakov (2005)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "2.1"
},
{
"text": "Methods employed in word sense disambiguation (WSD) have also been used to enhance NC interpretation; the noun components that comprise the NCs are disambiguated using these WSD techniques (Sparck Jones, 1983; . carried out experiments on automatically modeling WSD and attested the usefulness of conducting word sense analysis of an NC in determining its SR.",
"cite_spans": [
{
"start": 189,
"end": 209,
"text": "(Sparck Jones, 1983;",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "2.1"
},
{
"text": "A majority of research undertaken in interpreting NCs has been based on two statistical methods: SEMANTIC SIMILARITY (Barker and Szpakowicz, 1998; Rosario, 2001; Moldovan et al., 2004; Kim and Baldwin, 2005; Nastase, 2006; Girju, 2007; and SEMANTIC INTER-PRETABILITY (Vanderwende, 1994; Lapata, 2002; Kim and Baldwin, 2006; Nakov, 2006) . Our work, based on an extension of the sense collocation approach, corresponds to the semantic similarity method.",
"cite_spans": [
{
"start": 117,
"end": 146,
"text": "(Barker and Szpakowicz, 1998;",
"ref_id": "BIBREF0"
},
{
"start": 147,
"end": 161,
"text": "Rosario, 2001;",
"ref_id": "BIBREF20"
},
{
"start": 162,
"end": 184,
"text": "Moldovan et al., 2004;",
"ref_id": "BIBREF16"
},
{
"start": 185,
"end": 207,
"text": "Kim and Baldwin, 2005;",
"ref_id": "BIBREF8"
},
{
"start": 208,
"end": 222,
"text": "Nastase, 2006;",
"ref_id": "BIBREF19"
},
{
"start": 223,
"end": 235,
"text": "Girju, 2007;",
"ref_id": "BIBREF5"
},
{
"start": 267,
"end": 286,
"text": "(Vanderwende, 1994;",
"ref_id": "BIBREF23"
},
{
"start": 287,
"end": 300,
"text": "Lapata, 2002;",
"ref_id": "BIBREF13"
},
{
"start": 301,
"end": 323,
"text": "Kim and Baldwin, 2006;",
"ref_id": "BIBREF9"
},
{
"start": 324,
"end": 336,
"text": "Nakov, 2006)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Approaches to NC Interpretation",
"sec_num": "2.2"
},
{
"text": "A significant contribution to this area is by Moldovan et al. (2004) , who used the sense collocation (i.e. pair of word senses) as their primary feature in disambiguating NCs. Many subsequent studies have been based on this sense collocation method, with the addition of other performance-improving features. For example, Girju (2007) added contextual information (e.g. the grammatical role and POS) and cross-lingual information from 5 European languages as features to her model. In contrast, Kim and Baldwin (2007) utilise sense collocations in a different way: instead of adding additional features in their model, they increase the size of their training data by substituting components of existing training instances to generate additional training instances (which is assumed to have the same SR as the original). For an SR to be preserved, the newly-generated NC must be semantically similar and hence maintain the same sense collocation as the original NC on which it was based. A number of researchers (Rosario (2001) , Kim and Baldwin (2005) , Nastase (2006) , inter alia) have attempted to interpret NCs via implicit sense collocations. In particular, they have come up with various methods for avoiding direct WSD. Rosario (2001) retrieved the sense pairs in the context of a hierarchical class set for the biomedical domain. Kim and Baldwin (2005) used a word-level similarity measure to express the sense collocation of NCs. Nastase (2006) listed the hypernyms of components as sense features.",
"cite_spans": [
{
"start": 46,
"end": 68,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
},
{
"start": 323,
"end": 335,
"text": "Girju (2007)",
"ref_id": "BIBREF5"
},
{
"start": 1013,
"end": 1028,
"text": "(Rosario (2001)",
"ref_id": "BIBREF20"
},
{
"start": 1031,
"end": 1053,
"text": "Kim and Baldwin (2005)",
"ref_id": "BIBREF8"
},
{
"start": 1056,
"end": 1070,
"text": "Nastase (2006)",
"ref_id": "BIBREF19"
},
{
"start": 1229,
"end": 1243,
"text": "Rosario (2001)",
"ref_id": "BIBREF20"
},
{
"start": 1441,
"end": 1455,
"text": "Nastase (2006)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Previous Approaches to NC Interpretation",
"sec_num": "2.2"
},
{
"text": "As mentioned above, Moldovan et al. (2004) showed that the sense collocation of NCs is a key feature when interpreting NCs. Further research in this area has shown that not only synonymous NCs share the same SR, but NCs whose components are replaced with more loosely related words also commonly have the same SR as the original NCs . For example, car factory, vehicle factory and truck factory-corresponding to synonym, hypernym and sister word substitutions, respectively, over automobile factory-share the same SR of PRODUCT-PRODUCER as the source NC. Figure 3 shows an example of semantic neighbours for the two NCs car key and apple pie. Car key can be interpreted as PRODUCT-PRODUCER by referring to the training NC automobile key, since they have the same sense collocation. With apple juice, the sense collocation method tries to locate matching sense collocations in the training data, and finds that fruit juice matches closely, with the modifier being a hypernym of apple. From this, we can hope to correctly interpret apple juice as having the SR PRODUCT-PRODUCER. In order to achieve this, we require some means of comparing nouns taxonomically, both vertically to capture hypernyms and hyponyms, and horizontally to capture sister words. As intimated above, our motivation in conducting this research is to be able to include hypernym, hyponym and sister word information without using direct substitution over the training instances, but still preserving the essence of the sense collocation approach. The disadvantage of the method employed by of recursively bootstrapping off a seed set of NCs via different lexical relations, is that noise will inevitably infect the training data, skewing the classifier performance. The original method described in Moldovan et al. (2004) only relies on observed sense collocations. The components of the NCs are represented as specific synsets in WORDNET, and the model does not capture related words. Hence, in this paper, we aim to develop a model that can take advantage of relatedness between WORDNET synsets via hypernyms, hyponyms and sister words, without the risk of losing semantic granularity or nintroducing noisy training data. Note that in Kim and Baldwin (2007), we used synonyms, hypernyms and sister words. As synonyms have an identical sense collocation within WORDNET (i.e. pairing of synsets) to the original NC, they are ignored in this research. Instead, we add hyponyms as a means of broadening the range of sense collocation.",
"cite_spans": [
{
"start": 20,
"end": 42,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
},
{
"start": 1769,
"end": 1791,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 555,
"end": 563,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Motivation",
"sec_num": "3"
},
{
"text": "First, we describe the principal idea of the sense collocation approach to NC interpretation and the probability model proposed in Moldovan et al. (2004) . Then we present our method using hypernyms, hy-ponyms and sister words in order to extend the sense collocation method.",
"cite_spans": [
{
"start": 131,
"end": 153,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "4"
},
{
"text": "The basic idea behind sense collocation in Moldovan et al. (2004) is based on the 'pair-of-word-senses' from the component nouns in NCs. They also introduced a probability model called semantic scattering, as detailed in Equations 1 and 2 below. In essence, the probability P (r|f i f j ) (simplified to P (r|f ij )) of a modifier and head noun with word sense f i and f j , respectively, occurring with SR r is calculated based on simple maximum likelihood estimation:",
"cite_spans": [
{
"start": 43,
"end": 65,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Sense Collocation",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (r|f ij ) = n(r, f ij ) n(f ij )",
"eq_num": "(1)"
}
],
"section": "Sense Collocation",
"sec_num": "4.1"
},
{
"text": "The preferred SR r * for the given sense combination is that which maximizes the probability:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Sense Collocation",
"sec_num": "4.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "r * = argmax r\u2208R P (r|f ij ) = argmax r\u2208R P (f ij |r)P (r)",
"eq_num": "(2)"
}
],
"section": "Sense Collocation",
"sec_num": "4.1"
},
{
"text": "We extend the approach of Moldovan et al. (2004) by adding similar words as features focusing on hypernyms, hyponyms and sister words of the modifier and head noun. We accumulate the features for semantic relations based on different taxonomic relation types, from which we construct a feature vector to build a classifier over. The features of each taxonomic relation type are listed below. The first is features used in the original sense collocation method. The second, third and fourth are our experimental features, based on hypernyms, hyponyms and sister words respectively.",
"cite_spans": [
{
"start": 26,
"end": 48,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Adding Similar Words",
"sec_num": "4.2"
},
{
"text": ", W S head > 2. < W S mod , H i mod , W S head , H i head > 3. < W S mod , O mod , W S head , O head > 4. < W S mod , S mod , W S head , S head >",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "< W S mod",
"sec_num": "1."
},
{
"text": "where mod is the modifier, head is the head noun, W S mod is the WORDNET synset of the modifier, W S head is the WORDNET synset of the head, H i is an ith-degree ancestor (with direct hypernyms corresponding to H 1 ), O is a hyponym and S is a sister word. We include up to the 7th-degree ancestor (i.e. H 7 ), in line with the findings of Nastase (2006) . Note that while a given synset has a unique hypernym in WORDNET (assuming no cycles, or the ability to remove cycles by precompiling a tree structure), it can have arbitrarily many hyponyms and sister words. Here, we take the cross product of the different hyponym and sister word candidates for a given synset. We build our final classifier with TIMBL V6.0, a memory-based learner (Daelemans et al., 2004) .",
"cite_spans": [
{
"start": 340,
"end": 354,
"text": "Nastase (2006)",
"ref_id": "BIBREF19"
},
{
"start": 739,
"end": 763,
"text": "(Daelemans et al., 2004)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "< W S mod",
"sec_num": "1."
},
{
"text": "Below, we outline the data used in our experiments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "5"
},
{
"text": "The SR between a head and its modifier(s) in a NC tells us how to (default) interpret the NC. For example door knob corresponds to the PART-WHOLE relation, which means we can interpret knob as being part of a door. We sidestep the considerable challenge of developing an optimal set of semantic relation categories by using the set of SRs and data from the SEMEVAL-2007 nominal pair interpretation task . The SRs defined for the task are: CAUSE-EFFECT (CE), CONTENT-CONTAINER (CC), INSTRUMENT-AGENCY (IA), ORIGIN-ENTITY (OE), PART-WHOLE (PW), PRODUCT-PRODUCER (PP) and THEME-TOOL (TT). Table 1 provides a definition of each SR along with example NCs.",
"cite_spans": [],
"ref_spans": [
{
"start": 586,
"end": 593,
"text": "Table 1",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Semantic Relation",
"sec_num": "5.1"
},
{
"text": "From the SEMEVAL-2007 annotated data (Girju et al., 2007) , we collect two sets of data: a 2-class dataset and a 7-class dataset. The 2-class dataset is taken from the original SEMEVAL-2007 task, and comprises a set of positive and negative instances for each of the 7 SRs. The 7-class dataset is derived from this, by combining all positive NCs across the 7 SRs, in line with the methodology of Kim and Baldwin (to appear). The taxonomic relations are derived from WORDNET3.0. In each of the two sets, we use each of hypernyms, hyponyms and sister words. Table 2 shows the number of hyponyms and sister words in each dataset. We ran our first experiment over the 7-class dataset. The baseline was computed using a Zero-R (i.e. majority class) classifier. 1 The performance of the original method proposed in Moldovan et al. (2004) is considered as a benchmark for our experiments. Table 3 shows the performance of the original sense collocation method and that of the extended sense collocation model proposed in this paper. Table 3 shows that our method, combined with hypernyms, outperforms the original sense collocation method, with the highest accuracy of .588 achieved with 5th-degree ancestors of the head noun and modifier. This confirms that hypernyms are valuable in extending the range of sense collocation for NC interpretation.",
"cite_spans": [
{
"start": 37,
"end": 57,
"text": "(Girju et al., 2007)",
"ref_id": "BIBREF5"
},
{
"start": 756,
"end": 757,
"text": "1",
"ref_id": null
},
{
"start": 809,
"end": 831,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 556,
"end": 563,
"text": "Table 2",
"ref_id": "TABREF3"
},
{
"start": 1026,
"end": 1033,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Data Collection",
"sec_num": "5.2"
},
{
"text": "In stark contrast to the results for hypernyms, the results for hyponyms and sister words significantly reduced the accuracy. The reason for this anomaly is that hypernyms are able to generalize the sense collocation without losing key discriminative features (i.e. the hypernyms always, by definition, subsume 1 The majority class was PRODUCT-PRODUCER. the original semantic information), while hyponyms and sister words add many sense collocations for which we have no direct evidence (i.e. we indiscriminately specialise the semantics without any motivation). Hence, hyponyms and sister words drastically blur the sense collocation.",
"cite_spans": [
{
"start": 311,
"end": 312,
"text": "1",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Data Collection",
"sec_num": "5.2"
},
{
"text": "The reason that the accuracy of the hypernym method drops in beyond a certain level is that the semantic collocations start to blend in together, and lose their power of discrimination.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Data Collection",
"sec_num": "5.2"
},
{
"text": "In our second experiment, we ran the systems over the original data from SEMEVAL-2007, in the form of a binary classifier for each of the 7 SRs. The performance of each of the 2-way classification tasks is shown in Table 4 .",
"cite_spans": [],
"ref_spans": [
{
"start": 215,
"end": 222,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "As we can see in Table 4 , the basic pattern of the results is the same as for the 7-way classification task in Table 3 . Adding hypernyms enhances performance, peaking for 4th-degree ancestors in this case at .679. As with the 7-way classification task, hyponyms and sister words degraded performance, for the same reasons as before.",
"cite_spans": [],
"ref_spans": [
{
"start": 17,
"end": 24,
"text": "Table 4",
"ref_id": null
},
{
"start": 112,
"end": 119,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "Looking at the performance of each SR, we found that some SRs are easier to interpret than others. Notably, PRODUCT-PRODUCER and THEME-TOOL were high performers, while CAUSE-EFFECT was considerably harder to classify. These trends coincide with the system results for the SEMEVAL-2007 task. analyze this effect in terms of the intrinsic semantic complexity of the different SRs, and also the relative size of the training data for each SR. These effects are also observable in the breakdown of precision and recall of each SR in Figure 1. As we used the data from the SEMEVAL-2007 task, we are able to directly compare the perfor- Accuracy .217 .496 .544 .552 .573 .562 .588 .568 .557 .197 .142 Table 3 : Results for the 7-way classification task: B = baseline, M+ = Moldovan et al. (2004) method, H i = ith-order Hypernym, O = Hyponym and S = Sister word; the best performing system is indicated in boldface CE .547 .547 533 .573 .600 .606 .586 .607 .630 .467 .453 IA .507 .581 .595 .608 .649 .671 .653 .629 .645 .500 .500 PP .655 .667 .679 .691 .679 .737 .700 .690 .687 .655 .655 OE .558 .636 .623 .610 .662 .645 .662 .625 .712 .558 .558 TT .636 .697 .727 .712 .742 .766 .732 .717 .650 .515 .394 PW .634 .620 .690 .690 .629 .657 .585 .731 .630 .633 .634 CC .514 .676 .703 .689 .689 .676 .667 .647 .698 .446 .514 All .579 .632 .649 .653 .662 .679 .654 .661 .667 .541 .534 Table 4 : Results for each of the 2-way classification tasks: B = baseline, M+ = Moldovan et al. (2004) method, H i = ith-order Hypernym, O = Hyponym and S = Sister word; the best performing system is indicated in boldface mance of our method with the official results from the competing systems. Table 5 shows the three baselines provided by the SEMEVAL-2007 organisers (see ). Here, All True is computed by guessing \"true\" for all relations, maximizing recall; probability is computed by randomly assigning \"true\" (or \"false\") with a probability matching the distribution of the labels in the training data for the given relation, and is intended to balance precision and recall; and majority is computed by assigning the majority class (either \"true\" or \"false\") from the training data for the given relation.",
"cite_spans": [
{
"start": 631,
"end": 694,
"text": "Accuracy .217 .496 .544 .552 .573 .562 .588 .568 .557 .197 .142",
"ref_id": null
},
{
"start": 767,
"end": 789,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
},
{
"start": 909,
"end": 1372,
"text": "CE .547 .547 533 .573 .600 .606 .586 .607 .630 .467 .453 IA .507 .581 .595 .608 .649 .671 .653 .629 .645 .500 .500 PP .655 .667 .679 .691 .679 .737 .700 .690 .687 .655 .655 OE .558 .636 .623 .610 .662 .645 .662 .625 .712 .558 .558 TT .636 .697 .727 .712 .742 .766 .732 .717 .650 .515 .394 PW .634 .620 .690 .690 .629 .657 .585 .731 .630 .633 .634 CC .514 .676 .703 .689 .689 .676 .667 .647 .698 .446 .514 All .579 .632 .649 .653 .662 .679 .654 .661 .667 .541 .534",
"ref_id": null
},
{
"start": 1454,
"end": 1476,
"text": "Moldovan et al. (2004)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 529,
"end": 538,
"text": "Figure 1.",
"ref_id": null
},
{
"start": 695,
"end": 702,
"text": "Table 3",
"ref_id": null
},
{
"start": 1373,
"end": 1380,
"text": "Table 4",
"ref_id": null
},
{
"start": 1670,
"end": 1677,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "B M+ H 1 H 2 H 3 H 4 H 5 H 6 H 7 O S",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "B M+ H 1 H 2 H 3 H 4 H 5 H 6 H 7 O S",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "We also present the best-performing system and the average performance within group B from the SEMEVAL-2007 task (the grouping of systems which don't use gold-standard sense tags, and which also don't make use of the \"query\" used to source the examples).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "As shown in Table 5 , the performance of our method using hypernyms outperformed all three baselines. The performance using hyponyms and sister words only exceeded the All True and Probability baselines. The interesting point here is that although the method is meant for general-purpose interpretation not for the binary decision task, our proposed method with hypernyms achieves better results than the baselines and is competitive with the Figure 1: TPR for each of the binary tasks with 4thdegree hypernyms other systems in the original competition (average accuracy of group B = .656 vs. our best = .679). Therefore, we conclude that sense collocation integrated with hypernyms has the potential to extend the basic sense collocation method and improve performance for the NC interpretation task.",
"cite_spans": [],
"ref_spans": [
{
"start": 12,
"end": 19,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "2-way classification experiment",
"sec_num": "7"
},
{
"text": "In this paper, we have investigated the impact of using different taxonomic relations to expand a sense collocation method of NC interpretation. That is, we experimented with the integration of similar terms into a sense collocation model. We added up to the 7th-degree hypernyms, direct hyponyms and direct sister words terms as features to the classifier. We ran experiments over 7-way and 2-way classification tasks using data from SEMEVAL-2007, and found that the inclusion of hypernym information significantly improved accuracy, while hyponyms and sister words degraded performance by arbitrarily overspecialising the sense information. While intuitively all of hypernyms, hyponyms and sister words would appear to provide rich features for a sense collocation method, further research is needed to develop ways of successfully incorporating hyponyms and sister words into the NC interpretation task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Semi-automatic recognition of noun modifier relationships",
"authors": [
{
"first": "Ken",
"middle": [],
"last": "Barker",
"suffix": ""
},
{
"first": "Stan",
"middle": [],
"last": "Szpakowicz",
"suffix": ""
}
],
"year": 1998,
"venue": "Proc. of the 17th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "96--102",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ken Barker and Stan Szpakowicz. 1998. Semi-automatic recognition of noun modifier relationships. In Proc. of the 17th International Conference on Computational Linguistics, pp. 96-102, Montreal, Canada.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "TiMBL: Tilburg Memory Based Learner, version 5.1, Reference Guide",
"authors": [
{
"first": "Walter",
"middle": [],
"last": "Daelemans",
"suffix": ""
},
{
"first": "Jakub",
"middle": [],
"last": "Zavrel",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ko Van Der",
"suffix": ""
},
{
"first": "Antal",
"middle": [],
"last": "Sloot",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Van Den",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bosch",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Walter Daelemans, Jakub Zavrel, Ko van der Sloot, and Antal van den Bosch. 2004. TiMBL: Tilburg Mem- ory Based Learner, version 5.1, Reference Guide. ILK Technical Report 04-02.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "On the Creation and Use of English Compound Nouns",
"authors": [
{
"first": "Pamela",
"middle": [],
"last": "Downing",
"suffix": ""
}
],
"year": 1977,
"venue": "Language",
"volume": "53",
"issue": "4",
"pages": "810--842",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pamela Downing. 1977. On the Creation and Use of En- glish Compound Nouns. Language, 53(4):810-842.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"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, Cambridge, USA.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "The Semantic Interpretation of Compound Nominals",
"authors": [
{
"first": "Timothy",
"middle": [
"W"
],
"last": "Finin",
"suffix": ""
}
],
"year": 1980,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Timothy W. Finin. 1980. The Semantic Interpretation of Compound Nominals. Ph.D. thesis, University of Illinois.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Improving the interpretation of noun phrases with cross-linguistic information",
"authors": [
{
"first": "Roxana",
"middle": [],
"last": "Girju",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of the 45th Annual Meeting of the Association of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "568--575",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roxana Girju. 2007. Improving the interpretation of noun phrases with cross-linguistic information. In Proc. of the 45th Annual Meeting of the Association of Computational Linguistics, pp. 568-575, Prague, Czech Republic.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Stan Szpakowicz, Peter Turneyand Deniz Yuret",
"authors": [
{
"first": "Roxana",
"middle": [],
"last": "Girju",
"suffix": ""
},
{
"first": "Preslav",
"middle": [],
"last": "Nakov",
"suffix": ""
},
{
"first": "Vivi",
"middle": [],
"last": "Nastase",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roxana Girju, Preslav Nakov, Vivi Nastase, Stan Sz- pakowicz, Peter Turneyand Deniz Yuret. 2007.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "task 04: classification of semantic relations between nominals",
"authors": [
{
"first": "-",
"middle": [],
"last": "Semeval",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of Semantic Evaluation Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "SemEval-2007 task 04: classification of semantic re- lations between nominals. In Proc. of Semantic Eval- uation Workshop, Prague, Czech Republic.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Automatic interpretation of noun compounds using WordNet similarity",
"authors": [
{
"first": "Nam",
"middle": [],
"last": "Su",
"suffix": ""
},
{
"first": "Timothy",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Baldwin",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of the 2nd International Joint Conference On Natural Language Processing",
"volume": "",
"issue": "",
"pages": "945--956",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Su Nam Kim and Timothy Baldwin. 2005. Automatic interpretation of noun compounds using WordNet sim- ilarity. In Proc. of the 2nd International Joint Confer- ence On Natural Language Processing, pp. 945-956, JeJu, Korea.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"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": "Proc. of the 44th Annual Meeting of the Association for Computational Linguistics and 21st International Conference on Computational Linguistics (COLING/ACL-2006)",
"volume": "",
"issue": "",
"pages": "491--498",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Su Nam Kim and Timothy Baldwin. 2006. Interpreting semantic relations in noun compounds via verb se- mantics. In Proc. of the 44th Annual Meeting of the Association for Computational Linguistics and 21st International Conference on Computational Linguis- tics (COLING/ACL-2006). pp. 491-498, Sydney, Aus- tralia.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Disambiguating noun compounds",
"authors": [
{
"first": "Nam",
"middle": [],
"last": "Su",
"suffix": ""
},
{
"first": "Timothy",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Baldwin",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of the 22nd AAAI conference on Artificial Intelligence (AAAI-07)",
"volume": "",
"issue": "",
"pages": "901--906",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Su Nam Kim and Timothy Baldwin. 2007. Disam- biguating noun compounds. In Proc. of the 22nd AAAI conference on Artificial Intelligence (AAAI-07), 2007, pp.901-906, British Columbia, Canada.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Interpreting noun compounds using 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": "Proc. of the Pacific Association for Computational Linguistics (PACLING)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Su Nam Kim and Timothy Baldwin. 2007. Interpreting noun compounds using bootstrapping and sense collo- cation. In Proc. of the Pacific Association for Com- putational Linguistics (PACLING), Melbourne, Aus- tralia.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Benchmarking noun compound interpretation",
"authors": [
{
"first": "Nam",
"middle": [],
"last": "Su",
"suffix": ""
},
{
"first": "Timothy",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Baldwin",
"suffix": ""
}
],
"year": null,
"venue": "Proc. of the 3rd International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Su Nam Kim and Timothy Baldwin. to appear. Bench- marking noun compound interpretation. In Proc. of the 3rd International Joint Conference on Natural Language Processing (IJCNLP-08), Hyderabad, India.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "The disambiguation of nominalizations",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2002,
"venue": "Computational Linguistics",
"volume": "28",
"issue": "3",
"pages": "357--388",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Lapata. 2002. The disambiguation of nominaliza- tions. Computational Linguistics, 28(3):357-388.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Designing Statistical Language Learners: Experiments on Noun Compounds",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Lauer",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Lauer. Designing Statistical Language Learn- ers: Experiments on Noun Compounds, Ph.D thesis. 1995, Macquarie University.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "The syntax and semantics of complex nominals",
"authors": [
{
"first": "Judith",
"middle": [],
"last": "Levi",
"suffix": ""
}
],
"year": 1979,
"venue": "The Syntax and Semantics of Complex Nominals",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Judith Levi. 1979. The syntax and semantics of complex nominals. In The Syntax and Semantics of Complex Nominals. New York:Academic Press.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Models for the semantic classification of noun phrases",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Moldovan",
"suffix": ""
},
{
"first": "Adriana",
"middle": [],
"last": "Badulescu",
"suffix": ""
},
{
"first": "Marta",
"middle": [],
"last": "Tatu",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Antohe",
"suffix": ""
},
{
"first": "Roxana",
"middle": [],
"last": "Girju",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. of the HLT-NAACL 2004 Workshop on Computational Lexical Semantics",
"volume": "",
"issue": "",
"pages": "60--67",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Moldovan, Adriana Badulescu, Marta Tatu, Daniel Antohe, and Roxana Girju. 2004. Models for the se- mantic classification of noun phrases. In Proc. of the HLT-NAACL 2004 Workshop on Computational Lexi- cal Semantics, pp. 60-67, Boston, USA.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Search engine statistics beyond the n-gram: Application to noun compound bracketing",
"authors": [
{
"first": "Preslav",
"middle": [],
"last": "Nakov",
"suffix": ""
},
{
"first": "Marti",
"middle": [],
"last": "Hearst",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of the 9th Conference on Computational Natural Language Learning (CoNLL-2005)",
"volume": "",
"issue": "",
"pages": "17--24",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Preslav Nakov and Marti Hearst. 2005. Search en- gine statistics beyond the n-gram: Application to noun compound bracketing. In Proc. of the 9th Con- ference on Computational Natural Language Learn- ing (CoNLL-2005), pp. 17-24, Ann Arbor, Michigan, USA.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Using verbs to characterize noun-noun relations",
"authors": [
{
"first": "Preslav",
"middle": [],
"last": "Nakov",
"suffix": ""
},
{
"first": "Marti",
"middle": [],
"last": "Hearst",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of the 12th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Preslav Nakov and Marti Hearst. 2006. Using verbs to characterize noun-noun relations. In Proc. of the 12th International Conference on Artificial Intelli- gence: Methodology, Systems, Applications (AIMSA), Bularia.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Learning noun-modifier semantic relations with corpus-based and WordNet-based features",
"authors": [
{
"first": "Vivi",
"middle": [],
"last": "Nastase",
"suffix": ""
},
{
"first": "Jelber",
"middle": [],
"last": "Sayyad-Shiarabad",
"suffix": ""
},
{
"first": "Marina",
"middle": [],
"last": "Sokolova",
"suffix": ""
},
{
"first": "Stan",
"middle": [],
"last": "Szpakowicz",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of the 21st Annual Conference on Artificial Intelligence (AAAI-06)",
"volume": "",
"issue": "",
"pages": "781--787",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vivi Nastase and Jelber Sayyad-Shiarabad and Marina Sokolova and Stan Szpakowicz. 2006. Learning noun-modifier semantic relations with corpus-based and WordNet-based features. In Proc. of the 21st An- nual Conference on Artificial Intelligence (AAAI-06), pp. 781-787, Boston, MA, USA.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Classifying the semantic relations in noun compounds via a domainspecific lexical hierarchy",
"authors": [
{
"first": "Barbara",
"middle": [],
"last": "Rosario",
"suffix": ""
},
{
"first": "Hearst",
"middle": [],
"last": "Marti",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "82--90",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Barbara Rosario and Hearst Marti. 2001. Classifying the semantic relations in noun compounds via a domain- specific lexical hierarchy. In In Proc. of EMNLP, 82- 90",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Compound noun interpretation problems",
"authors": [
{
"first": "Karen Sparck",
"middle": [],
"last": "Jones",
"suffix": ""
}
],
"year": 1983,
"venue": "Computer Speech Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karen Sparck Jones. 1983. Compound noun inter- pretation problems. Computer Speech Processing, Prentice-Hall, Englewood Cliffes, NJ, USA.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Cooccurrence contexts for noun compound interpretation",
"authors": [
{
"first": "Diarmuid",
"middle": [],
"last": "Seaghdha",
"suffix": ""
},
{
"first": "Ann",
"middle": [],
"last": "Copestake",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of the ACL-2007 Workshop on A Broader Perspective on Multiword Expressions",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diarmuid Seaghdha and Ann Copestake. 2007. Co- occurrence contexts for noun compound interpre- tation. In Proc. of the ACL-2007 Workshop on A Broader Perspective on Multiword Expressions, Prague, Czech Republic.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Algorithm for automatic interpretation of noun sequences",
"authors": [
{
"first": "Lucy",
"middle": [],
"last": "Vanderwende",
"suffix": ""
}
],
"year": 1994,
"venue": "Proc. of the 15th Conference on Computational linguistics",
"volume": "",
"issue": "",
"pages": "782--788",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lucy Vanderwende. 1994. Algorithm for automatic in- terpretation of noun sequences. In Proc. of the 15th Conference on Computational linguistics, pp. 782- 788.",
"links": null
}
},
"ref_entries": {
"TABREF1": {
"html": null,
"num": null,
"text": "N1 is the cause of N2 virus flu, hormone growth, inhalation death Instrument-Agency (IA) N1 is the instrument of N2, N2 uses N1 laser printer, ax murderer, sump pump drainage Product-Producer (PP)N1 is a product of N2, N2 produces N1 honey bee, music clock, supercomputer business Origin-Entity (OE)N1 is the origin of N2 bacon grease, desert storm, peanut butter Theme-Tool (TT)N2 is intended for N1 reorganization process, copyright law, work force Part-Whole (PW) N1 is part of N2 table leg, daisy flower, tree forest Content-Container (CC) N1 is store or carried inside N2 apple basket, wine bottle, plane carge",
"content": "<table><tr><td>Semantic relation</td><td>Definition</td><td>Examples</td></tr><tr><td>Cause-Effect (CE)</td><td/><td/></tr></table>",
"type_str": "table"
},
"TABREF2": {
"html": null,
"num": null,
"text": "The set of 7 semantic relations, where N 1 is the head noun and N 2 is a modifier",
"content": "<table><tr><td>class</td><td>Hyponym</td><td>Sister word</td></tr><tr><td/><td colspan=\"2\">mod head mod head</td></tr><tr><td>7-classes</td><td colspan=\"2\">4866 4708 7167 7456</td></tr><tr><td colspan=\"3\">2-classes (CE) 1272 774 3220 2043</td></tr><tr><td>2-classes (IA)</td><td colspan=\"2\">955 1804 1726 3722</td></tr><tr><td colspan=\"3\">2-classes (PP) 1526 1688 3058 3009</td></tr><tr><td colspan=\"3\">2-classes (OE) 2394 1730 3861 2907</td></tr><tr><td colspan=\"3\">2-classes (TT) 1383 812 2767 1698</td></tr><tr><td colspan=\"3\">2-classes (PW) 1403 1770 2900 4117</td></tr><tr><td colspan=\"3\">2-classes (CC) 1598 820 2620 1909</td></tr></table>",
"type_str": "table"
},
"TABREF3": {
"html": null,
"num": null,
"text": "",
"content": "<table><tr><td>Total number of hyponym-and sister word-</td></tr><tr><td>based NCs</td></tr><tr><td>6 7-way classification experiment</td></tr></table>",
"type_str": "table"
}
}
}
}