Pith. sign in

REVIEW 1 cited by

Reasoning with Latent Structure Refinement for Document-Level Relation Extraction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.06312 v3 pith:I23JZK57 submitted 2020-05-13 cs.CL

classification cs.CL
keywords document-levelmodelinformationreasoningableacrossdatasetdocument
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Document-level relation extraction requires integrating information within and across multiple sentences of a document and capturing complex interactions between inter-sentence entities. However, effective aggregation of relevant information in the document remains a challenging research question. Existing approaches construct static document-level graphs based on syntactic trees, co-references or heuristics from the unstructured text to model the dependencies. Unlike previous methods that may not be able to capture rich non-local interactions for inference, we propose a novel model that empowers the relational reasoning across sentences by automatically inducing the latent document-level graph. We further develop a refinement strategy, which enables the model to incrementally aggregate relevant information for multi-hop reasoning. Specifically, our model achieves an F1 score of 59.05 on a large-scale document-level dataset (DocRED), significantly improving over the previous results, and also yields new state-of-the-art results on the CDR and GDA dataset. Furthermore, extensive analyses show that the model is able to discover more accurate inter-sentence relations.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-Relation Extraction in Entity Pairs using Global Context

    cs.CL 2025-07 reject novelty 3.0 of 10

    A BERT input format that appends the head and tail entity names after the document is claimed to beat all prior document-level relation extraction systems, but the reported gains rest on misaligned evaluation protocols.

Pith tools