{"type":"ScholarlyArticle","title":"Automatic Thesaurus Construction based on Grammatical Relations","authors":[{"name":"Takenobu Tokunaga","slug":"takenobu-tokunaga","given":"Takenobu","family":"Tokunaga","affiliation":""},{"name":"Makoto Iwayama","slug":"makoto-iwayama","given":"Makoto","family":"Iwayama","affiliation":""},{"name":"Hozumi Tanaka","slug":"hozumi-tanaka","given":"Hozumi","family":"Tanaka","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1995/168","pdf":"https://ijcai.org/proceedings/1995/0168.pdf","markdown":"https://ijcai.org/proceedings/1995/168.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/168","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Natural Language","track":"Natural Language","number":168,"pages":{"first":1308,"last":1312},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}