An Incremental Model for Coreference Resolution with Restrictive Antecedent Accessibility

CoNLL 2011 - 15th Conference on Computational Natural Language Learning: Shared Task, Proceedings

Volumn , Issue , 2022, Pages 81-85

  Klenner, Manfred ^a   Tuggener, Don ^a  

^a UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS;

% REDUCTIONS; BASELINE MODELS; COREFERENCE RESOLUTION; GLOBAL CONSTRAINTS; INCREMENTAL MODELS; MACHINE LEARNING APPROACHES; NATURAL INTEGRATION; PAIRWISE CLASSIFICATION; SYSTEM USE;

MACHINE LEARNING;

EID: 85123314550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Jie Cai and Michael Strube. 2010. Evaluation metrics for end-to-end coreference resolution systems. In Proceedings of the SIGdial 2010 Conference: The 11th Annual Meeting of the Special Interest Group on Discourse and Dialogue.
2. Aron Culotta, Michael Wick, and Andrew McCallum. 2007. First-order probabilistic models for coreference resolution. In Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference, pages 81-88, Rochester, New York, April. Association for Computational Linguistics.
3. Hal Daume III and Daniel Marcu. 2005. A large-scale exploration of effective global features for a joint entity detection and tracking model. In HLT'05: Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, pages 97-104, Morristown, NJ, USA. Association for Computational Linguistics.
4. Jerry R. Hobbs. 1976. Pronoun resolution. Technical Report 76-1, Research Report, Department of Computer Sciences, City College, City University of New York.
5. Manfred Klenner and Etienne Ailloud. 2009. Optimization in Coreference Resolution Is Not Needed: A Nearly-Optimal Zero-One ILP Algorithm with Intensional Constraints. In Proc. of the EACL.
6. Manfred Klenner. 2007. Enforcing consistency on coreference sets. In In Recent Advances in Natural Language Processing (RANLP), pages 323-328.
7. Shalom Lappin and Herbert J Leass. 1994. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20:535-561.
8. Xiaoqiang Luo, Abe Ittycheriah, Hongyan Jing, Nanda Kambhatla, and Salim Roukos. 2004. A mention-synchronous coreference resolution algorithm based on the bell tree. In Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics.
9. Xiaoqiang Luo. 2005. On coreference resolution performance metrics. In HLT'05: Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, pages 25-32, Morristown, NJ, USA. Association for Computational Linguistics.
10. Ruslan Mitkov, Richard Evans, and Constantin Orasan. 2002. A new, fully automatic version of mitkov's knowledge-poor pronoun resolution method. In CI-CLing'02: Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing, pages 168-186, London, UK. Springer-Verlag.
11. Vincent Ng. 2010. Supervised noun phrase coreference research: The first fifteen years. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics.
12. Karthik Raghunathan, Heeyoung Lee, Sudarshan Rangarajan, Nathanael Chambers, Mihai Surdeanu, Dan Jurafsky, and Christopher Manning. 2010. A multipass sieve for coreference resolution. In Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, EMNLP'10, pages 492-501, Stroudsburg, PA, USA. Association for Computational Linguistics.
13. Altaf Rahman and Vincent Ng. 2009. Supervised models for coreference resolution. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2, EMNLP '09, pages 968-977, Stroudsburg, PA, USA. Association for Computational Linguistics.
14. Gerold Schneider. 2008. Hybrid Long-Distance Functional Dependency Parsing. Doctoral Thesis, Institute of Computational Linguistics, Univ. of Zurich.
15. Advaith Siddharthan. 2003. Resolving pronouns robustly: Plumbing the depths of shallowness. In Proceedings of the Workshop on Computational Treatments of Anaphora, 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2003).
16. Wee M. Soon, Hwee T. Ng, and Daniel. 2001. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544, December.
17. Xiaofeng Yang, Jian Su, Guodong Zhou, and Chew Lim Tan. 2004. An np-cluster based approach to coreference resolution. In Proceedings of the 20th international conference on Computational Linguistics.