The Plausibility of Sampling as an Algorithmic Theory of Sentence Processing
Datos Bibliográficos
| ID | 22157809 |
|---|---|
| Autores | Jacob Louis Hoover (0000-0001-8651-5395, Mila - Quebec Artificial Intelligence Institute), Morgan Sonderegger (0000-0001-7675-2370, McGill University), Steven T Piantadosi (0000-0001-5499-4168, Berkeley College), Timothy J O’donnell (0000-0003-0291-8838, Canadian Institute for Advanced Research) |
| Año | 2023 |
| Volumen | 7 |
| Páginas | 1-42 |
| Fecha de publicación | 2023-06-01 |
| Peer Reviewed | Sí |
| Open Access | Sí |
| Tipo | ARTICLE |
| Revista | Open MIND (JOURNAL) |
| Identificadores de la revista | ISSN: 2470-2986 • E-ISSN: 2470-2986 |
| Editorial | MIT Press (PUBLISHER • US) |
| DOI | 10.1162/opmi_a_00086 |
| PMID | 37637302 |
| OpenAlex | W4381687028 |
| Idioma | EN |
| Citas recibidas | 8 |
| Referencias citadas | 40 |
Words that are more surprising given context take longer to process. However, no incremental parsing algorithm has been shown to directly predict this phenomenon. In this work, we focus on a class of algorithms whose runtime does naturally scale in surprisal—those that involve repeatedly sampling from the prior. Our first contribution is to show that simple examples of such algorithms predict runtime to increase superlinearly with surprisal, and also predict variance in runtime to increase. These two predictions stand in contrast with literature on surprisal theory [Hale, 2001; Levy, 2008a], which assumes that the expected processing cost increases linearly with surprisal, and makes no prediction about variance. In the second part of this paper, we conduct an empirical study of the relationship between surprisal and reading time, using a collection of modern language models to estimate surprisal. We find that with better language models, reading time increases superlinearly in surprisal, and also that variance increases. These results are consistent with the predictions of sampling-based algorithms
Grammar · Grammaticality · Linguistics · Natural language processing · Sentence · Computer Science · Natural Language Processing Techniques · Neurobiology of Language and Bilingualism · Syntax, Semantics, Linguistic Variation · Artificial Intelligence
Sentence processing by humans and machines
Bigger is not always better
Informativity enhances memory robustness against interference in sentence comprehension
Dissociable frequency effects attenuate as large language model surprisal predictors improve
Mouse Tracking for Reading (MoTR)
Large-scale benchmark yields no evidence that language model surprisal explains syntactic disambiguation difficulty
Word Frequency and Predictability Dissociate in Naturalistic Reading
On the Mathematical Relationship Between Contextual Probability and N400 Amplitude
Generalized Additive Models
Vision
The effect of word predictability on reading time is logarithmic
Thin Plate Regression Splines
Linguistic Structure and Speech Shadowing at Very Short Latencies
Is human cognition adaptive?
Transformers
GPT-3
Data from eye-tracking corpora as evidence for theories of syntactic processing complexity
Integration of Visual and Linguistic Information in Spoken Language Comprehension
Contextual effects on word perception and eye movements during reading
Processing Subject and Object Relative Clauses
Zipf’s word frequency law in natural language
“Cloze Procedure”
To transform or not to transform
Fast Stable Restricted Maximum Likelihood and Marginal Likelihood Estimation of Semiparametric Generalized Linear Models
The E-Z Reader model of eye-movement control in reading
A probabilistic earley parser as a psycholinguistic model
Linguistic complexity
The interaction of contextual constraints and parafoveal visual information in reading
An Activation‐Based Model of Sentence Processing as Skilled Memory Retrieval
Sentence Perception as an Interactive Parallel Process
Generalized Additive Models for Location, Scale and Shape
Smoothing Parameter and Model Selection for General Smooth Models
Stable and Efficient Multiple Smoothing Parameter Estimation for Generalized Additive Models
The sausage machine
Lossy‐Context Surprisal
Expectation-based syntactic comprehension
Long Short-Term Memory
A Deep Learning Approach to Analyzing Continuous-Time Cognitive Processes
Word predictability effects are linear, not logarithmic
Continuous-time deconvolutional regression for psycholinguistic modeling
Algorithms for Deterministic Incremental Dependency Parsing
Probabilistic Top-Down Parsing and Language Modeling
Syntactic processing
Eye movements as a window into real-time spoken language comprehension in natural contexts
Memory requirements and local ambiguities of parsing strategies
A Probabilistic Model of Lexical and Syntactic Access and Disambiguation
Evaluating generalised additive mixed modelling strategies for dynamic speech analysis
A Theory of Syntactic Recognition for Natural Language
| Obras citantes distintas | 8 |
|---|---|
| Citas por año | 4 |
| Intervalo de citas | 2024 - 2025 (2) |
| Velocidad de citación | recent |
| Altamente citado | No |
| Tipos de cita | Neutras: 2 |