| Challenge: | Existing methods for bridging anaphora resolution only consider NPs’ head nouns and thus do not capture the semantics of NP. |
| Approach: | They propose a deterministic approach to bridging anaphora resolution which represents the semantics of an NP based on its head noun and modifications. |
| Outcome: | The proposed approach achieves competitive results compared to the best system in Hou et al. (2013) which explores Markov Logic Networks to model the problem. |
Similar Papers
Enhanced Word Representations for Bridging Anaphora Resolution (N18-2)
Copied to clipboard
| Challenge: | Existing word representations do not capture semantic similarity for bridging anaphora resolution. |
| Approach: | They propose to use word embeddings to capture semantic similarity by exploring syntactic structure of noun phrases. |
| Outcome: | The proposed model achieves 30% of accuracy for bridging anaphora resolution on ISNotes corpus. |
Bridging resolution: Task definition, corpus resources and rule-based experiments (C18-1)
Copied to clipboard
| Challenge: | Recent work on bridging resolution has been based on the corpus ISNotes, as this was the only corpus available with unrestricted bridling annotations. |
| Approach: | They propose a rule-based system to resolve bridging annotations in ISNotes corpus and apply it to new corpora. |
| Outcome: | The proposed system achieves state-of-the-art performance on ISNotes corpus, but low performance on in-domain corpora. |
Bridging Resolution: A Survey of the State of the Art (2020.coling-main)
Copied to clipboard
| Challenge: | bridging resolution is an anaphora resolution task that is less studied than entity coreference resolution. |
| Approach: | This paper presents a survey of the current state of research on bridging resolution . it identifies and resolves bridling/associative anaphors, which are anamorphic references to non-identical associated antecedents. |
| Outcome: | The proposed task is more difficult than entity coreference resolution because of the lack of annotated corpora and lack of standardized evaluation protocols. |
How to represent a word and predict it, too: Improving tied architectures for language modelling (D18-1)
Copied to clipboard
| Challenge: | Recent state-of-the-art models use word embeddings as input and output mappings instead of tied models. |
| Approach: | They propose to decouple hidden state from word embedding prediction . they extend their proposed modification to word2vec models . |
| Outcome: | The proposed architectures achieve comparable or better results compared to previous models without tying . the proposed architecture reduces parameters, enabling more compact models and faster learning. |
Bridging Anaphora Resolution as Question Answering (2020.acl-main)
Copied to clipboard
| Challenge: | Existing studies on bridging anaphora resolution focus on question answering based on context . briding anaphorisms and their antecedents are linked via various lexico-semantic, frame or encyclopedic relations. |
| Approach: | They propose a question answering framework for bridging anaphora resolution . they propose briding anaphorisms and their antecedents are linked via various lexico-semantic, frame or encyclopedic relations. |
| Outcome: | The proposed method generates state-of-the-art results on two bridging corpora. |
Attention Focusing for Neural Machine Translation by Bridging Source and Target Embeddings (P18-1)
Copied to clipboard
| Challenge: | Neural machine translation uses source and target word embeddings to improve translation quality . source and targeted word embeds are at the two ends of a long information processing procedure . |
| Approach: | They propose a method to shorten the distance between source and target words in neural machine translation by bridging source and targeting word embeddings. |
| Outcome: | The proposed method shortens the distance between source and target words in neural machine translation and strengthens their association. |
Bridging Resolution: Making Sense of the State of the Art (2021.naacl-main)
Copied to clipboard
| Challenge: | bridging resolution is a task that involves identifying and resolving bridling/associative anaphors, which are anamorphic references to non-identical associated antecedents. |
| Approach: | They propose a hybrid rule-based and MTL approach that would enable a better understanding of their comparative strengths and weaknesses. |
| Outcome: | The proposed model would be able to better understand their strengths and weaknesses and perform a manual analysis of the errors made by the model. |
PairSpanBERT: An Enhanced Language Model for Bridging Resolution (2023.acl-long)
Copied to clipboard
| Challenge: | bridging resolution is crucial for machine comprehension of discourse entities for various downstream applications. |
| Approach: | They propose a SpanBERT-based pre-trained model specialized for bridging resolution. |
| Outcome: | The proposed model achieves the best results on three evaluation datasets for bridging resolution despite the noise inherent in the automatically generated data . |
Enhancing Word Embeddings with Knowledge Extracted from Lexical Resources (2020.acl-srw)
Copied to clipboard
| Challenge: | In this paper, we present an effective method for semantic specialization of word vector representations. |
| Approach: | They propose a method for semantic specialization of word vector representations using BabelNet. |
| Outcome: | The proposed method improves on word similarity and dialog state tracking tasks. |
ChEMU-Ref: A Corpus for Modeling Anaphora Resolution in the Chemical Domain (2021.eacl-main)
Copied to clipboard
| Challenge: | Using a novel annotation scheme, we identify anaphoric references in chemical patents and determine the chemical relation between linked entities. |
| Approach: | They propose a neural approach to anaphora resolution based on coreference and bridging links in chemical patents. |
| Outcome: | The proposed framework can be used to identify anaphoric references in chemical patents and determine the chemical relation between linked entities. |