arXiv AI

Corpus Quality Improves, Retrieval Utility Does Not: An Ablation of Preprocessing and Refinement in a Speech-to-QA Pipeline

arXiv Computation and Language
Sep 1

Annotated Surrogate Retrieval for Polish Statutory Law

The paper introduces three retrieval methods for Polish statutory law that use language‑model annotations attached to articles as surrogates. The methods—ASCR, ASCR‑H, and DTF—vary in cost and quality, with ASCR‑H achieving the highest rank‑one accuracy on bar exam questions, while DTF offers competitive performance with lower latency and cost. Extensive evaluation against 14 baselines on 300 exam questions demonstrates significant improvements in head‑rank accuracy and discusses limitations such as coverage asymmetry and negative results for lemmatisation, pseudo‑relevance feedback, and query rewriting.

By Orkun Yi\u{g}it Cengiz
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
arXiv AI
Sep 25

No More Free Lunch: Corpus Task Complexity Matters as Corpora Grow

The paper introduces Corpus Task Complexity (CTC), a metric that captures how a task’s difficulty scales with corpus size. It distinguishes low‑CTC tasks, whose difficulty grows linearly, from high‑CTC tasks, whose difficulty grows quadratically or more, and presents ten new high‑CTC tasks. Experiments show that models performing well on low‑CTC tasks often fail on high‑CTC tasks, highlighting the need for new approaches to large‑corpus reasoning.

By Prasann Singhal, Amanda Bertsch, Jacob Steinhardt, Sewon Min
arXiv Machine Learning
Oct 12

Forecasting Corpus-Sampling Disagreement in Masked Text Reconstruction

The paper investigates how much a masked‑text reconstruction predictor’s outputs would differ if a second corpus were collected from the same population. Using a smoothed predictor based on token‑pair counts, the authors derive a first‑order formula for expected disagreement between predictors trained on two independent corpora, accounting for document length, random context counts, and token‑offset correlations. Experiments on TinyStories, WikiText‑103, and CNN/DailyMail show that increasing corpus size from 512 to 2,048 chunks of 64 tokens reduces disagreement only modestly (5–40 %), and that forecast accuracy improves with larger reference corpora and a source‑split jackknife correction. whyItMatters:"The study provides a practical method to estimate how much predictor outputs would change with additional data, informing decisions about data collection and model robustness in masked‑text reconstruction tasks."

By Hare Krishna
arXiv Machine Learning
Aug 5

M-GATE: Multilingual Grammar, Accuracy in Translation, and Efficiency Benchmark for Large Language Models

arXiv:2608. 03803v1 Announce Type: cross Abstract: Multilingual language models are deployed across a hundred or more languages, yet most benchmarks test whether a model can perform a task _in_ a language rather than whether it commands the language itself, conflating fluency with proficiency.

By Tom\'a\v{s} Burkert, Angelika Peljak-{\L}api\'nska, David Zelen\'y
arXiv AI
Oct 5

Sentence-Level Context Sensitivity as a Training-Free Detector of Unsupported Content, Evaluated Against Trained Verifiers

The paper proposes a training‑free detector that uses sentence‑level context sensitivity to identify unsupported content in retrieval‑augmented generation (RAG) answers. By re‑scoring each sentence with full context, no context, and each chunk removed, the method flags the chunk whose removal most reduces a sentence’s likelihood as the likely source. Evaluated on RAGTruth, TofuEval, and RAGBench, the detector outperforms answer‑level faithfulness scores, achieving AUCs up to 0.745 and matching per‑chunk fact‑checkers while using only a fraction of the compute required by large‑language‑model judges.

By Mohamed Aly Bouke