Automatic acquisition of hyponyms from large text corpora
M. Hearst.
Proceedings of the 14th conference on Computational linguistics, 2, Seite 539--545. Stroudsburg, PA, USA, Association for Computational Linguistics, (1992)

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.

URL

http://dx.doi.org/10.3115/992133.992154

Suchen auf

Diese Publikation wurde noch nicht bewertet.

Bewertungsverteilung

Durchschnittliche Benutzerbewertung0,0 von 5.0 auf Grundlage von 0 Rezensionen

Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.

@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 = {2012-11-16T14:08:07.000+0100},
  address = {Stroudsburg, PA, USA},
  author = {Hearst, Marti A.},
  biburl = {https://puma.uni-kassel.de/bibtex/22c49ad19ac6977bd806b6687e4dcc550/jaeschke},
  booktitle = {Proceedings of the 14th conference on Computational linguistics},
  doi = {10.3115/992133.992154},
  interhash = {8c1e90c6cc76625c34f20370a1af7ea2},
  intrahash = {2c49ad19ac6977bd806b6687e4dcc550},
  keywords = {corpus hearst learning linguistics ontology pattern text},
  location = {Nantes, France},
  numpages = {7},
  pages = {539--545},
  publisher = {Association for Computational Linguistics},
  timestamp = {2012-11-16T14:08:07.000+0100},
  title = {Automatic acquisition of hyponyms from large text corpora},
  url = {http://dx.doi.org/10.3115/992133.992154},
  volume = 2,
  year = 1992
}

%0 Conference Paper
%1 hearst1992automatic
%A Hearst, Marti A.
%B Proceedings of the 14th conference on Computational linguistics
%C Stroudsburg, PA, USA
%D 1992
%I Association for Computational Linguistics
%K corpus hearst learning linguistics ontology pattern text
%P 539--545
%R 10.3115/992133.992154
%T Automatic acquisition of hyponyms from large text corpora
%U http://dx.doi.org/10.3115/992133.992154
%V 2
%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.

PUMA

Automatic acquisition of hyponyms from large text corpora
M. Hearst.
Proceedings of the 14th conference on Computational linguistics, 2, Seite 539--545. Stroudsburg, PA, USA, Association for Computational Linguistics, (1992)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

PUMA

Automatic acquisition of hyponyms from large text corporaM. Hearst. Proceedings of the 14th conference on Computational linguistics, 2, Seite 539--545. Stroudsburg, PA, USA, Association for Computational Linguistics, (1992)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

Automatic acquisition of hyponyms from large text corpora
M. Hearst.
Proceedings of the 14th conference on Computational linguistics, 2, Seite 539--545. Stroudsburg, PA, USA, Association for Computational Linguistics, (1992)