Papers with embeddings_bridging
A Deterministic Algorithm for Bridging Anaphora Resolution (D18-1)
Copied to clipboard
| 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. |