tailieunhanh - Báo cáo khoa học: "Bootstrapping Path-Based Pronoun Resolution"

We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a candidate noun based on the path in the parse tree between the two entities. This path information enables us to handle previously challenging resolution instances, and also robustly addresses traditional syntactic coreference constraints. Highly coreferent paths also allow mining of precise probabilistic gender/number information. . | Bootstrapping Path-Based Pronoun Resolution Shane Bergsma Department of Computing Science University of Alberta Edmonton Alberta Canada T6G 2E8 bergsma@ Dekang Lin Google Inc. 1600 Amphitheatre Parkway Mountain View California 94301 lindek@ Abstract We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure we learn the likelihood of coreference between a pronoun and a candidate noun based on the path in the parse tree between the two entities. This path information enables us to handle previously challenging resolution instances and also robustly addresses traditional syntactic coreference constraints. Highly coreferent paths also allow mining of precise probabilistic gender number information. We combine statistical knowledge with well known features in a Support Vector Machine pronoun resolution classifier. Significant gains in performance are observed on several datasets. 1 Introduction Pronoun resolution is a difficult but vital part of the overall coreference resolution task. In each of the following sentences a pronoun resolution system must determine what the pronoun his refers to 1 John needs his friend. 2 John needs his support. In 1 John and his corefer. In 2 his refers to some other perhaps previously evoked entity. Traditional pronoun resolution systems are not designed to distinguish between these cases. They lack the specific world knowledge required in the second instance - the knowledge that a person does not usually explicitly need his own support. We collect statistical path-coreference information from a large automatically-parsed corpus to address this limitation. A dependency path is defined as the sequence of dependency links between two potentially coreferent entities in a parse tree. A path does not include the terminal entities for example John needs his support and He needs their support have the same syntactic path. Our algorithm determines that the dependency .