Easy-first coreference resolution

24th International Conference on Computational Linguistics - Proceedings of COLING 2012: Technical Papers

Volumn , Issue , 2012, Pages 2519-2534

  Stoyanov, Veselin ^a   Eisner, Jason ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Coreference resolution; Discourse processing; Greedy approaches; Supervised clustering

Indexed keywords

CO-REFERENCE RESOLUTIONS; COREFERENCE; DISCOURSE PROCESSING; GREEDY APPROACHES; PAIRWISE CLASSIFIERS; SUPERVISED CLUSTERING; TRAINING DATA;

COMPUTATIONAL LINGUISTICS;

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

References (33)

1. Bagga, A. and Baldwin, B. (1998). Algorithms for scoring coreference chains. In Linguistic Coreference Workshop at LREC 1998.
2. Bengtson, E. and Roth, D. (2008). Understanding the value of features for coreference resolution. In Proceedings of EMNLP, pages 294-303.
3. Bergsma, S. and Lin, D. (2006). Bootstrapping path-based pronoun resolution. In Proc. of ACL.
4. Collins, M. and Roark, B. (2004). Incremental parsing with the perceptron algorithm. In Proceedings of ACL.
5. Culotta, A., Wick, M., Hall, R., and McCallum, A. (2007). First-order probabilistic models for coreference resolution. In Proceedings of HLT/NAACL, pages 81-88.
6. Daumé, H., Langford, J., and Marcu, D. (2009). Search-based structured prediction. Machine learning, 75(3):297-325.
7. Daumé III, H. and Marcu, D. (2005). Learning as search optimization: Approximate large margin methods for structured prediction. In Proceedings of ICML, pages 169-176.
8. Freund, Y. and Schapire, R. (1999). Large margin classification using the perceptron algorithm. Machine learning, 37(3):277-296.
9. Goldberg, Y. and Elhadad, M. (2010). An efficient algorithm for easy-first non-directional dependency parsing. In Proceedings of NAACL, pages 742-750. Association for Computational Linguistics.
10. Haghighi, A. and Klein, D. (2010). Coreference resolution in a modular, entity-centered model. In Proceedings of NAACL, pages 385-393.
11. Hasler, L., Ořasan, C., and Naumann, K. (2006). NPs for events: Experiments in coreference annotation. In Proceedings of LREC2006.
12. Huang, L., Fayong, S., and Guo, Y. (2012). Structured perceptron with inexact search. In Proceedings of NAACL.
13. Jain, V., Turaga, S., Briggman, K., Helmstaedter, M., Denk, W., and Seung, H. (2011). Learning to agglomerate superpixel hierarchies. In Proceedings of NIPS.
14. Kruskal, J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society, 7(1):48-50.
15. MUC-6 (1995). Coreference task definition. In Proceedings of the Sixth Message Understanding Conference (MUC-6), pages 335-344.
16. MUC-7 (1997). Coreference task definition. In Proceedings of the Seventh Message Understanding Conference (MUC-7).
17. Ng, V. and Cardie, C. (2002). Improving machine learning approaches to coreference resolution. In Proceedings of ACL, pages 104-111.
18. NIST (2004). The ACE Evaluation Plan. National Institute of Standards and Technology, United States of America.
19. Poon, H. and Domingos, P. (2008). Joint unsupervised coreference resolution with Markov logic. In Proceedings of EMNLP, pages 650-659.
20. Pradhan, S., Ramshaw, L., Marcus, M., Palmer, M., Weischedel, R., and Xue, N. (2011). Conll- 2011 shared task: Modeling unrestricted coreference in ontonotes. In Proceedings of CoNLL 2011, pages 1-27.
21. Raghunathan, K., Lee, H., Rangarajan, S., Chambers, N., Surdeanu, M., Jurafsky, D., and Manning, C. (2010). A multi-pass sieve for coreference resolution. In Proceedings of EMNLP, pages 492-501.
22. Ross, S., Gordon, G. J., and Bagnell, J. A. (2011). A reduction of imitation learning and structured prediction to no-regret online learning. In Proceedings of AISTATS.
23. Soon, W., Ng, H., and Lim, D. (2001). A machine learning approach to coreference resolution of noun phrases. Computational linguistics, 27(4):521-544.
24. Stoyanov, V., Cardie, C., Gilbert, N., Riloff, E., Buttler, D., and Hysom, D. (2010a). Coreference resolution with Reconcile. In Proceedings of the ACL Short Papers, pages 156-161.
25. Stoyanov, V., Cardie, C., Gilbert, N., Riloff, E., Buttler, D., and Hysom, D. (2010b). Reconcile: A coreference resolution research platform. Technical report, Cornell University.
26. Stoyanov, V. and Eisner, J. (2012). Minimum-risk training of approximate CRF-based NLP systems. In Proceedings of NAACL.
27. Stoyanov, V., Gilbert, N., Cardie, C., and Riloff, E. (2009). Conundrums in noun phrase coreference resolution: Making sense of the state-of-the-art. In Proceedings of ACL/IJCNLP, pages 656-664.
28. Stoyanov, V., Ropson, A., and Eisner, J. (2011). Empirical risk minimization of graphical model parameters given approximate inference, decoding, and model structure. In Proceedings of AISTATS.
29. Sutton, R., McAllester, D., Singh, S., and Mansour, Y. (2000). Policy gradient methods for reinforcement learning with function approximation. NIPS.
30. Vilain, M., Burger, J., Aberdeen, J., Connolly, D., and Hirschman, L. (1995). A model-theoretic coreference scoring theme. In Proceedings of the Sixth Message Understanding Conference (MUC-6).
31. Watkins, C. and Dayan, P. (1992). Q-learning. Machine Learning, 8(3):279-292.
32. Yang, X., Zhou, G., Su, J., and Tan, C. (2003). Coreference resolution using competition learning approach. In Proceedings of ACL, pages 176-183.
33. Zhou, G. and Su, J. (2004). A high-performance coreference resolution system using a constraint-based multi-agent strategy. In Proceedings of COLING.