A twin-candidate based approach for event pronoun resolution using composite kernel

Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 2, Issue , 2010, Pages 188-196

  Bin, Chen ^a   Jian, Su ^b   Lim, Tan Chew ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ANAPHORA RESOLUTION; CASCADED EVENTS; COMPOSITE KERNELS; DEFAULT SETTING; GENERAL PURPOSE; HYPER-PLANE; LEARNING MODELS; PRONOUN RESOLUTION; RANDOM SAMPLING; STRUCTURAL INFORMATION; SYNTACTIC FEATURES; SYSTEMATIC STUDY; TEMPLATE EXTRACTION; TRAINING DATA;

LINGUISTICS; SYNTACTICS;

COMPUTATIONAL GRAMMARS;

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

References (24)

1. N. Asher. 1993. Reference to Abstract Objects in Discourse. Kluwer Academic Publisher. 1993.
2. V. Vapnik. 1995. The Nature of Statistical Learning Theory. Springer.1995.
3. M. Kubat and S. Matwin, 1997. Addressing the curse of imbalanced data set: One sided sampling. In Proceedings of the Fourteenth International Conference on Machine Learning, 1997. pg179-186.
4. T. Joachims. 1999. Making large-scale svm learning practical. In Advances in Kernel Methods - Support Vector Learning. MIT Press.1999.
5. W. Soon, H. Ng, and D. Lim. 2001. A machine learning approach to coreference resolution of noun phrases. In Computational Linguistics, Vol:27(4), pg521-544. (Pubitemid 33597451)
6. D. Byron. 2002. Resolving Pronominal Reference to Abstract Entities, in Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL'02). July 2002., USA.
7. M. Collins and N. Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL'02). July 2002., USA.
8. V. Ng and C. Cardie. 2002a. Improving machine learning approaches to coreference resolution. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL'02). July 2002., USA. pg104-111.
9. V. Ng, and C. Cardie. 2002b. Identifying anaphoric and non-anaphoric noun phrases to improve coreference resolution. In Proceedings of the 19th International Conference on Computational Linguistics (COLING02). (2002).
10. st Annual Meeting of the Association for Computational Linguistics (ACL'03), 2003.
11. D. Klein and C. Manning. 2003a. Fast Exact Inference with a Factored Model for Natural Language Parsing. In Advances in Neural Information Processing Systems 15 (NIPS 2002), Cambridge, MA: MIT Press, pp. 3-10.
12. st Annual Meeting of the Association for Computational Linguistics (ACL'03), 2003. pg423-430.
13. st Annual Meeting of the Association for Computational Linguistics (ACL'03), 2003. pg176-183.
14. A. Moschitti. 2004. A study on convolution kernels for shallow semantic parsing. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL'04), pg335-342.
15. A. Estabrooks, T. Jo, and N. Japkowicz. 2004. A multiple resampling method for learning from imbalanced data sets. In Computational Intelligence Vol:20(1). pg18-36.
16. X. Yang, J. Su, G. Zhou, and C. Tan. 2004. Improving pronoun resolution by incorporating coreferential information of candidates. In Proceedings of 42th Annual Meeting of the Association for Computational Linguistics, 2004. pg127-134.
17. X. Yang, J. Su and C.Tan. 2005a. Improving Pronoun Resolution Using Statistics-Based Semantic Compatibility Information. In Proceedings of Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL'05). June 2005.
18. X. Yang, J. Su and C.Tan. 2005b. A Twin-Candidates Model for Coreference Resolution with Non-Anaphoric Identification Capability. In Proceedings of IJCNLP-2005. Pp. 719-730, 2005.
19. E. Hovy, M. Marcus, M. Palmer, L. Ramshaw, and R. Weischedel. 2006. OntoNotes: The 90\% Solution. In Proceedings of the Human Language Technology Conference of the NAACL, 2006.
20. X. Yang, J. Su and C.Tan. 2006. Kernel-Based Pronoun Resolution with Structured Syntactic Knowledge. In Proceedings of the 44th Annual Meeting of the Association for Computational Linguistics (ACL'06). July 2006. Australia.
21. A. Moschitti, Making tree kernels practical for natural language learning. In Proceedings EACL 2006, Trento, Italy, 2006.
22. C. Müller. 2007. Resolving it, this, and that in unrestricted multi-party dialog. In Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics (ACL'07). 2007. Czech Republic. pg816-823.
23. X. Yang, J. Su and C.Tan. 2008. A Twin-Candidates Model for Learning-Based Coreference Resolution. In Computational Linguistics, Vol:34(3). pg327-356.
24. S. Pradhan, L. Ramshaw, R. Weischedel, J. Mac-Bride, and L. Micciulla. 2007. Unrestricted Coreference: Identifying Entities and Events in Onto-Notes. In Proceedings of the IEEE International Conference on Semantic Computing (ICSC), Sep. 2007.