Kernel-based pronoun resolution with structured syntactic knowledge

COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2006, Pages 41-48

  Yang, Xiaofeng ^a   Su, Jian ^a   Tan, Chew Lim ^b  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORESTRY;

KERNEL BASED METHODS; KERNEL FUNCTION; PARSE TREES; PRONOUN RESOLUTION; SYNTACTIC FEATURES; SYNTACTIC INFORMATION;

SYNTACTICS;

EID: 84860533492     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220175.1220181     Document Type: Conference Paper

References (18)

1. C. Aone and S. W. Bennett. 1995. Evaluating automated and manual acquisition of anaphora resolution strategies. In Proceedings of the 33rd Annual Meeting of the Association for Compuational Linguistics, pages 122-129.
2. E. Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of North American chapter of the Association for Computational Linguistics annual meeting, pages 132-139.
3. 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), pages 263- 270.
4. M. Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
5. J. Hobbs. 1978. Resolving pronoun references. Lingua, 44:339-352.
6. T. Joachims. 1999. Making large-scale svm learning practical. In Advances in Kernel Methods - Support Vector Learning. MIT Press.
7. F. Keller and M. Lapata. 2003. Using the web to obtain freqencies for unseen bigrams. Computational Linguistics, 29(3):459-484.
8. C. Kennedy and B. Boguraev. 1996. Anaphora for everyone: pronominal anaphra resolution without a parser. In Proceedings of the 16th International Conference on Computational Linguistics, pages 113-118, Copenhagen, Denmark.
9. S. Lappin and H. Leass. 1994. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20(4):525-561.
10. X. Luo and I. Zitouni. 2005. Milti-lingual coreference resolution with syntactic features. In Proceedings of Human Language Techonology conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP), pages 660-667.
11. R. Mitkov. 1998. Robust pronoun resolution with limited knowledge. In Proceedings of the 17th Int. Conference on Computational Linguistics, pages 869- 875.
12. 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), pages 335-342.
13. V. Ng and C. Cardie. 2002. Improving machine learning approaches to coreference resolution. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, pages 104-111, Philadelphia.
14. W. Soon, H. Ng, and D. Lim. 2001. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544.
15. V. Vapnik. 1995. The Nature of Statistical Learning Theory. Springer.
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, pages 127-134, Barcelona.
17. D. Zelenko, C. Aone, and A. Richardella. 2003. Kernel methods for relation extraction. Journal of Machine Learning Research, 3(6):1083-1106.
18. S. Zhao and R. Grishman. 2005. Extracting relations with integrated information using kernel methods. In Proceedings of 43rd Annual Meeting of the Association for Computational Linguistics (ACL05), pages 419-426.