Abstract
This paper proposes to use a convolution kernel over parse trees to model syntactic structure information for relation extraction. Our study reveals that the syntactic structure features embedded in a parse tree are very effective for relation extraction and these features can be well captured by the convolution tree kernel. Evaluation on the ACE 2003 corpus shows that the convolution kernel over parse trees can achieve comparable performance with the previous best-reported feature-based methods on the 24 ACE relation subtypes. It also shows that our method significantly outperforms the previous two dependency tree kernels on the 5 ACE relation major types.
| Original language | English |
|---|---|
| Pages | 288-295 |
| Number of pages | 8 |
| DOIs | |
| State | Published - 2006 |
| Externally published | Yes |
| Event | 2006 Human Language Technology Conference - North American Chapter of the Association for Computational Linguistics Annual Meeting, HLT-NAACL 2006 - New York, NY, United States Duration: 4 Jun 2006 → 9 Jun 2006 |
Conference
| Conference | 2006 Human Language Technology Conference - North American Chapter of the Association for Computational Linguistics Annual Meeting, HLT-NAACL 2006 |
|---|---|
| Country/Territory | United States |
| City | New York, NY |
| Period | 4/06/06 → 9/06/06 |
Fingerprint
Dive into the research topics of 'Exploring syntactic features for relation extraction using a convolution tree kernel'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver