The Plausibility of Sampling as an Algorithmic Theory of Sentence Processing

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 fr...

Descripción completa

Detalles Bibliográficos
Autores principales: Hoover, Jacob Louis, Sonderegger, Morgan, Piantadosi, Steven T., O’Donnell, Timothy J.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MIT Press 2023
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10449406/
https://www.ncbi.nlm.nih.gov/pubmed/37637302
http://dx.doi.org/10.1162/opmi_a_00086

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10449406/
https://www.ncbi.nlm.nih.gov/pubmed/37637302
http://dx.doi.org/10.1162/opmi_a_00086

Ejemplares similares