Unrestricted Bridging Resolution

Yufang Hou, Katja Markert, Michael Strube


Abstract
In contrast to identity anaphors, which indicate coreference between a noun phrase and its antecedent, bridging anaphors link to their antecedent(s) via lexico-semantic, frame, or encyclopedic relations. Bridging resolution involves recognizing bridging anaphors and finding links to antecedents. In contrast to most prior work, we tackle both problems. Our work also follows a more wide-ranging definition of bridging than most previous work and does not impose any restrictions on the type of bridging anaphora or relations between anaphor and antecedent. We create a corpus (ISNotes) annotated for information status (IS), bridging being one of the IS subcategories. The annotations reach high reliability for all categories and marginal reliability for the bridging subcategory. We use a two-stage statistical global inference method for bridging resolution. Given all mentions in a document, the first stage, bridging anaphora recognition, recognizes bridging anaphors as a subtask of learning fine-grained IS. We use a cascading collective classification method where (i) collective classification allows us to investigate relations among several mentions and autocorrelation among IS classes and (ii) cascaded classification allows us to tackle class imbalance, important for minority classes such as bridging. We show that our method outperforms current methods both for IS recognition overall as well as for bridging, specifically. The second stage, bridging antecedent selection, finds the antecedents for all predicted bridging anaphors. We investigate the phenomenon of semantically or syntactically related bridging anaphors that share the same antecedent, a phenomenon we call sibling anaphors. We show that taking sibling anaphors into account in a joint inference model improves antecedent selection performance. In addition, we develop semantic and salience features for antecedent selection and suggest a novel method to build the candidate antecedent list for an anaphor, using the discourse scope of the anaphor. Our model outperforms previous work significantly.
Anthology ID:
J18-2002
Volume:
Computational Linguistics, Volume 44, Issue 2 - June 2018
Month:
June
Year:
2018
Address:
Cambridge, MA
Venue:
CL
SIG:
Publisher:
MIT Press
Note:
Pages:
237–284
Language:
URL:
https://aclanthology.org/J18-2002
DOI:
10.1162/COLI_a_00315
Bibkey:
Cite (ACL):
Yufang Hou, Katja Markert, and Michael Strube. 2018. Unrestricted Bridging Resolution. Computational Linguistics, 44(2):237–284.
Cite (Informal):
Unrestricted Bridging Resolution (Hou et al., CL 2018)
Copy Citation:
PDF:
https://preview.aclanthology.org/starsem-semeval-split/J18-2002.pdf
Data
FrameNet