Automatic Acquisition of Hyponyms from Large Text Corpora
M. Hearst. Proceedings of the 14th Conference on Computational Linguistics - Volume 2, page 539--545. Stroudsburg, PA, USA, Association for Computational Linguistics, (1992)
DOI: 10.3115/992133.992154
Abstract
We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested.
Description
Automatic acquisition of hyponyms from large text corpora
%0 Conference Paper
%1 hearst1992automatic
%A Hearst, Marti A.
%B Proceedings of the 14th Conference on Computational Linguistics - Volume 2
%C Stroudsburg, PA, USA
%D 1992
%I Association for Computational Linguistics
%K extraction hearst hyponymy pattern solvatio text
%P 539--545
%R 10.3115/992133.992154
%T Automatic Acquisition of Hyponyms from Large Text Corpora
%U https://doi.org/10.3115/992133.992154
%X We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested.
@inproceedings{hearst1992automatic,
abstract = {We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested.},
acmid = {992154},
added-at = {2018-02-07T15:19:52.000+0100},
address = {Stroudsburg, PA, USA},
author = {Hearst, Marti A.},
biburl = {https://www.bibsonomy.org/bibtex/2d3de00cd657ec65a772f8ad727b351e2/thoni},
booktitle = {Proceedings of the 14th Conference on Computational Linguistics - Volume 2},
description = {Automatic acquisition of hyponyms from large text corpora},
doi = {10.3115/992133.992154},
interhash = {8c1e90c6cc76625c34f20370a1af7ea2},
intrahash = {d3de00cd657ec65a772f8ad727b351e2},
keywords = {extraction hearst hyponymy pattern solvatio text},
location = {Nantes, France},
numpages = {7},
pages = {539--545},
publisher = {Association for Computational Linguistics},
series = {COLING '92},
timestamp = {2018-02-07T15:20:13.000+0100},
title = {Automatic Acquisition of Hyponyms from Large Text Corpora},
url = {https://doi.org/10.3115/992133.992154},
year = 1992
}