書誌事項
- タイトル別名
-
- Related Term Collection
- カンレン ヨウゴ シュウシュウ モンダイ ト ソノ カイホウ
この論文をさがす
抄録
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.
収録刊行物
-
- 自然言語処理
-
自然言語処理 13 (3), 151-175, 2006
一般社団法人 言語処理学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679452727296
-
- NII論文ID
- 10018202830
-
- NII書誌ID
- AN10472659
-
- ISSN
- 21858314
- 13407619
- http://id.crossref.org/issn/13407619
-
- NDL書誌ID
- 8048842
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可
