首页    期刊浏览 2024年10月05日 星期六
登录注册

文章基本信息

  • 标题:Does antecedent complexity affect ellipsis processing? An empirical investigation
  • 本地全文:下载
  • 作者:Dario Paape ; Bruno Nicenboim ; Shravan Vasishth
  • 期刊名称:Glossa
  • 电子版ISSN:2397-1835
  • 出版年度:2017
  • 卷号:2
  • 期号:1
  • 页码:77-105
  • DOI:10.5334/gjgl.290
  • 出版社:Ubiquity Press
  • 摘要:In two self-paced reading experiments, we investigated the effect of changes in antecedent complexity on processing times for ellipsis. Pointer- or “sharing”-based approaches to ellipsis processing (Frazier & Clifton 2001, 2005; Martin & McElree 2008) predict no effect of antecedent complexity on reading times at the ellipsis site while other accounts predict increased antecedent complexity to either slow down processing (Murphy 1985) or to speed it up (Hofmeister 2011). Experiment 1 manipulated antecedent complexity and elision, yielding evidence against a speedup at the ellipsis site and in favor of a null effect. In order to investigate possible superficial processing on part of participants, Experiment 2 manipulated the amount of attention required to correctly respond to end-of-sentence comprehension probes, yielding evidence against a complexity-induced slowdown at the ellipsis site. Overall, our results are compatible with pointer-based approaches while casting doubt on the notion that changes antecedent complexity lead to measurable differences in ellipsis processing speed.
  • 关键词:antecedent complexity; ellipsis processing; memory pointer; self-paced reading; Bayes factor
国家哲学社会科学文献中心版权所有