Robin Young
Author directory2026
NP-Hard Lower Bound Complexity for Semantic Self-Verification
Robin Young
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Robin Young
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
We model Semantic Self-Verification (SSV) as the problem of determining whether a statement accurately characterizes its own semantic properties within a given interpretive framework that formalizes a challenge in AI safety and fairness: can an AI system verify that it has correctly interpreted rules intended to govern its behavior? We prove that SSV, in this specification, is NP-complete by constructing a polynomial-time reduction from 3-Satisfiability (3-SAT). Our reduction maps a 3-SAT formula to an instance of SSV involving ambiguous terms with binary interpretations and semantic constraints derived from logical clauses. This establishes that even simplified forms of semantic self-verification should face computational barriers. The NP-complete lower bound has implications for AI safety and fairness approaches that rely on semantic interpretation of instructions, including but not limited to constitutional AI, alignment via natural language, and instruction-following systems. Any approach where an AI system verify its understanding of directives faces this computational barrier. We argue that more realistic verification scenarios likely face even greater complexity.
Is Brevity the Soul of Wit? An Empirical Test Using 570,000 Reddit Jokes
Robin Young
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 2: Short Papers)
Robin Young
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 2: Short Papers)
The assertion that “brevity is the soul of wit” has become proverbial in discussions of effective communication. We test this hypothesis using 570,634 jokes from Reddit’s r/Jokes community and a cross-platform comparison of 22.1 million posts across 10 subreddits. Longer posts receive more upvotes across all of Reddit, not just jokes, indicating the baseline length-score correlation reflects platform dynamics rather than humor-specific effects. However, we find a pattern unique to humor: the length-score correlation disappears entirely for top-performing jokes, while every non-humor subreddit retains a positive correlation for its best content. For genuine wit, length is irrelevant, which is a property that distinguishes humor from other content types tested. Temporal analysis reveals winner-take-all consolidation. As Reddit matured, long jokes’ median scores dropped 71% while mean scores increased 6.8×, indicating most long jokes now fail while rare successes dominate.
OpenQTS: A Metadata-Rich Open Dataset for Tang Dynasty Poetry
Robin Young
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Robin Young
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Tang Dynasty poetry (618–907 CE) represents one of the most significant corpora in Chinese literature, yet no openly accessible, computationally-suitable resource exists with comprehensive author metadata. We present OpenQTS, a complete machine-readable edition of the Quan Tang Shi (全唐詩), containing 48,300 poems from 2,602 authors across 900 volumes. Unlike existing resources, OpenQTS provides systematic biographical metadata through algorithmic inference and authority file integration. Each poem receives a unique identifier, with proper handling of multi-part poems (15.5% of corpus) and collaborative works. All metadata includes provenance tracking, documenting whether information derives from Wikidata, biographical text inference, or historical markers.
2025
Information-theoretic Distinctions Between Deception and Confusion
Robin Young
Proceedings of the 14th International Joint Conference on Natural Language Processing and the 4th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics
Robin Young
Proceedings of the 14th International Joint Conference on Natural Language Processing and the 4th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics
We propose an information-theoretic formalization of the distinction between two fundamental AI safety failure modes: deceptive alignment and goal drift. While both can lead to systems that appear misaligned, we demonstrate that they represent distinct forms of information divergence occurring at different interfaces in the human-AI system. Deceptive alignment creates entropy between an agent’s true goals and its observable behavior, while goal drift, or confusion, creates entropy between the intended human goal and the agent’s actual goal. Though often observationally equivalent, these failures necessitate different interventions. We present a formal model and an illustrative thought experiment to clarify this distinction. We offer a formal language for re-examining prominent alignment challenges observed in Large Language Models (LLMs), offering novel perspectives on their underlying causes.