Evaluating name-matching for coreference resolution

Proceedings of the 4th International Conference on Language Resources and Evaluation, LREC 2004

Volumn , Issue , 2004, Pages 1339-1342

  Uryupina, Olga ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CO-REFERENCE RESOLUTIONS; FEATURE COMBINATION; MATCHING TECHNIQUES; NAME MATCHING;

LEARNING SYSTEMS;

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

References (10)

1. Branting, L. Karl, 2002. Name-matching algorithms for legal case-management systems. Journal of Information, Law & Technology, (1).
2. Charniak, Eugene, 2000. A maximum-entropy-inspired parser. In Proceedings of NAACL.
3. Cohen, William W., 1995. Fast effective rule induction. In Proceedings of ICML.
4. Hirschman, Lynette and Nancy Chinchor, 1997. Muc-7 coreference task definition. In Proceedings of MUC-7.
5. Mitkov, Ruslan, 1999. Anaphora resolution: the state of the art. Technical report, University of Wolverhampton.
6. Ng, Vincent and Claire Cardie, 2002. Combining sample selection and error-driven pruning for machine learning of coreference rules. In Proceedings of EMNLP.
7. Soon, Wee Meng, Hwee Tou Ng, and Daniel Chung Yong Lim, 2001. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544.
8. Strube, Michael, Stefan Rapp, and Christof Müller, 2002. The influence of minimum edit distance on reference resolution. In Proceedings of EMNLP.
9. Vilain, Marc, John Burger, John Aberdeen, Dennis Connolly, and Lynette Hirschman, 1995. A model-theoretic coreference scoring scheme. In Proceedings of MUC-6.
10. Wagner, Robert A. and Michael J. Fischer, 1974. The string-to-string correction problem. Journal of the ACM, 21(1):168-173.