arXiv Computation and Language

All Entities are Not Created Equal: Examining the Long Tail for Ultra-Fine Entity Typing

arXiv AI
Jul 9

Co-LMLM: Continuous-Query Limited Memory Language Models

arXiv:2607. 07707v1 Announce Type: cross Abstract: Limited memory language models (LMLMs) externalize factual knowledge during pretraining to a knowledge base (KB), rather than memorizing it in their weights.

By Yair Feldman, Linxi Zhao, Nathan Godey, Dongyoung Go, Yilun Hua, Kilian Q. Weinberger, Jennifer J. Sun, Yoav Artzi
arXiv Machine Learning
Jun 2

GottBERT: a pure German Language Model

arXiv:2012. 02110v2 Announce Type: replace-cross Abstract: Pre-trained language models have significantly advanced natural language processing (NLP), especially with the introduction of BERT and its optimized version, RoBERTa.

By Raphael Scheible, Johann Frei, Fabian Thomczyk, Henry He, Patric Tippmann, Jochen Knaus, Victor Jaravine, Frank Kramer, Martin Boeker
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
arXiv AI
Sep 17

A Scalable Framework for Automated NER Annotation Correction in Low-Resource Languages

The paper introduces a scalable, multi-step framework designed to improve the quality of Named Entity Recognition (NER) annotations, particularly in low-resource languages. It employs a frequency-based iterative approach that combines self‑training with a dual‑threshold mechanism to increase inference confidence. Experiments on various NER datasets show notable performance gains over the original data, and the study also investigates the use of generative Large Language Models for NER tasks.

By Toqeer Ehsan, Thamar Solorio
arXiv AI
Oct 1

Synthetic Pre-pretraining Survives Scale, but Not as a Grammatical Prior

The study evaluates synthetic pre‑pretraining (PPT) across a wide range of models (500 M–7 B parameters) and training budgets (up to 100 B tokens). Results show that PPT consistently improves downstream performance and token efficiency, saving at least 21 B tokens at the 3 B scale, but these gains do not appear to stem from a grammatical prior. Instead, PPT benefits arise from tasks that enhance long‑range retrieval, and the improvements remain robust across diverse data mixtures, diminishing only when web text is omitted.

By Atsuki Yamaguchi, Tatsuro Inaba, Joel Niklaus, Michal \v{S}tef\'anik, Aline Villavicencio, Nikolaos Aletras
arXiv Computation and Language
5d ago

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.

By Yingyi Zhang, Chengzhi Zhang
arXiv Machine Learning
Aug 28

Squeezing More from Limited Data with Recursive Transformers

The paper investigates how to effectively pre‑train language models when the data budget is limited but compute is plentiful. It shows that increasing model size only improves performance up to an optimal point, after which overfitting degrades generalization, and that this optimal size varies with both the data budget and downstream tasks. To overcome the inefficiencies of standard Transformers in this regime, the authors propose recursive Transformers that reuse a shared block across depth and employ factorized embeddings, achieving better results than standard models on 10M–100M word pre‑training budgets and competitive performance with BabyLM Challenge 2025 winners.

By Serdar G\"ulbahar, Lukas Edman, Alexander Fraser
arXiv Computation and Language
Aug 25

LuxIT: A Luxembourgish Instruction Tuning Dataset from Monolingual Seed Data

LuxIT is a monolingual instruction‑tuning dataset for Luxembourgish, created by synthesizing instruction‑answer pairs from native texts using the DeepSeek‑R1‑0528 model and a quality‑assurance LLM‑as‑judge process. The resulting 227,507 high‑quality pairs were used to fine‑tune 14 LLMs (≤15 B parameters), yielding an average accuracy increase of +5.37 percentage points on standardized Luxembourgish proficiency exams and improvements in macro‑averaged F1 on nine of the fourteen downstream NLP tasks. These findings demonstrate that synthetic monolingual data can effectively enhance LLM performance in low‑resource languages and reveal the complex relationship between exam performance and practical NLP gains.

By Julian Valline, Cedric Lothritz, Siwen Guo, Jordi Cabot
arXiv Computation and Language
Oct 23

Protegrity-PII Technical Report

arXiv:2610. 30518v1 Announce Type: new Abstract: We present Protegrity-PII, a new PII decision model for structured and unstructured text.

By Hardeep Bassi, Hui Ma, Lu\'is Seabra, Koowum Joshi, Daniel Pereira, Averell Gatton