English
Related papers

Related papers: Towards Efficient Matching of Regexes with Backref…

200 papers

Motivated by the successful application of the theory of regular languages to formal verification of finite-state systems, there is a renewed interest in developing a theory of analyzable functions from strings to numerical values that can…

Formal Languages and Automata Theory · Computer Science 2012-02-23 Rajeev Alur , Loris D'Antoni , Jyotirmoy V. Deshmukh , Mukund Raghothaman , Yifei Yuan

Referring expression generation (REG) algorithms offer computational models of the production of referring expressions. In earlier work, a corpus of referring expressions (REs) in Mandarin was introduced. In the present paper, we annotate…

Computation and Language · Computer Science 2021-08-17 Guanyi Chen , Kees van Deemter

Retrieval-Augmented Generation (RAG) improves factual grounding in large language models but suffers from substantial latency due to synchronous retrieval. While recent work explores asynchronous retrieval, existing approaches rely on…

Computation and Language · Computer Science 2026-05-19 Wuyang Zhang , Shichao Pei

Feature attribution methods highlight the important input tokens as explanations to model predictions, which have been widely applied to deep neural networks towards trustworthy AI. However, recent works show that explanations provided by…

Computation and Language · Computer Science 2024-01-01 Dongfang Li , Baotian Hu , Qingcai Chen , Shan He

Given a regular expression $R$ and a string $Q$, the regular expression parsing problem is to determine if $Q$ matches $R$ and if so, determine how it matches, e.g., by a mapping of the characters of $Q$ to the characters in $R$. Regular…

Data Structures and Algorithms · Computer Science 2019-01-30 Philip Bille , Inge Li Gørtz

We introduce a model of register automata over infinite trees with extrema constraints. Such an automaton can store elements of a linearly ordered domain in its registers, and can compare those values to the suprema and infima of register…

Logic in Computer Science · Computer Science 2023-06-22 Szymon Toruńczyk , Thomas Zeume

Though the statistical analysis of ranking data has been a subject of interest over the past centuries, especially in economics, psychology or social choice theory, it has been revitalized in the past 15 years by recent applications such as…

Statistics Theory · Mathematics 2016-01-05 Eric Sibony , Stéphan Clémençon , Jérémie Jakubowicz

Dense retrieval systems increasingly need to handle complex queries. In many realistic settings, users express intent through long instructions or task-specific descriptions, while target documents remain relatively simple and static. This…

Information Retrieval · Computer Science 2026-04-07 Seiji Maekawa , Moin Aminnaseri , Pouya Pezeshkpour , Estevam Hruschka

We introduce AccurateRAG -- a novel framework for constructing high-performance question-answering applications based on retrieval-augmented generation (RAG). Our framework offers a pipeline for development efficiency with tools for raw…

Computation and Language · Computer Science 2026-03-04 Linh The Nguyen , Chi Tran , Dung Ngoc Nguyen , Van-Cuong Pham , Hoang Ngo , Dat Quoc Nguyen

The data mixture for large language model pre-training significantly impacts performance, yet how to determine an effective mixture remains unclear. We propose RegMix to automatically identify a high-performing data mixture by formulating…

Computation and Language · Computer Science 2025-01-24 Qian Liu , Xiaosen Zheng , Niklas Muennighoff , Guangtao Zeng , Longxu Dou , Tianyu Pang , Jing Jiang , Min Lin

Despite Retrieval-Augmented Generation (RAG) showing promising capability in leveraging external knowledge, a comprehensive evaluation of RAG systems is still challenging due to the modular nature of RAG, evaluation of long-form responses…

Reactive synthesis aims at automatic construction of systems from their behavioural specifications. The research mostly focuses on synthesis of systems dealing with Boolean signals. But real-life systems are often described using…

Formal Languages and Automata Theory · Computer Science 2018-09-14 Ayrat Khalimov , Benedikt Maderbacher , Roderick Bloem

Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by…

Formal Languages and Automata Theory · Computer Science 2014-05-06 Ryoma Sin'ya , Kiminori Matsuzaki , Masataka Sassa

A hallmark of human language is the ability to effectively and efficiently convey contextually relevant information. One theory for how humans reason about language is presented in the Rational Speech Acts (RSA) framework, which captures…

Computation and Language · Computer Science 2020-06-02 Julia White , Jesse Mu , Noah D. Goodman

Connecting conversation with external domain knowledge is vital for conversational recommender systems (CRS) to correctly understand user preferences. However, existing solutions either require domain-specific engineering, which limits…

Information Retrieval · Computer Science 2025-09-29 Dayu Yang , Hui Fang

With the advancement of speech synthesis technology, users have higher expectations for the naturalness and expressiveness of synthesized speech. But previous research ignores the importance of prompt selection. This study proposes a…

Sound · Computer Science 2025-04-15 Dan Luo , Chengyuan Ma , Weiqin Li , Jun Wang , Wei Chen , Zhiyong Wu

In automata theory, while determinisation provides a standard route to solving many common problems in automata theory, some weak forms of nondeterminism can be dealt with in some problems without costly determinisation. For example, the…

Formal Languages and Automata Theory · Computer Science 2026-05-29 Thomas A. Henzinger , Keya Prakash , K. S. Thejaswini

Retrieval-Augmented Generation (RAG) improves the accuracy and relevance of large language model outputs by incorporating knowledge retrieval. However, implementing RAG in enterprises poses challenges around data security, accuracy,…

Software Engineering · Computer Science 2024-06-10 Tilmann Bruckhaus

Test-time scaling methods improve the capabilities of large language models (LLMs) by increasing the amount of compute used during inference to make a prediction. Inference-time compute can be scaled in parallel by choosing among multiple…

As AI-based applications become pervasive, CPU vendors are starting to incorporate matrix engines within the datapath to boost efficiency. Systolic arrays have been the premier architectural choice as matrix engines in offload accelerators.…

Hardware Architecture · Computer Science 2021-10-06 Geonhwa Jeong , Eric Qin , Ananda Samajdar , Christopher J. Hughes , Sreenivas Subramoney , Hyesoon Kim , Tushar Krishna