Single‐Stage Prediction Models Do Not Explain the Magnitude of Syntactic Disambiguation Difficulty

Cognitive Science 45 (6):e12988 (2021)
  Copy   BIBTEX

Abstract

The disambiguation of a syntactically ambiguous sentence in favor of a less preferred parse can lead to slower reading at the disambiguation point. This phenomenon, referred to as a garden‐path effect, has motivated models in which readers initially maintain only a subset of the possible parses of the sentence, and subsequently require time‐consuming reanalysis to reconstruct a discarded parse. A more recent proposal argues that the garden‐path effect can be reduced to surprisal arising in a fully parallel parser: words consistent with the initially dispreferred but ultimately correct parse are simply less predictable than those consistent with the incorrect parse. Since predictability has pervasive effects in reading far beyond garden‐path sentences, this account, which dispenses with reanalysis mechanisms, is more parsimonious. Crucially, it predicts a linear effect of surprisal: the garden‐path effect is expected to be proportional to the difference in word surprisal between the ultimately correct and ultimately incorrect interpretations. To test this prediction, we used recurrent neural network language models to estimate word‐by‐word surprisal for three temporarily ambiguous constructions. We then estimated the slowdown attributed to each bit of surprisal from human self‐paced reading times, and used that quantity to predict syntactic disambiguation difficulty. Surprisal successfully predicted the existence of garden‐path effects, but drastically underpredicted their magnitude, and failed to predict their relative severity across constructions. We conclude that a full explanation of syntactic disambiguation difficulty may require recovery mechanisms beyond predictability.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Symbolic connectionism in natural language disambiguation.James Franklin & S. W. K. Chan - 1998 - IEEE Transactions on Neural Networks 9:739-755.
Some Neural Networks Compute, Others Don't.Gualtiero Piccinini - 2008 - Neural Networks 21 (2-3):311-321.
Diabetes Prediction Using Artificial Neural Network.Nesreen Samer El_Jerjawi & Samy S. Abu-Naser - 2018 - International Journal of Advanced Science and Technology 121:54-64.
Out of their minds: Legal theory in neural networks. [REVIEW]Dan Hunter - 1999 - Artificial Intelligence and Law 7 (2-3):129-151.

Analytics

Added to PP
2021-06-26

Downloads
9 (#1,079,720)

6 months
6 (#202,901)

Historical graph of downloads
How can I increase my downloads?