Anything Goes? A Crosslinguistic Study of (Im)possible Language Learning in LMs

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yang, Xiulin, Aoyama, Tatsuya, Yao, Yuekun, Wilcox, Ethan
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911170272690176
author Yang, Xiulin
Aoyama, Tatsuya
Yao, Yuekun
Wilcox, Ethan
author_facet Yang, Xiulin
Aoyama, Tatsuya
Yao, Yuekun
Wilcox, Ethan
contents Do language models (LMs) offer insights into human language learning? A common argument against this idea is that because their architecture and training paradigm are so vastly different from humans, LMs can learn arbitrary inputs as easily as natural languages. We test this claim by training LMs to model impossible and typologically unattested languages. Unlike previous work, which has focused exclusively on English, we conduct experiments on 12 languages from 4 language families with two newly constructed parallel corpora. Our results show that while GPT-2 small can largely distinguish attested languages from their impossible counterparts, it does not achieve perfect separation between all the attested languages and all the impossible ones. We further test whether GPT-2 small distinguishes typologically attested from unattested languages with different NP orders by manipulating word order based on Greenberg's Universal 20. We find that the model's perplexity scores do not distinguish attested vs. unattested word orders, while its performance on the generalization test does. These findings suggest that LMs exhibit some human-like inductive biases, though these biases are weaker than those found in human learners.
format Preprint
id arxiv_https___arxiv_org_abs_2502_18795
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Anything Goes? A Crosslinguistic Study of (Im)possible Language Learning in LMs
Yang, Xiulin
Aoyama, Tatsuya
Yao, Yuekun
Wilcox, Ethan
Computation and Language
Do language models (LMs) offer insights into human language learning? A common argument against this idea is that because their architecture and training paradigm are so vastly different from humans, LMs can learn arbitrary inputs as easily as natural languages. We test this claim by training LMs to model impossible and typologically unattested languages. Unlike previous work, which has focused exclusively on English, we conduct experiments on 12 languages from 4 language families with two newly constructed parallel corpora. Our results show that while GPT-2 small can largely distinguish attested languages from their impossible counterparts, it does not achieve perfect separation between all the attested languages and all the impossible ones. We further test whether GPT-2 small distinguishes typologically attested from unattested languages with different NP orders by manipulating word order based on Greenberg's Universal 20. We find that the model's perplexity scores do not distinguish attested vs. unattested word orders, while its performance on the generalization test does. These findings suggest that LMs exhibit some human-like inductive biases, though these biases are weaker than those found in human learners.
title Anything Goes? A Crosslinguistic Study of (Im)possible Language Learning in LMs
topic Computation and Language
url https://arxiv.org/abs/2502.18795