2002 · 75 citations · 13 references
ComputingComputer ScienceComputational LinguisticsFeature EngineeringNatural Language ProcessingAnaphora ResolutionCoreference ResolutionLanguage ModelingNamed Entity RecognitionCoreference MatchingDecision-tree AnalysisDefiniteness In Proper NamesEdit DistanceMention DetectionMinimum DistanceNamed Entity MatchingReference Data Sets
We report on experiments in reference resolution using a decision tree approach. We started with a standard feature set used in previous work, which led to moderate results. A closer examination of the performance of the features for different forms of anaphoric expressions showed good results for pronouns, moderate results for proper names, and poor results for definite noun phrases. We then included a cheap, language and domain independent feature based on the minimum edit distance between strings. This feature yielded a significant improvement for data sets consisting of definite noun phrases and proper names, respectively. When applied to the whole data set the feature produced a smaller but still significant improvement.
13
The String-to-String Correction Problem
Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 1974 · 3.1K citations · Full text
Assessing agreement on classification tasks: the kappa statistic
Jean Carletta · ArXiv.org · 1996 · 2.1K citations · Full text
Thorsten Brants · 2000 · 1.3K citations · Full text
A model-theoretic coreference scoring scheme
Marc Vilain, John D. Burger, John Aberdeen et al. · 1995 · 682 citations · Full text