In-domain relation discovery with meta-constraints via posterior regularization
Name
Barzilay-In-domain Relation.pdf
Size
448.62 KB
Format
Adobe PDF
Checksum (MD5)
a4b5464ccbe0943cc63dec43f64d4068
Author(s) • • •
Chen, Harr
Benson, Edward Oscar
Naseem, Tahira
Barzilay, Regina
Date Issued
June 2011
Journal
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1, ACL HLT '11
Publisher
Association for Computing Machinery
Citation
Chen, Harr et al. "In-domain Relation Discovery with Meta-constraints via Posterior Regularization." Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1, HLT '11, Portland, Oregon, USA, June 19-24, 2011.
Version
Author's final manuscript
Abstract
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting meta-constraints that characterize the general qualities of a good relation in any domain. These constraints state that instances of a single relation should exhibit regularities at multiple levels of linguistic structure, including lexicography, syntax, and document-level context. We capture these regularities via the structure of our probabilistic model as well as a set of declaratively-specified constraints enforced during posterior inference. Across two domains our approach successfully recovers hidden relation structure, comparable to or outperforming previous state-of-the-art approaches. Furthermore, we find that a small set of constraints is applicable across the domains, and that using domain-specific constraints can further improve performance.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://dl.acm.org/citation.cfm?id=2002472.2002540&coll=DL&dl=ACM&CFID=87070219&CFTOKEN=34670296