arXiv AI By Zhongqiu Li, Boyang Wang, Ruiyu Fang, Shiquan Wang, Di Wu, Jiayi Liang, Feilong Zhang, Hongfeng Du, Xiaomeng Huang, Mengjiao Bao, Luwen Pu, Xuewei He, Yu Zhao, Chao Wang, Kaidong Yu, Bingkai Yang, Qingjun Zhu, Shaoyi Du, Shuangyong Song, Yongxiang Li

Xing USP: A Cross-Family Semantic Contract for Information Extraction and Intent-Slot Parsing

Read the original on arXiv AI →

The Flow has not summarised this story yet — read it at arXiv AI.

arXiv Computation and Language
Sep 25

Clinical Intent Extraction: A FHIR-Aligned Representation and the CIRCA Benchmark

The paper introduces Clinical Intent Extraction (CIE), a task that transforms fragmented clinical action annotations into complete structured records called Clinical Intent Representation (CIR). CIR decomposes each action into verb, type, coded target, timing, condition, request‑intent (aligned to HL7 FHIR) and modality, adding dimensions absent in prior datasets. By re‑expressing five heterogeneous corpora into CIR, the authors create CIRCA, a benchmark of 10,011 harmonized intents with human‑validated subsets, crosswalks, and a deterministic FHIR R4 mapper, and demonstrate that existing models perform poorly on the full task, highlighting the need for targeted development.

By Alexander Apartsin, Yehudit Aperstein
arXiv Computation and Language
Sep 1

Configurable Semantic Chunking for Biomedical Information Extraction in Retrieval-Augmented Generation

The paper introduces a configurable semantic chunking framework for biomedical information extraction in retrieval‑augmented generation systems. It replaces the fixed‑size chunking stage of BioMedRAG with entity‑preserving windows, trigger‑centered chunking, proposition‑first extraction, tiered trigger prioritization, and hierarchical relation resolution, while keeping the rest of the pipeline unchanged. Experiments on relation extraction benchmarks (GM‑CIHT, DDI, ChemProt) and adverse event classification (ADE) show that the hybrid configuration boosts performance on datasets with explicit relation cues, achieving 82.6% F1 on GM‑CIHT compared to 74.2% with the baseline.

By Riya Ahuja (Institute of Data Science in Biomedicine, TU Braunschweig, Braunschweig, Germany, Braunschweig Integrated Centre of Systems Biology, TU Braunschweig, Braunschweig, Germany), Tim Kacprowski (Institute of Data Science in Biomedicine, TU Braunschweig, Braunschweig, Germany, Braunschweig Integrated Centre of Systems Biology, TU Braunschweig, Braunschweig, Germany), Roya Shiasi Sardoabi (Institute of Data Science in Biomedicine, TU Braunschweig, Braunschweig, Germany, Braunschweig Integrated Centre of Systems Biology, TU Braunschweig, Braunschweig, Germany)
arXiv Computation and Language
Oct 5

Writerslogic at the CLEF 2026 SimpleText Track: Multi-Candidate LLM Simplification and Stacked Complexity Spotting

The Writerslogic team participated in the CLEF 2026 SimpleText shared task, tackling both text simplification (Task 1) and complexity spotting (Task 2). For simplification, they built a multi‑candidate pipeline with GPT‑4o‑mini, selecting the best candidate via a reference‑free heuristic, and their Claude Sonnet 4 submission achieved a SARI of 47.43 and BLEU of 14.21, ranking third overall on the Task 1 leaderboard. For complexity spotting, they fine‑tuned a DeBERTa‑v3‑large NLI model on 350 K labeled pairs, achieving a macro F1 of 0.8081 (0.8085 in an ensemble) on binary over‑generation identification and 0.804 accuracy on multi‑class error classification, placing them second among unique teams.

By David L. Condrey