Syntactic Learnability of Echo State Neural Language Models at Scale

Ryo Ueda, Tatsuki Kuribayashi, Shunsuke Kando, Kentaro Inui
3/3/2025
cs.CL

No confident code implementation found for this paper.

Abstract

What is a neural model with minimum architectural complexity that exhibits reasonable language learning capability? To explore such a simple but sufficient neural language model, we revisit a basic reservoir computing (RC) model, Echo State Network (ESN), a restricted class of simple Recurrent Neural Networks. Our experiments showed that ESN with a large hidden state is comparable or superior to Transformer in grammaticality judgment tasks when trained with about 100M words, suggesting that architectures as complex as that of Transformer may not always be necessary for syntactic learning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{ueda2025syntactic,
  title  = {Syntactic Learnability of Echo State Neural Language Models at Scale},
  author = {Ryo Ueda and Tatsuki Kuribayashi and Shunsuke Kando and Kentaro Inui},
  year   = {2025},
  eprint = {2503.01724},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.01724v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.01724.svg)](https://codeofpaper.com/paper/2503.01724)

Discussion