Graduate School and Research Center in Digital Sciences

Sanaphor++: Combining deep neural networks with semantics for coreference resolution

Plu, Julien; Prokofyev, Roman; Tonon Alberto; Cudré-Mauroux Philippe; Difallah Djellel Eddine; Troncy, Raphaël; Rizzo, Giuseppe

LREC 2018, 11th Language Resources and Evaluation Conference, 7-12 May 2018, Miyazaki, Japan

Coreference resolution has always been a challenging task in Natural Language Processing. Machine learning and semantic techniques have improved the state of the art over the time, though since a few years, the biggest step forward has been made using deep neural networks. In this paper, we describe Sanaphor++, which is an improvement of a top-level deep neural network system for coreference resolution--namely Stanford deep-coref--through the addition of semantic features. The goal of Sanaphor++ is to improve the clustering part of the coreference resolution in order to know if two clusters have to be merged or not once the pairs of mentions have been identified. We evaluate our model over the CoNLL 2012 Shared Task dataset and compare it with the state-of-the-art system (Stanford deep-coref) where we demonstrated an average gain of 1.13% of the average F1 score. 

Document Bibtex

Title:Sanaphor++: Combining deep neural networks with semantics for coreference resolution
Type:Conference
Language:English
City:Miyazaki
Country:JAPAN
Date:
Department:Data Science
Eurecom ref:5615
Copyright: ELRA
Bibtex: @inproceedings{EURECOM+5615, year = {2018}, title = {{S}anaphor++: {C}ombining deep neural networks with semantics for coreference resolution}, author = {{P}lu, {J}ulien and {P}rokofyev, {R}oman and {T}onon {A}lberto and {C}udr{\'e}-{M}auroux {P}hilippe and {D}ifallah {D}jellel {E}ddine and {T}roncy, {R}apha{\"e}l and {R}izzo, {G}iuseppe}, booktitle = {{LREC} 2018, 11th {L}anguage {R}esources and {E}valuation {C}onference, 7-12 {M}ay 2018, {M}iyazaki, {J}apan}, address = {{M}iyazaki, {JAPAN}}, month = {05}, url = {http://www.eurecom.fr/publication/5615} }
See also: