activity
20142026
most citedIs Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization

54 citations · 126 across the 51 of their papers we have counts for

collaborators
Showing 2025 · cs.CLShow all

7 papers · 2 filters

cs.CL2025

How Small Can You Go? Compact Language Models for On-Device Critical Error Detection in Machine Translation

Muskaan Chopra, Lorenz Sparrenberg, Sarthak Khanna +1

Large Language Models (LLMs) excel at evaluating machine translation (MT), but their scale and cost hinder deployment on edge devices and in privacy-sensitive workflows. We ask: ho…

cs.CL2025

SynCED-EnDe 2025: A Synthetic and Curated English - German Dataset for Critical Error Detection in Machine Translation

Muskaan Chopra, Lorenz Sparrenberg, Rafet Sifa

Critical Error Detection (CED) in machine translation aims to determine whether a translation is safe to use or contains unacceptable deviations in meaning. While the WMT21 English…

cs.CL2025

Multi-Modal Vision vs. Text-Based Parsing: Benchmarking LLM Strategies for Invoice Processing

David Berghaus, Armin Berger, Lars Hillebrand +2

This paper benchmarks eight multi-modal large language models from three families (GPT-5, Gemini 2.5, and open-source Gemma 3) on three diverse openly available invoice document da…

cs.CL2025★ 4 cited

A Survey on Current Trends and Recent Advances in Text Anonymization

Tobias Deußer, Lorenz Sparrenberg, Armin Berger +3

The proliferation of textual data containing sensitive personal information across various domains requires robust anonymization techniques to protect privacy and comply with regul…

cs.CL2025★ 3 cited

Advancing Risk and Quality Assurance: A RAG Chatbot for Improved Regulatory Compliance

Lars Hillebrand, Armin Berger, Daniel Uedelhoven +7

Risk and Quality (R&Q) assurance in highly regulated industries requires constant navigation of complex regulatory frameworks, with employees handling numerous daily queries demand…

cs.CL2025★ 1 cited

Interpretable Topic Extraction and Word Embedding Learning using row-stochastic DEDICOM

Lars Hillebrand, David Biesner, Christian Bauckhage +1

The DEDICOM algorithm provides a uniquely interpretable matrix factorization method for symmetric and asymmetric square matrices. We employ a new row-stochastic variation of DEDICO…