We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1904.03296")
get_code_for_paper("1904.03296")
have("1904.03296")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1904.03296.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1904.03296)
Connect an agent — have() is free.