The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Automatic Discovery of Part–Whole Relations
Open accessAbstract
An important problem in knowledge discovery from text is the automatic extraction of semantic relations. This paper presents a supervised, semantically intensive, domain independent approach for the automatic detection of part-whole relations in text. First an algorithm is described that identifies lexico-syntactic patterns that encode part-whole relations. A difficulty is that these patterns also encode other semantic relations, and a learning method is necessary to discriminate whether or not a pattern contains a part-whole relation. A large set of training examples have been annotated and fed into a specialized learning system that learns classification rules. The rules are learned through an iterative semantic specialization (ISS) method applied to noun phrase constituents. Classification rules have been generated this way for different patterns such as genitives, noun compounds, and noun phrases containing prepositional phrases to extract part-whole relations from them. The applicability of these rules has been tested on a test corpus obtaining an overall average precision of 80.95% and recall of 75.91%. The results demonstrate the importance of word sense disambiguation for this task. They also demonstrate that different lexico-syntactic patterns encode different semantic information and should be treated separately in the sense that different clarification rules apply to different patterns.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonparametric Statistics for the Behavioral Sciences
Guitton, H., & Siegel, S. (1958) · Revue économique · doi:10.2307/3498751 · Cited by 35,245
(1992) · Cited by 23,431
WordNet: An Electronic Lexical Database
Kilgarriff, A., & Fellbaum, C. (2000) · Language · doi:10.2307/417141 · Cited by 11,464
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Automatic acquisition of hyponyms from large text corpora
Hearst, M. A. (1992) · Proceedings of the 14th conference on Computational linguistics - · doi:10.3115/992133.992154 · Cited by 3,253
Accurate methods for the statistics of surprise and coincidence
Dunning, T. E. (1993) · doi:10.5555/972450.972454 · Cited by 2,647
De Roeck, A. (1995) · Handbook of Pragmatics · doi:10.1075/hop.m.comm2 · Cited by 1,715
Automatic Labeling of Semantic Roles
Gildea, D., & Jurafsky, D. (2002) · Computational Linguistics · doi:10.1162/089120102760275983 · Cited by 1,626
(1999) · Cited by 1,521
Brill, E. (1995) · Cited by 1,520
Cited by
Navigli, R., & Ponzetto, S. P. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.07.001 · Cited by 1,465
Distributional Memory: A General Framework for Corpus-Based Semantics
Baroni, M., & Lenci, A. (2010) · Computational Linguistics · doi:10.1162/coli_a_00016 · Cited by 659
Espresso: leveraging generic patterns for automatically harvesting semantic relations
Pantel, P., & Pennacchiotti, M. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220190 · Cited by 529
Sentiment Analysis: Mining Opinions, Sentiments, and Emotions
Liu, B. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108639286 · Cited by 362
Extraction of temporal facts and events from Wikipedia
Kuzey, E., & Weikum, G. (2012) · Proceedings of the 2nd Temporal Web Analytics Workshop · doi:10.1145/2169095.2169101 · Cited by 32
Metadata
- Authors
- Girju, R., Badulescu, A., & Moldovan, D.
- Venue
- Computational Linguistics
- Publisher
- MIT Press - Journals
- Published
- 2006-03-01
- Volume
- 32
- Issue
- 1
- Pages
- 83-135
- ISSN
- 0891-2017 (ISSN-L)
- 1530-9312
- OpenAlex
- W2133656631
- Cited by
- 271
- References
- 25
- FWCI
- 19.52
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automatic Discovery of Part–Whole Relations. https://app.cochat.ai/papers/10.1162/089120106776173075
- The paper
- Girju, R., Badulescu, A., & Moldovan, D. (2006). Automatic Discovery of Part–Whole Relations. Computational Linguistics. https://doi.org/10.1162/089120106776173075
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.