Please use this identifier to cite or link to this item:
|Title:||A twin-candidate model for learning-based anaphora resolution|
|Citation:||Yang, X., Su, J., Tan, C.L. (2008). A twin-candidate model for learning-based anaphora resolution. Computational Linguistics 34 (3) : 327-356. ScholarBank@NUS Repository. https://doi.org/10.1162/coli.2008.07-004-R2-06-57|
|Abstract:||The traditional single-candidate learning model for anaphora resolution considers the antecedent candidates of an anaphor in isolation, and thus cannot effectively capture the preference relationships between competing candidates for its learning and resolution. To deal with this problem, we propose a twin-candidate model for anaphora resolution. The main idea behind the model is to recast anaphora resolution as a preference classification problem. Specifically, the model learns a classifier that determines the preference between competing candidates, and, during resolution, chooses the antecedent of a given anaphor based on the ranking of the candidates. We present in detail the framework of the twin-candidate model for anaphora resolution. Further, we explore how to deploy the model in the more complicated coreference resolution task. We evaluate the twin-candidate model in different domains using the Automatic Content Extraction data sets. The experimental results indicate that our twin-candidate model is superior to the single-candidate model for the task of pronominal anaphora resolution. For the task of coreference resolution, it also performs equally well, or better. © 2008 Association for Computational Linguistics.|
|Source Title:||Computational Linguistics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 3, 2018
WEB OF SCIENCETM
checked on Nov 26, 2018
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.