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

Paper recorded by Signals 4 on 2026-10-02 in cs.CL. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-02 on arXiv · recorded by Signals 4 on 2026-10-05

Category: cs.CL · 自然语言处理 · first seen 2026-10-05

Abstract

We describe the Writerslogic team's participation in the CLEF 2026 SimpleText shared task, addressing Task 1 (text simplification) and Task 2 (complexity spotting). For Task 1, we develop a multi-candidate generation pipeline using GPT-4o-mini that produces five simplification candidates per sentence at varying temperatures, then selects the best candidate using a reference-free scoring heuristic

Read on arXiv →