Automatic Thesaurus Construction based on Grammatical Relations
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Natural Language. Pages 1308-1312.
Abstract
We propose a method to build thesauri on the basis of grammatical relations. The proposed method constructs thesauri by using a hierarchical clustering algorithm. An important point in this paper is the claim that thesauri in order to be efficient need to take (surface) case information into account. We refer to the thesauri as "relation-based thesaurus (RBT)." In the experiment, four RBTs of Japanese nouns were constructed from 26,023 verb-noun cooccurrences, and each RBT was evaluated by objective criteria. The experiment has shown that the RBTs have better properties for selectional restriction of case frames than conventional ones.
@inproceedings{ijcai1995p168,
title = {Automatic Thesaurus Construction based on Grammatical Relations},
author = {Tokunaga, Takenobu and Iwayama, Makoto and Tanaka, Hozumi},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1308--1312},
year = {1995},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1995/168},
}
TY - CPAPER TI - Automatic Thesaurus Construction based on Grammatical Relations AU - Tokunaga, Takenobu AU - Iwayama, Makoto AU - Tanaka, Hozumi T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1308 EP - 1312 UR - https://ijcai.org/proceedings/1995/168 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
