A comprehensive survey on automatic knowledge graph construction
Automatic knowledge graph construction aims at manufacturing structured human
knowledge. To this end, much effort has historically been spent extracting informative fact …
knowledge. To this end, much effort has historically been spent extracting informative fact …
Machine learning for entity coreference resolution: A retrospective look at two decades of research
V Ng - Proceedings of the aaai conference on artificial …, 2017 - ojs.aaai.org
Though extensively investigated since the 1960s, entity coreference resolution, a core task
in natural language understanding, is far from being solved. Nevertheless, significant …
in natural language understanding, is far from being solved. Nevertheless, significant …
Latent structures for coreference resolution
S Martschat, M Strube - Transactions of the Association for …, 2015 - direct.mit.edu
Abstract Machine learning approaches to coreference resolution vary greatly in the
modeling of the problem: while early approaches operated on the mention pair level, current …
modeling of the problem: while early approaches operated on the mention pair level, current …
Incorporating centering theory into neural coreference resolution
In recent years, transformer-based coreference resolution systems have achieved
remarkable improvements on the CoNLL dataset. However, how coreference resolvers can …
remarkable improvements on the CoNLL dataset. However, how coreference resolvers can …
Conundrums in entity coreference resolution: Making sense of the state of the art
Despite the significant progress on entity coreference resolution observed in recent years,
there is a general lack of understanding of what has been improved. We present an …
there is a general lack of understanding of what has been improved. We present an …
Latent trees for coreference resolution
ER Fernandes, CN dos Santos… - Computational Linguistics, 2014 - direct.mit.edu
We describe a structure learning system for unrestricted coreference resolution that explores
two key modeling techniques: latent coreference trees and automatic entropy-guided feature …
two key modeling techniques: latent coreference trees and automatic entropy-guided feature …
Coreference resolution: toward end-to-end and cross-lingual systems
The task of coreference resolution has attracted considerable attention in the literature due
to its importance in deep language understanding and its potential as a subtask in a variety …
to its importance in deep language understanding and its potential as a subtask in a variety …
Exploring Spanish corpora for Portuguese coreference resolution
The task of coreference resolution has attracted a great deal of attention in the literature due
to its importance in deep language understanding, and its potential as a subtask in a variety …
to its importance in deep language understanding, and its potential as a subtask in a variety …
Supporting graph-based real-time applications in distributed systems
C Liu, JH Anderson - … Conference on Embedded and Real-Time …, 2011 - ieeexplore.ieee.org
The processing graph method (PGM) is a widely used framework for modeling applications
with producer/consumer precedence constraints. PGM was originally developed by the US …
with producer/consumer precedence constraints. PGM was originally developed by the US …
Entity-centric coreference resolution of person entities for open information extraction
This work presents a coreference resolution system of person entities based on a multi-pass
architecture which sequentially applies a set of independent modules, using an entity-centric …
architecture which sequentially applies a set of independent modules, using an entity-centric …