Pith. sign in

REVIEW 1 cited by

Entity Relation Extraction as Dependency Parsing in Visually Rich Documents

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 2110.09915 v1 pith:LYVZTNZV submitted 2021-10-19 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords dependencydifferententitymodelextractionparsingrelationrelations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Previous works on key information extraction from visually rich documents (VRDs) mainly focus on labeling the text within each bounding box (i.e., semantic entity), while the relations in-between are largely unexplored. In this paper, we adapt the popular dependency parsing model, the biaffine parser, to this entity relation extraction task. Being different from the original dependency parsing model which recognizes dependency relations between words, we identify relations between groups of words with layout information instead. We have compared different representations of the semantic entity, different VRD encoders, and different relation decoders. The results demonstrate that our proposed model achieves 65.96% F1 score on the FUNSD dataset. As for the real-world application, our model has been applied to the in-house customs data, achieving reliable performance in the production setting.

Discussion (0). Continue with ORCID 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. Hierarchical Document Parsing via Large Margin Feature Matching and Heuristics

    cs.CL 2025-02 conditional novelty 4.0 of 10

    By adding an ArcFace-style margin to a CLIP-like matching loss and applying dataset-specific greedy rules, the solution reaches 0.98904 private-leaderboard accuracy on the VRD-IU document hierarchy task.

Pith tools