arXiv Computation and Language

Enhancing Knowledge Entity Relation Extraction in Abstracts and Full-text Content of Academic Articles Using Large Language Models

The paper evaluates large pre‑trained language models (LLMs) for knowledge entity relation extraction (KERE) from academic articles, comparing multiple strategies such as closed‑source LLM CoT prompting, LoRA‑adapted open‑source LLMs, and various LLM‑enhanced small pre‑trained language models (SLMs). Two manually annotated datasets in the NLP domain—one for abstracts and one for full texts—were used, and the LoRA‑adapted T5 model achieved the highest macro F1 scores (0.7408 for abstracts and 0.7013 for full texts). Error analysis shows that LLM‑based strategies mitigate SLM errors differently across error types, and combining complementary strategies further improves KERE performance.

arXiv Computation and Language
Sep 16

SciNLP: A Domain-Specific Benchmark for Full-Text Scientific Entity and Relation Extraction in NLP

SciNLP is a new benchmark dataset for full‑text entity and relation extraction in the NLP domain, comprising 60 manually annotated papers with 6,429 entities and 1,649 relations. It is the first dataset to provide full‑text annotations of entities and their relationships specifically for NLP literature. Experiments show that models trained on SciNLP outperform baselines on certain tasks, and the dataset enabled the automatic construction of a fine‑grained knowledge graph with an average node degree of 3.3.

By Decheng Duan, Yingyi Zhang, Jitong Peng, Chengzhi Zhang
arXiv Computation and Language
Sep 25

CONSISTRE: A Unified Consistency-Aware Framework for Document-Level Relation Extraction with Large Language Models

CONSISTRE is a consistency‑aware framework for document‑level relation extraction that tackles contradictions in large language model predictions. It offers two tracks: an inference‑time track that refines black‑box LLM outputs through constraint‑aware prompting, verification, and self‑reflection, and a training‑time track that distills consistency knowledge into smaller open‑source models via supervised fine‑tuning and reinforcement learning. Experiments on DocRED show both tracks outperform baselines, with the inference‑time track matching competitive F1 scores and the training‑time track narrowing the performance gap to proprietary LLMs while reducing inference cost.

By Mingxuan Sun
arXiv Computation and Language
Sep 18

LMEnt: A Suite for Analyzing Knowledge in Language Models from Pretraining Data to Representations

LMEnt is a toolkit designed to study how language models acquire and represent world knowledge. It includes a richly annotated pretraining corpus, an improved entity-based retrieval method, and twelve pretrained models with numerous checkpoints. The suite enables controlled experiments linking entity mentions in training data to downstream knowledge performance, revealing how co-occurrence patterns influence learning and editing difficulty.

By Daniela Gottesman, Alon Gilae-Dotan, Ido Cohen, Yoav Gur-Arieh, Marius Mosbach, Ori Yoran, Mor Geva
Hugging Face Trending Papers
Jul 27

CONSISTRE: A Unified Consistency-Aware Framework for Document-Level Relation Extraction with Large Language Models

Document-level relation extraction (DocRE) aims to extract relations among multiple entities across extended contexts while maintaining consistency across predicted triples. Although large language models (LLMs) show remarkable reasoning capabilities in information extraction, their predictions are typically generated independently for each candidate triple and may violate fundamental relational constraints such as transitivity, symmetry, and functional uniqueness, leading to contradictory and unreliable outputs.

arXiv Computation and Language
Sep 14

Extracting Dataset Mentions in Forced Displacement and FCV Documents: A Weakly Supervised Framework with LLM-Based Label Refinement

The paper introduces a weakly supervised framework for extracting dataset mentions from forced displacement and Fragile, Conflict, and Violence (FCV) documents. It uses a lightweight model trained on general research literature to generate candidate mentions, which are then refined by a large language model that validates or rejects them and corrects boundaries. The refined annotations are augmented with synthetic and contrastive examples to fine‑tune the model, achieving 74.1% precision and 70.5% recall on a benchmark of 1,706 passages, with higher precision (89.5%) on passages that contain dataset references.

By Rafael Macalaba, Aivin V. Solatorio, Patrick Michael Brock, Olivier Dupriez
arXiv Computation and Language
Oct 12

OARelatedWork: A Large-Scale Dataset of Related Work Sections with Full-texts from Open Access Sources

OARelatedWork is a large‑scale dataset for generating entire related‑work sections from open‑access papers, comprising 94,450 papers across multiple domains. It includes full texts of cited works and is designed so every source paper is available in full, enabling controlled evaluation of full‑text related‑work generation. The paper benchmarks various models, shows that large language models struggle with massive full‑text contexts, and introduces a statement‑level evaluation framework to better assess long‑form structured outputs.

By Martin Docekal, Martin Fajcik, Pavel Smrz
arXiv Machine Learning
Oct 9

BioBigBird: A Sparse Attention Model for Long-Range Dependency Processing in Biomedical Text

BioBigBird is a bidirectional language model tailored for biomedical text that uses sparse attention to process sequences up to 4096 tokens, addressing the limited context windows of existing domain-specific LLMs. It is pre‑trained on extensive biomedical literature and clinical data, with a multi‑stage training process to reduce noise and a multi‑task learning framework that jointly optimizes Named Entity Recognition and Relation Extraction. Evaluations on the BLURB benchmark show that the MTL‑enhanced BioBigBird achieves highly competitive results against state‑of‑the‑art models, and the models are publicly available on Hugging Face.

By Roshan Balaji, Pavan Kumar S, Vasudev Gupta, Sreejith N, Keerthana Sridhar, Nirav Bhatt