Recursive prosody is not finite-state

2021-08-01 · ACL (SIGMORPHON) 2021 8 · Hossep Dolatian, Aniello De Santo, Thomas Graf

This paper investigates bounds on the generative capacity of prosodic processes, by focusing on the complexity of recursive prosody in coordination contexts in English (Wagner, 2010). Although all phonological processes and most prosodic processes are computationally regular string languages, we show that recursive prosody is not. The output string language is instead parallel multiple context-free (Seki et al., 1991). We evaluate the complexity of the pattern over strings, and then move on to a characterization over trees that requires the expressivity of multi bottom-up tree transducers. In doing so, we provide a foundation for future mathematically grounded investigations of the syntax-prosody interface.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

SCC-recursiveness in infinite argumentation (extended version)

2025-07-09 · Uri Andrews, Luca San Mauro arxiv

Argumentation frameworks (AFs) are a foundational tool in artificial intelligence for modeling structured reasoning and conflict. SCC-recursiveness is a well-known design principle in which the evaluation of arguments is…

Recursive Reinforcement Learning

2022-06-23 · Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi 외

Recursion is the fundamental paradigm to finitely describe potentially infinite objects. As state-of-the-art reinforcement learning (RL) algorithms cannot directly reason about recursion, they must rely on the practition…

Ingenuity Q-Learning reinforcement-learning Reinforcement Learning+1

Recursive Utility with Investment Gains and Losses: Existence, Uniqueness, and Convergence

2021-07-12 · Jing Guo, Xue Dong He

We consider a generalization of the recursive utility model by adding a new component that represents utility of investment gains and losses. We also study the utility process in this generalized model with constant elas…

On Recursive Edit Distance Kernels with Application to Time Series Classification

2010-05-27 · Pierre-François Marteau, Sylvie Gibet

This paper proposes some extensions to the work on kernels dedicated to string or time series global alignment based on the aggregation of scores obtained by local alignments. The extensions we propose allow to construct…

General Classification Time Series Time Series Analysis Time Series Classification

Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples

2026-05-08 · Yicen Li, Ruiyang Hong, Anastasis Kratsios, Haitz Sáez de Ocáriz Borde 외 arxiv

Classical clustering methods usually return either a finite partition of the observed data or a finite dendrogram over it. This finite-sample view is inadequate when the hierarchy of interest is a recursive geometric obj…