Applying Backpropagation Networks to Anaphor Resolution

Despite some promising early approaches, neural networks have by now received comparatively little attention as a machine learning model for robust, corpus-based anaphor resolution. The work presented in this paper is intended to fill the apparent gap in research. Based on a hybrid algorithm that combines manually knowledge-engineered antecedent filtering rules with machine-learned preference criteria, it is investigated what can be achieved by employing backpropagation networks for the corpus-based acquisition of preference strategies for pronoun resolution. Thorough evaluation will be carried out, thus systematically addressing the numerous experimental degrees of freedom, among which are sources of evidence (features, feature vector signatures), training data generation settings, number of hidden layer nodes, and number of training epochs. According to the evaluation results, the neural network approach performs at least similar to a decision-tree-based ancestor system that employs the same general hybrid strategy.

[1]  António Branco,et al.  Anaphora processing : linguistic, cognitive and computational modelling , 2005 .

[2]  Roland Stuckardt,et al.  Design and Enhanced Evaluation of a Robust Anaphor Resolution Algorithm , 2001, Computational Linguistics.

[3]  Timo Järvinen,et al.  Dependency parser demo , 1997, ANLP.

[4]  Fredrik Olsson A survey of machine learning for reference resolution in textual discourse , 2004 .

[5]  Ruslan Mitkov Factors in anaphora resolution: they are not the only things that matter. A case study based on two different approaches , 1997 .

[6]  Noam Chomsky,et al.  Lectures on Government and Binding , 1981 .

[7]  Claire Gardent,et al.  Improving Machine Learning Approaches to Coreference Resolution , 2002, ACL.

[8]  André Grüning,et al.  Modeling Referential Choice in Discourse: A Cognitive Calculative Approach and a Neural Network Approach , 2005 .

[9]  Branimir Boguraev,et al.  Anaphora for Everyone: Pronominal Anaphora Resolution without a Parser , 1996, COLING.

[10]  Ruslan Mitkov,et al.  Robust Pronoun Resolution with Limited Knowledge , 1998, ACL.

[11]  Scott Bennett,et al.  Evaluating Automated and Manual Acquisition of Anaphora Resolution Strategies , 1995, ACL.

[12]  Roland Stuckardt Three Algorithms for Competence-Oriented Anaphor Resolution , .

[13]  Roland Stuckardt,et al.  Resolving anaphoric references on deficient syntactic descriptions , 1997 .

[14]  Claire Cardie,et al.  Weakly Supervised Natural Language Learning Without Redundant Views , 2003, NAACL.

[15]  Thomas G. Dietterich What is machine learning? , 2020, Archives of Disease in Childhood.

[16]  Roland Stuckardt,et al.  A Machine Learning Approach to Preference Strategies for Anaphor Resolution , 2005 .

[17]  Hwee Tou Ng,et al.  A Machine Learning Approach to Coreference Resolution of Noun Phrases , 2001, CL.

[18]  John Hale,et al.  A Statistical Approach to Anaphora Resolution , 1998, VLC@COLING/ACL.

[19]  Breck Baldwin,et al.  CogNIAC: high precision coreference with limited knowledge and linguistic resources , 1997 .

[20]  Shalom Lappin,et al.  An Algorithm for Pronominal Anaphora Resolution , 1994, CL.

[21]  Roland Stuckardt,et al.  Coreference-Based Summarization and Question Answering: a Case for High Precision Anaphor Resolution , 2003 .

[22]  André Grüning,et al.  Modelling Referential Choice in Discourse : A Cognitive Calculative Approach and a Neural Network Approach , 2004 .

[23]  Yoram Singer,et al.  A simple, fast, and effective rule learner , 1999, AAAI 1999.

[24]  Roland Stuckardt,et al.  Anaphor Resolution and the Scope of Syntactic Constraints , 1996, COLING.