Abstract
This paper investigates how to improve performance on information extraction tasks by constraining and sequencing CRF-based approaches. We consider two different relation extraction tasks, both from the medical literature: dependence relations and probability statements. We explore whether adding constraints can lead to an improvement over standard CRF decoding. Results on our relation extraction tasks are promising, showing significant increases in performance from both (i) adding constraints to post-process the output of a baseline CRF, which captures “domain knowledge”, and (ii) further allowing flexibility in the application of those constraints by leveraging a binary classifier as a pre-processing step.- Anthology ID:
- E17-1079
- Volume:
- Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers
- Month:
- April
- Year:
- 2017
- Address:
- Valencia, Spain
- Editors:
- Mirella Lapata, Phil Blunsom, Alexander Koller
- Venue:
- EACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 839–849
- Language:
- URL:
- https://aclanthology.org/E17-1079
- DOI:
- Cite (ACL):
- Charles Jochim and Léa Deleris. 2017. Named Entity Recognition in the Medical Domain with Constrained CRF Models. In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, pages 839–849, Valencia, Spain. Association for Computational Linguistics.
- Cite (Informal):
- Named Entity Recognition in the Medical Domain with Constrained CRF Models (Jochim & Deleris, EACL 2017)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/E17-1079.pdf