Abstract
We present a simple algorithm for clustering semantic patterns based on distributional similarity and use cluster memberships to guide semi-supervised pattern discovery. We apply this approach to the task of relation extraction. The evaluation results demonstrate that our novel bootstrapping procedure significantly outperforms a standard bootstrapping. Most importantly, our algorithm can effectively prevent semantic drift and provide semi-supervised learning with a natural stopping criterion.
Original language | English (US) |
---|---|
Title of host publication | Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference |
Pages | 1194-1202 |
Number of pages | 9 |
Volume | 2 |
State | Published - 2010 |
Event | 23rd International Conference on Computational Linguistics, Coling 2010 - Beijing, China Duration: Aug 23 2010 → Aug 27 2010 |
Other
Other | 23rd International Conference on Computational Linguistics, Coling 2010 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 8/23/10 → 8/27/10 |
ASJC Scopus subject areas
- Language and Linguistics
- Computational Theory and Mathematics
- Linguistics and Language