paper-with-me

홈 › Papers

ROSE: A Neurocomputational Architecture for Syntax

2023-03-15 · Elliot Murphy

A comprehensive model of natural language processing in the brain must accommodate four components: representations, operations, structures and encoding. It further requires a principled account of how these components mechanistically, and causally, relate to each another. While previous models have isolated regions of interest for structure-building and lexical access, many gaps remain with respect to bridging distinct scales of neural complexity. By expanding existing accounts of how neural oscillations can index various linguistic processes, this article proposes a neurocomputational architecture for syntax, termed the ROSE model (Representation, Operation, Structure, Encoding). Under ROSE, the basic data structures of syntax are atomic features, types of mental representations (R), and are coded at the single-unit and ensemble level. Elementary computations (O) that transform these units into manipulable objects accessible to subsequent structure-building levels are coded via high frequency gamma activity. Low frequency synchronization and cross-frequency coupling code for recursive categorial inferences (S). Distinct forms of low frequency coupling and phase-amplitude coupling (delta-theta coupling via pSTS-IFG; theta-gamma coupling via IFG to conceptual hubs) then encode these structures onto distinct workspaces (E). Causally connecting R to O is spike-phase/LFP coupling; connecting O to S is phase-amplitude coupling; connecting S to E is a system of frontotemporal traveling oscillations; connecting E to lower levels is low-frequency phase resetting of spike-LFP coupling. ROSE is reliant on neurophysiologically plausible mechanisms, is supported at all four levels by a range of recent empirical research, and provides an anatomically precise and falsifiable grounding for the basic property of natural language syntax: hierarchical, recursive structure-building.

📄 PDF Abstract BibTeX arXiv:2303.08877

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Shadow of the (Hierarchical) Tree: Reconciling Symbolic and Predictive Components of the Neural Code for Syntax

2024-12-02 · Elliot Murphy

Natural language syntax can serve as a major test for how to integrate two infamously distinct frameworks: symbolic representations and connectionist neural networks. Building on a recent neurocomputational architecture …

Neurocomputational Mechanisms of Syntactic Transfer in Bilingual Sentence Production

2026-01-26 · Ahmet Yavuz Uluslu, Elliot Murphy arxiv

We discuss the benefits of incorporating into the study of bilingual production errors and their traditionally documented timing signatures (e.g., event-related potentials) certain types of oscillatory signatures, which …

Beyond Local Code Optimization: Multi-Agent Reasoning for Software System Optimization

2026-03-16 · Huiyun Peng, Parth Vinod Patil, Antonio Zhong Qiu, George K. Thiruvathukal 외 arxiv

Large language models and AI agents have recently shown promise in automating software performance optimization, but existing approaches predominantly rely on local, syntax-driven code transformations. This limits their …

Assessing the Ability of LSTMs to Learn Syntax-Sensitive Dependencies

2016-11-04 · TACL 2016 1 · Tal Linzen, Emmanuel Dupoux, Yoav Goldberg

The success of long short-term memory (LSTM) neural networks in language processing is typically attributed to their ability to capture long-distance statistical regularities. Linguistic regularities are often sensitive …

Language ModelingLanguage Modelling

Analyse syntaxique de l'ancien fran\ccais : quelles propri\'et\'es de la langue influent le plus sur la qualit\'e de l'apprentissage ?

2015-06-01 · JEPTALNRECITAL 2015 6 · Ga{\"e}l Guibon, Isabelle Tellier, Sophie Pr{\'e}vost, Matthieu Constant 외

L{'}article pr{\'e}sente des r{\'e}sultats d{'}exp{\'e}riences d{'}apprentissage automatique pour l{'}{\'e}tiquetage morpho-syntaxique et l{'}analyse syntaxique en d{\'e}pendance de l{'}ancien fran{\c{c}}ais. Ces exp{\'e…