mlsanityData to 7 Oct 2026

Which Word Orders Facilitate Length Generalization in LMs? An Investigation with GCG-Based Artificial Languages

arXiv 2510.12722 ↗First posted 14 Oct 2025cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Whether language models (LMs) have inductive biases that favor typologically frequent grammatical properties over rare, implausible ones has been investigated, typically using artificial languages (ALs) (White and Cotterell, 2021; Kuribayashi et al., 2024). In this paper, we extend these works from two perspectives. First, we extend their context-free AL formalization by adopting Generalized Categorial Grammar (GCG) (Wood, 2014), which allows ALs to cover attested but previously overlooked constructions, such as unbounded dependency and mildly context-sensitive structures. Second, our evaluation focuses more on the generalization ability of LMs to process unseen longer test sentences. Thus, our ALs better capture features of natural languages and our experimental paradigm leads to clearer conclusions -- typologically plausible word orders tend to be easier for LMs to productively generalize.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 25 of its 48 references that are in the map. First posted on arXiv 14 Oct 2025.

Builds on

25 of 48 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  3. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
  4. 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
  5. 2023Faith and Fate: Limits of Transformers on Compositionalitycited by 496
  6. 2020Transformers as Soft Reasoners over Languagecited by 265
  7. 2022Neural Networks and the Chomsky Hierarchycited by 214
  8. 2018On the Practical Computational Power of Finite Precision RNNs for Language Recognitioncited by 117
  9. 2023Testing the General Deductive Reasoning Capacity of Large Language Models Using OOD Examplescited by 84
  10. 2024Why do language models perform worse for morphologically complex languages?cited by 62
  11. 2019Linguistic generalization and compositionality in modern artificial neural networkscited by 58
  12. 2018Are All Languages Equally Hard to Language-Model?cited by 53
13 more
  1. 2019What Kind of Language Is Hard to Language-Model?cited by 50
  2. 2019LSTM Networks Can Perform Dynamic Countingcited by 45
  3. 2021Examining the Inductive Bias of Neural Language Models with Artificial Languagescited by 40
  4. 2019Studying the Inductive Biases of RNNs with Synthetic Variations of Natural Languagescited by 37
  5. 2025Can Language Models Learn Typologically Implausible Languages?cited by 23
  6. 2024What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languagescited by 20
  7. 2025Anything Goes? A Crosslinguistic Study of (Im)possible Language Learning in LMscited by 20
  8. 2018Can LSTM Learn to Capture Agreement? The Case of Basquecited by 17
  9. 2024Kallini et al. (2024) do not compare impossible languages with constituency-based onescited by 15
  10. 2023Do Deep Neural Networks Capture Compositionality in Arithmetic Reasoning?cited by 11
  11. 2024Emergent Word Order Universals from Cognitively-Motivated Language Modelscited by 11
  12. 2022Exploring the Long-Term Generalization of Counting Behavior in RNNscited by 7
  13. 2023Theoretical Conditions and Empirical Failure of Bracket Counting on Long Sequences with Linear Recurrent Networkscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.