Using Decision Trees for Coreference Resolution
| dc.creator | McCarthy, Joseph F. | |
| dc.creator | Lehnert, Wendy G. | |
| dc.date | 1995-05-24 | |
| dc.date.accessioned | 2026-07-07T09:09:53Z | |
| dc.date.available | 2026-07-07T09:09:53Z | |
| dc.description | This paper describes RESOLVE, a system that uses decision trees to learn how to classify coreferent phrases in the domain of business joint ventures. An experiment is presented in which the performance of RESOLVE is compared to the performance of a manually engineered set of rules for the same task. The results show that decision trees achieve higher performance than the rules in two of three evaluation metrics developed for the coreference task. In addition to achieving better performance than the rules, RESOLVE provides a framework that facilitates the exploration of the types of knowledge that are useful for solving the coreference problem. | |
| dc.description | 6 pages; LaTeX source; 1 uuencoded compressed EPS file (separate); uses ijcai95.sty, named.bst, epsf.tex; to appear in Proc. IJCAI '95 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9505043 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9505043 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151196 | |
| dc.subject | Computation and Language | |
| dc.title | Using Decision Trees for Coreference Resolution | |
| dc.type | text |