Title: An incremental construction method of a large-scale thesaurus using co-occurrence information

Authors: Kazuhiro Morita; Hiroya Kitagawa; Masao Fuketa; Jun-ichi Aoe

Addresses: Department of Information Science and Intelligent Systems, The University of Tokushima, Minami-Josanjima, Tokushima-shi, Tokushima, 770-8506, Japan ' Department of Information Science and Intelligent Systems, The University of Tokushima, Minami-Josanjima, Tokushima-shi, Tokushima, 770-8506, Japan ' Department of Information Science and Intelligent Systems, The University of Tokushima, Minami-Josanjima, Tokushima-shi, Tokushima, 770-8506, Japan ' Department of Information Science and Intelligent Systems, The University of Tokushima, Minami-Josanjima, Tokushima-shi, Tokushima, 770-8506, Japan

Abstract: A thesaurus is one of important knowledge in natural language processing and is manually made in general. However, as growth of the scale, frequent update is difficult because it takes huge time by hand. This paper aims to construct a hierarchical large-scale thesaurus by a clustering scheme based on co-occurrence information among words. In the proposed clustering algorithm, the Kullback-Leibler divergence is introduced as a similarity measurement in order to judge superordinate and subordinate relations. Besides, the thesaurus tree can be incrementally updated in each node for a minute change such as the addition of unknown words. In order to evaluate the presented method, a thesaurus consisting of about 60,000 words is made by using about 16 million co-occurrence relationships extracted from the Google N-gram. From random data in the thesaurus, it turns out that the proposed method for a large-scale thesaurus achieves high precision of 0.826.

Keywords: large-scale thesaurus; co-occurrence relationships; clustering algorithms; similarity measurement; natural language processing; NLP.

DOI: 10.1504/IJCAT.2013.056018

International Journal of Computer Applications in Technology, 2013 Vol.48 No.2, pp.120 - 129

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 24 Aug 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article