Logačev Pavel, Vasishth Shravan
Department of Linguistics, University of Potsdam.
Cogn Sci. 2016 Mar;40(2):266-98. doi: 10.1111/cogs.12228. Epub 2015 Mar 30.
Traxler, Pickering, and Clifton (1998) found that ambiguous sentences are read faster than their unambiguous counterparts. This so-called ambiguity advantage has presented a major challenge to classical theories of human sentence comprehension (parsing) because its most prominent explanation, in the form of the unrestricted race model (URM), assumes that parsing is non-deterministic. Recently, Swets, Desmet, Clifton, and Ferreira (2008) have challenged the URM. They argue that readers strategically underspecify the representation of ambiguous sentences to save time, unless disambiguation is required by task demands. When disambiguation is required, however, readers assign sentences full structure--and Swets et al. provide experimental evidence to this end. On the basis of their findings, they argue against the URM and in favor of a model of task-dependent sentence comprehension. We show through simulations that the Swets et al. data do not constitute evidence for task-dependent parsing because they can be explained by the URM. However, we provide decisive evidence from a German self-paced reading study consistent with Swets et al.'s general claim about task-dependent parsing. Specifically, we show that under certain conditions, ambiguous sentences can be read more slowly than their unambiguous counterparts, suggesting that the parser may create several parses, when required. Finally, we present the first quantitative model of task-driven disambiguation that subsumes the URM, and we show that it can explain both Swets et al.'s results and our findings.
特拉克斯勒、皮克林和克利夫顿(1998年)发现,歧义句的阅读速度比非歧义句更快。这种所谓的歧义优势对人类句子理解(句法分析)的经典理论提出了重大挑战,因为其最突出的解释,即无限制竞赛模型(URM),假定句法分析是不确定的。最近,斯韦茨、德梅特、克利夫顿和费雷拉(2008年)对无限制竞赛模型提出了质疑。他们认为,读者会策略性地对歧义句的表征进行不充分说明以节省时间,除非任务要求进行消除歧义。然而,当需要消除歧义时,读者会赋予句子完整的结构——斯韦茨等人为此提供了实验证据。基于他们的研究结果,他们反对无限制竞赛模型,并支持一种任务依赖型句子理解模型。我们通过模拟表明,斯韦茨等人的数据并不构成任务依赖型句法分析的证据,因为这些数据可以用无限制竞赛模型来解释。然而,我们从一项德语自定步速阅读研究中提供了决定性证据,该证据与斯韦茨等人关于任务依赖型句法分析的总体主张一致。具体而言,我们表明,在某些条件下,歧义句的阅读速度可能比非歧义句更慢,这表明句法分析器在需要时可能会创建几种句法分析结果。最后,我们提出了第一个包含无限制竞赛模型的任务驱动型消除歧义的定量模型,并表明它可以解释斯韦茨等人的研究结果以及我们的研究发现。