CLAILGOct 27, 2022

Can language models handle recursively nested grammatical structures? A case study on comparing models and humans

DeepMindStanford
arXiv:2210.15303v350 citationsh-index: 29
Originality Incremental advance
AI Analysis

This addresses the challenge of fair evaluation in AI-human comparisons, highlighting discrepancies that can confound such assessments.

The paper tackles the problem of comparing language models (LMs) and humans in processing recursively nested grammatical structures, finding that with a simple prompt, large LMs consistently outperform human results and extrapolate to deeper nesting conditions.

How should we compare the capabilities of language models (LMs) and humans? I draw inspiration from comparative psychology to highlight some challenges. In particular, I consider a case study: processing of recursively nested grammatical structures. Prior work suggests that LMs cannot handle these structures as reliably as humans can. However, the humans were provided with instructions and training, while the LMs were evaluated zero-shot. I therefore match the evaluation more closely. Providing large LMs with a simple prompt -- substantially less content than the human training -- allows the LMs to consistently outperform the human results, and even to extrapolate to more deeply nested conditions than were tested with humans. Further, reanalyzing the prior human data suggests that the humans may not perform above chance at the difficult structures initially. Thus, large LMs may indeed process recursively nested grammatical structures as reliably as humans. This case study highlights how discrepancies in the evaluation can confound comparisons of language models and humans. I therefore reflect on the broader challenge of comparing human and model capabilities, and highlight an important difference between evaluating cognitive models and foundation models.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes