TAILIEUCHUNG - Báo cáo khoa học: "A COMPUTATIONAL MECHANISM FOR PRONOMINAL REFERENCE"

This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right, depth first manner. Forward and backwards coreference, and disjoint reference are assigned during this tree walk. A semantic interpretation procedure is used to deal with multiple antecedents. | A COMPUTATIONAL MECHANISM FOR PRONOMINAL REFERENCE Robert J. p. Ingria David Stallard BBN Systems and Technologies Incorporated 10 Moulton Street Mailstop 009 Cambridge MA 02238 ABSTRACT This paper describes an implemented mechanism for handling bound anaphora disjoint reference and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right depth first manner. Forward and backwards coreference and disjoint reference are assigned during this tree walk. A semantic interpretation procedure is used to deal with multiple antecedents. 1. INTRODUCTION This paper describes an implemented mechanism for assigning antecedents to bound anaphors and personal pronouns and for establishing disjoint reference between Noun Phrases. This mechanism is part of the BBN Spoken Language System Boisen et al. 1989 . The algorithm used is inspired by the indexing scheme of Chomsky 1980 augmented by tables analogous to the Table of Coreference of Jack-endoff 1972 . This mechanism handles only intra-sentential phenomena and only selects the syntactically and semantically possible antecedents. Ultimately it is meant to be used in conjunction with an extra-sentential reference mechanism like that described in Ayuso 1989 to Include antecedents from other utterances and to utilize discourse factors in its final selection of an antecedent. In Section 2 the empirical and theoretical background to this treatment is sketched out. In Section 3 the actual algorithm used is described in detail. In Section 4 the associated semantic interpretation mechanism is presented. In Section 5 we compare the algorithm with related work. Finally in Section 6 remaining theoretical and implementational issues are discussed. the syntactically impossible antecedents. This latter procedure is called disjoint reference since the Impossible antecedents can not even overlap in reference with the pronoun compare the cases In sentences 1 and 2 where the underlined items are non-identical in .

Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.