Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies, language comprehension, and Tree Adjoining Grammars
复制标题
DOI：
10.1016/j.cogsci.2003.10.006
复制
发表时间：
2004-09-01
影响因子：
2.5
通讯作者：
Bailey, KGD
中科院分区：
文献类型：
--
作者：
Ferreira, F;Lau, EF;Bailey, KGD
不流畅包括编辑术语，如嗯和嗯，以及重复和修改。人们对不流利是如何处理的知之甚少，而且几乎没有研究集中于不流利如何影响理解过程中的结构构建操作。我们回顾了计算语言学和心理语言学的主要发现，然后总结了我们自己的工作结果，这些工作的中心是解析器在遇到不流利时的行为。我们描述了一些新的研究，表明与发音错误的动词相关的信息挥之不去，这增加了关于动词论元结构对句子理解的关键影响的大量数据。文中还提出了一种不流利处理模型。该解析器使用树邻接语法来构建短语结构。在这种方法中，填充和未填充的停顿会影响替换操作的时间。修复和更正是由我们称为“覆盖”的机制来处理的，该机制允许解析器用适当的、正确的树覆盖不需要的树。这种不流畅处理模型突出了解析器有时需要协调执行花园路径重分析的机制和执行不流利修复的机制。作为一个整体，该研究计划表明，有可能系统地研究不流利，并了解解析器如何处理填充材料和错误。它还展示了树邻接语法的力量，这是阿拉文德·乔希发展的一种形式主义，在语言学和认知科学的许多不同领域取得了成果。(C)2004年认知科学学会，Inc.保留所有权利。
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research focused on the way that disfluencies affect structure-building operations during comprehension. We review major findings from both computational linguistics and psycholinguistics, and then we summarize the results of our own work which centers on how the parser behaves when it encounters a disfluency. We describe some new research showing that information associated with misarticulated verbs lingers, and which adds to the large body of data on the critical influence of verb argument structures on sentence comprehension. The paper also presents a model of disfluency processing. The parser uses a Tree Adjoining Grammar to build phrase structure. In this approach, filled and unfilled pauses affect the timing of Substitution operations. Repairs and corrections are handled by a mechanism we term "Overlay," which allows the parser to overwrite an undesired tree with the appropriate, correct tree. This model of disfluency processing highlights the need for the parser to sometimes coordinate the mechanisms that perform garden-path reanalysis with those that do disfluency repair. The research program as a whole demonstrates that it is possible to study disfluencies systematically and to learn how the parser handles filler material and mistakes. It also showcases the power of Tree Adjoining Grammars, a formalism developed by Aravind Joshi which has yielded results in many different areas of linguistics and cognitive science. (C) 2004 Cognitive Science Society, Inc. All rights reserved.