Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

A General Framework for Information Extraction using Dynamic Span Graphs

About

We introduce a general framework for several information extraction tasks that share span representations using dynamically constructed span graphs. The graphs are constructed by selecting the most confident entity spans and linking these nodes with confidence-weighted relation types and coreferences. The dynamic span graph allows coreference and relation type confidences to propagate through the graph to iteratively refine the span representations. This is unlike previous multi-task frameworks for information extraction in which the only interaction between tasks is in the shared first-layer LSTM. Our framework significantly outperforms the state-of-the-art on multiple information extraction tasks across multiple datasets reflecting different domains. We further observe that the span enumeration approach is good at detecting nested span entities, with significant F1 score improvement on the ACE dataset.

Yi Luan, Dave Wadden, Luheng He, Amy Shah, Mari Ostendorf, Hannaneh Hajishirzi• 2019

Related benchmarks

TaskDatasetResultRank
Nested Named Entity RecognitionACE 2004 (test)
F1 Score84.7
166
Nested Named Entity RecognitionACE 2005 (test)
F1 Score82.9
153
Nested Named Entity RecognitionGENIA (test)
F1 Score76.2
140
Relation ExtractionACE05 (test)
F1 Score63.2
72
Named Entity RecognitionACE 2005 (test)
F1 Score88.4
58
Nested Named Entity RecognitionGENIA
F1 Score76.2
56
Entity extractionACE05 (test)
F1 Score88.4
53
Nested Named Entity RecognitionACE 2005
F1 Score82.9
52
Named Entity RecognitionACE04 (test)
F1 Score87.4
36
Named Entity RecognitionGENIA (test)
F1 Score76.2
34
Showing 10 of 22 rows

Other info

Code

Follow for update