Both entity and relation extraction can benefit from being performed jointly, allowing each task to correct the errors of the other. We present a new method for joint entity and relation extraction using a graph we call a "card-pyramid". This graph compactly encodes all possible entities and relations in a sentence, reducing the task of their joint extraction to jointly labeling its nodes. We give an efficient labeling algorithm that is analogous to parsing using dynamic programming. Experimental results show improved results for our joint extraction method compared to a pipelined approach.

PDF

In Proceedings of the Fourteenth Conference on Computational Natural Language Learning (CoNLL-2010), pp. 203--212, Uppsala, Sweden, July 2010.

@inproceedings{Kate:CoNLL-2010, title={Joint Entity and Relation Extraction using Card-Pyramid Parsing}, author={Rohit J. Kate and Raymond J. Mooney}, booktitle={Proceedings of the Fourteenth Conference on Computational Natural Language Learning (CoNLL-2010)}, month={July}, address={Uppsala, Sweden}, pages={203--212}, url="http://www.cs.utexas.edu/users/ai-lab?Kate:CoNLL-2010", year={2010} }

Slides (PPT)