Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
This paper presents a massively parallel parser that predicts critical attachment behaviors of the human sentence processor, without the use of explicit preference heuristics or revision strategies. The processing of a syntactic ambiguity is modeled as an active, distributed competition among the potential attachments for a phrase. Computationally motivated constraints on the competitive mechanism provide a principled and uniform account of a range of human attachment preferences and garden path phenolnena. . | A Competition-Based Explanation of Syntactic Attachment Preferences and Garden Path Phenomena Suzanne Stevenson Department of Computer Science University of Toronto Toronto Ontario M5S 1A4 Canada suzanne@cs.toronto.edu Abstract This paper presents a massively parallel parser that predicts critical attachment behaviors of the human sentence processor without the use of explicit preference heuristics or revision strategies. The processing of a syntactic ambiguity is modeled as an active distributed competition among the potential attachments for a phrase. Computationally motivated constraints on the competitive mechanism provide a principled and uniform account of a range of human attachment preferences and garden path phenomena. 1 A Competition-Based Parser A model of the human parser must explain among other factors the following two aspects of the processing of a syntactic ambiguity the initial attachment preferences that people exhibit and their ability or inability to later revise an incorrect attachment. This paper presents a competition-based parser CAPERS that predicts critical attachment behaviors of the human sentence processor without the use of explicit preference heuristics or revision strategies. CAPERS is a massively parallel network of processing nodes that represent syntactic phrases and their attachments within a parse tree. A syntactic ambiguity leads to a network of alternative attachments that compete in parallel for numeric activation an attachment wins over its competitors when it amasses activation above a certain threshold. The competition among attachments is achieved solely through a technique called competition-based spreading activation CBSA Reggia 87 . The effective use of CBSA requires restrictions on the syntactic attachments that are allowed to compete simultaneously. Ensuring these network restrictions necessitates the further constraint that a stable state of the network can only represent a single valid parse state. The resulting .