Proceedings of the 22nd International Conference on Computational Linguistics - COLING '08 2008
DOI: 10.3115/1599081.1599092
|View full text |Cite
|
Sign up to set email alerts
|

A concept-centered approach to noun-compound interpretation

Abstract: A noun-compound is a compressed proposition that requires an audience to recover the implicit relationship between two concepts that are expressed as nouns. Listeners recover this relationship by considering the most typical relations afforded by each concept. These relational possibilities are evident at a linguistic level in the syntagmatic patterns that connect nouns to the verbal actions that act upon, or are facilitated by, these nouns. We present a model of noun-compound interpretation that first learns … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
31
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(31 citation statements)
references
References 15 publications
0
31
0
Order By: Relevance
“…At a computational level, the proposed framework for anaphora resolution allows us to marry the two nlp areas so that we can better share computational advances in the two research areas. Recently there has been an increased momentum [13,26,20,4,15,21,1,11] towards automatic derivation of relations between composite nouns in noun compounds, most of them based on relations from [18]. This will result in an increasing amount of ontology representing semantic relations used for generating compound nouns.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…At a computational level, the proposed framework for anaphora resolution allows us to marry the two nlp areas so that we can better share computational advances in the two research areas. Recently there has been an increased momentum [13,26,20,4,15,21,1,11] towards automatic derivation of relations between composite nouns in noun compounds, most of them based on relations from [18]. This will result in an increasing amount of ontology representing semantic relations used for generating compound nouns.…”
Section: Discussionmentioning
confidence: 99%
“…Some works in the computational lin-1 same meaning relation 2 same subset/superset relation 3 part/whole relation guistics (eg. [4,20]) assume the existence of an unbounded number of relations while others (eg. [16,13]) use categories similar to Levi's finite set.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed framework for anaphora resolution allows us to marry the two nlp areas so that we can better share computational advances in the two research areas. Recently there has been an increased momentum [15], [11], [13], [12], [25], [26], [27], [28] towards automatic derivation of relations between composite nouns in noun compounds, most of them based on relations from [19]. This will result in an increasing amount of ontology describing the semantic relations between compound nouns which will also become useful for anaphora interpretation if there is an existence of a common framework.…”
Section: Discussionmentioning
confidence: 99%
“…Some works in the computational linguistics (eg. [12], [13]) assume the existence an unbounded number of relations while others (eg. [14], [15]) use categories similar to Levi's finite set.…”
Section: Related Workmentioning
confidence: 99%
“…One such relational reasoning task is the problem of compound noun interpretation, which has received a great deal of attention in recent years (Girju et al, 2005;Turney, 2006;Butnariu and Veale, 2008). In English (and other languages), the process of producing new lexical items through compounding is very frequent and very productive.…”
Section: Introductionmentioning
confidence: 99%