Resolving and generating definite anaphora by modeling hypernymy using unlabeled corpora

Proceedings of the Tenth Conference on Computational Natural Language Learning, CoNLL-X

Volumn , Issue , 2006, Pages 37-44

  Garera, Nikesh ^a   Yarowsky, David ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CO-OCCURRENCE; CO-REFERENCE RESOLUTIONS; RELATED WORKS; WORDNET;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84862271334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1596276.1596285     Document Type: Conference Paper

References (19)

1. M. Berland and E. Charniak. 1999. Finding parts in very large corpora. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pages 57-64.
2. S. Caraballo. 1999. Automatic construction of a hypernym-labeled noun hierarchy from text. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pages 120-126.
3. H. H. Clark. 1975. Bridging. In Proceedings of the Conference on Theoretical Issues in Natural Language Processing, pages 169-174.
4. D. Connoly, J. D. Burger, and D. S. Day. 1997. A machine learning approach to anaphoric reference. In Proceedings of the International Conference on New Methods in Language Processing, pages 133-144.
5. D. Graff, J. Kong, K. Chen, and K. Maeda. 2005. English Gigaword Second Edition. Linguistic Data Consortium, catalog number LDC2005T12.
6. S. Harabagiu, R. Bunescu, and S. J. Maiorano. 2001. Text and knowledge mining for coreference resolution. In Proceedings of the Second Meeting of the North American Chapter of the Association for Computational Linguistics, pages 55-62.
7. M. Hearst. 1992. Automatic acquisition of hyponyms from large text corpora. In Proceedings of the 14th International Conference on Computational Linguistics, pages 539-545.
8. J. Hobbs. 1978. Resolving pronoun references. Lingua, 44:311-338.
9. K. Markert and M. Nissim. 2005. Comparing knowledge sources for nominal anaphora resolution. Computational Linguistics, 31(3):367-402.
10. K. Markert, M. Nissim, and N. N. Modjeska. 2003. Using the web for nominal anaphora resolution. In Proceedings of the EACL Workshop on the Computational Treatment of Anaphora, pages 39-46.
11. J. Meyer and R. Dale. 2002. Mining a corpus to support associative anaphora resolution. In Proceedings of the Fourth International Conference on Discourse Anaphora and Anaphor Resolution.
12. 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.
13. M. Poesio, R. Vieira, and S. Teufel. 1997. Resolving bridging references in unrestricted text. In Proceedings of the ACL Workshop on Operational Factors in Robust Anaphora, pages 1-6.
14. M. Poesio, T. Ishikawa, S. Schulteim Walde, and R. Viera. 2002. Acquiring lexical knowledge for anaphora resolution. In Proccedings of the Third Conference on Language Resources and Evaluation, pages 1220-1224.
15. M. Poesio, R. Mehta, A. Maroudas, and J. Hitzeman. 2004. Learning to resolve bridging references. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, pages 143-150.
16. W. M. Soon, H. T. Ng, and D. C. Y. Lim. 2001. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544.
17. M. Strube, S. Rapp, and C. Müller. 2002. The influence of minimum edit distance on reference resolution. In Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing, pages 312-319.
18. R. Vieira and M. Poesio. 2000. An empirically-based system for processing definite descriptions. Computational Linguistics, 26(4):539-593.
19. X. Yang, G. Zhou, J. Su, and C. L. Tan. 2003. Coreference resolution using competition learning approach. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 176-183.