Rewarding Coreference Resolvers for Being Consistent with World Knowledge

Rahul Aralikatte, Heather Lent, Ana Valeria Gonzalez, Daniel Herschcovich, Chen Qiu, Anders Sandholm, Michael Ringaard, Anders Søgaard
2019 Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)  
Unresolved coreference is a bottleneck for relation extraction, and high-quality coreference resolvers may produce an output that makes it a lot easier to extract knowledge triples. We show how to improve coreference resolvers by forwarding their input to a relation extraction system and reward the resolvers for producing triples that are found in knowledge bases. Since relation extraction systems can rely on different forms of supervision and be biased in different ways, we obtain the best
more » ... ormance, improving over the state of the art, using multi-task reinforcement learning. tic Web Conference, ISWC'07/ASWC'07, pages 722-735, Berlin, Heidelberg. Springer-Verlag. . 2014. Typed tensor decomposition of knowledge bases for relation extraction. In EMNLP. Kevin Clark and Christopher D Manning. 2016. Deep reinforcement learning for mention-ranking coreference models. In
doi:10.18653/v1/d19-1118 dblp:conf/emnlp/AralikatteLGHQS19 fatcat:qvblhbwctnbsvpppmrvpphbaju