Abstract
We propose a machine learning-based approach to noun-phrase anaphora resolution that combines the advantages of previous learning-based models while overcoming their drawbacks. Our anaphora resolution process reverses the order of the steps in the classification-then-search model proposed by Ng and Cardie [2002b], inheriting all the advantages of that model. We conducted experiments on resolving noun-phrase anaphora in Japanese. The results show that with the selection-then-classification-based modifications, our proposed model outperforms earlier learning-based approaches.
Original language | English |
---|---|
Pages (from-to) | 417-434 |
Number of pages | 18 |
Journal | ACM Transactions on Asian Language Information Processing |
Volume | 4 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2005 |
Externally published | Yes |
Keywords
- Anaphora resolution
- Anaphoricity determination
- Antecedent identification
ASJC Scopus subject areas
- Computer Science(all)