tailieunhanh - Báo cáo khoa học: "A SYNTACTIC FILTER ON PRONOMINAL ANAPHORA FOR SLOT GRAMMAR"

We propose a syntactic falter for identifying non-coreferential pronoun-NP pairs within a sentence. The filter applies to the output of a Slot Grammar parser and is formulated m terms of the head-argument structures which the parser generates. It liandles control and unbounded dependency constructions without empty categories or binding chains, by virtue of the uniticational nature of the parser. The filter provides constraints for a discourse semantics system, reducing the search domain to which the inference rules of the system's anaphora resolution component apply. . | A SYNTACTIC FILTER ON PRONOMINAL ANAPHORA FOR SLOT GRAMMAR Shalom Lappin and Michael McCord IBM . Watson Research Center . Box 704 Yorktown Heights NY 10598 E-mail Lappin McCord@ ABSTRACT We propose a syntactic filter for identifying non-coreferential pronoun-NP pans within a sentence. The filter applies to the output of a Slot Grammar parser and is formulated in terms of the head-argument structures which the parser generates. It handles control and unbounded dependency constructions without empty categories or binding chains by virtue of the unificational nature of the parser. The filter provides constraints for a discourse semantics system reducing the search domain to which the inference rules of the system s anaphora resolution component apply. 1. INTRODUCTION In this paper we present an implemented algorithm which filters intra-sentential relations of referential dependence between pronouns and putative NP antecedents both full and pronominal NP s for the syntactic representations provided by an English Slot Granunar parser McCord 1989b . For each parse of a sentence the algorithm provides a list of pronoun-NP pairs where referential dependence of the first element on the second is excluded by syntactic constraints. The coverage of the filter has roughly the same extension ặs conditions B and c of Chomsky s 1981 1986 binding theory. However the formulation of the algorithm is significantly different from the conditions of the binding theory and from proposed implementations of its conditions. In particular the filter formulates constraints on pronominal anaphora in terms of the head-argument structures provided by Slot Grammar syntactic representations rather than the configurational tree relations particularly c-command on which the binding theory relies. As a result the statements of the algorithm apply straightforwardly and without special provision to a wide variety of constructions which recently proposed implementations of the binding