Article Instance
API Endpoint for journals.
GET /api/articles/29049/?format=api
{ "pk": 29049, "title": "How much harder are hard garden-path sentences than easy ones?", "subtitle": null, "abstract": "The advent of broad-coverage computational models of human sentence processing has made it possible to derive quantita-tive predictions for empirical phenomena of longstanding interest in psycholinguistics; one such case is the disambiguationdifficulty in temporarily ambiguous sentences (garden-path sentences). Adequate evaluation of the accuracy of such quan-titative predictions requires going beyond the classic binary distinction between ”hard” and ”easy” garden path sentencesand obtaining precise quantitative measurements of processing difficulty. We report on a self-paced reading study designedto estimate the magnitude of the disambiguation difficulty in two temporarily ambiguous sentence types (NP/Z and NP/Sambiguities). Disambiguation was more than twice as hard in NP/Z sentences as in NP/S sentences. This contrasts withthe predictions of surprisal estimates derived from current broad-coverage language models, which lead us to expect asmaller difference between the two.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Poster Presentations with Abstracts", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1627b4h6", "frozenauthors": [ { "first_name": "Grusha", "middle_name": "", "last_name": "Prasad", "name_suffix": "", "institution": "Johns Hopkins University", "department": "" }, { "first_name": "Tal", "middle_name": "", "last_name": "Linzen", "name_suffix": "", "institution": "Johns Hopkins University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "2019-01-01T18:00:00Z", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/29049/galley/18920/download/" } ] }