抄録
This paper presents a novel method for acquiring a set of query patterns to retrieve documents containing important information about an entity. Given an existing Wikipedia category that contains the target entity, we extract and select a small set of query patterns by presuming that formulating search queries with these patterns optimizes the overall precision and coverage of the returned Web information. We model this optimization problem as a weighted maximum satisfiability (weighted Max-SAT) problem. The experimental results demonstrate that the proposed method outperforms other methods based on statistical measures such as frequency and point-wise mutual information (PMI), which are widely used in relation extraction.
| 本文言語 | English |
|---|---|
| ホスト出版物のタイトル | Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference |
| ページ | 1229-1237 |
| ページ数 | 9 |
| 巻 | 2 |
| 出版ステータス | Published - 2010 |
| 外部発表 | はい |
| イベント | 23rd International Conference on Computational Linguistics, Coling 2010 - Beijing 継続期間: 2010 8月 23 → 2010 8月 27 |
Other
| Other | 23rd International Conference on Computational Linguistics, Coling 2010 |
|---|---|
| City | Beijing |
| Period | 10/8/23 → 10/8/27 |
ASJC Scopus subject areas
- 言語および言語学
- 計算理論と計算数学
- 言語学および言語