2022/11/21 by Michael Kuchnik, Virginia Smith, Kuchnik, Michael +3 · 12 citations
Computer Science · Psychology · #Artificial intelligence #Cognitive psychology #Computer science #Expression (computer science) #Memorization #Natural Language Processing Techniques #Natural language #Psychology #Text Readability and Simplification #Topic Modeling
paper · pdf · doi:10.48550/arxiv.2211.15458
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2022/11/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Although large language models (LLMs) have been touted for their ability to generate natural-sounding text, there are growing concerns around possible negative effects of LLMs such as data memorization, bias, and inappropriate language. Unfortunately, the complexity and generation capacities of LLMs make validating (and correcting) such concerns difficult. In this work, we introduce ReLM, a system for validating and querying LLMs using standard regular expressions. ReLM formalizes and enables a broad range of language model evaluations, reducing complex evaluation rules to simple regular expression queries. Our results exploring queries surrounding memorization, gender bias, toxicity, and language understanding show that ReLM achieves up to 15x higher system efficiency, 2.5x data efficiency, and increased statistical and prompt-tuning coverage compared to state-of-the-art ad-hoc queries. ReLM offers a competitive and general baseline for the increasingly important problem of LLM validation.