Related Term Collection
-
- SASAKI YASUHIRO
- Graduate School of Informatics, Kyoto University
-
- SATO SATOSHI
- Graduate School of Engineering, Nagoya University
-
- UTSURO TAKEHITO
- Graduate School of Systems and Information Engineering, University of Tsukuba
Bibliographic Information
- Other Title
-
- 関連用語収集問題とその解法
- カンレン ヨウゴ シュウシュウ モンダイ ト ソノ カイホウ
Search this article
Abstract
This paper proposes the related term collection problem and its solution.The related term collection problem is defined as collecting a dozen of technical terms that are closely related to a given seed term.In order to solve this problem, we use the Jaccard coefficient or the x2 statistics on the Web, which is calculated by the search engine hits, for measuring relatedness between the given seed term and a candidate term.These measures also verify that the candidate term is a technical term.We have implemented a related term collection system, which consists of two modules. The first module collects candidate terms from the web pages that are retrieved by a search engine.The second module selects the terms that are closely related to the given term by using one of the above two measures.Experimental results show that the system can collect a dozen of closely related terms of the given term.
Journal
-
- Journal of Natural Language Processing
-
Journal of Natural Language Processing 13 (3), 151-175, 2006
The Association for Natural Language Processing
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679452727296
-
- NII Article ID
- 10018202830
-
- NII Book ID
- AN10472659
-
- ISSN
- 21858314
- 13407619
- http://id.crossref.org/issn/13407619
-
- NDL BIB ID
- 8048842
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed