Javascript must be enabled to continue!
Graph-Based Bootstrapping for Coreference Resolution
View through CrossRef
AbstractCoreference resolution is a challenging natural language processing task, and it is difficult to identify the correct mentions of an entity that can be any noun or noun phrase. In this article, a semisupervised, two-stage pattern-based bootstrapping approach is proposed for the coreference resolution task. During Stage 1, the possible mentions are identified using word-based features, and during Stage 2, the correct mentions are identified by filtering the non-coreferents of an entity using statistical measures and graph-based features. Whereas the existing approaches use morphosyntactic and number/gender agreement features, the proposed approach uses semantic graph-based context-level semantics and nested noun phrases in the correct mentions identification. Moreover, mentions without the number/gender information are identified, using the context-based features of the semantic graph. The evaluation performed for the coreference resolution shows significant improvements, when compared with the word association-based bootstrapping systems.
Title: Graph-Based Bootstrapping for Coreference Resolution
Description:
AbstractCoreference resolution is a challenging natural language processing task, and it is difficult to identify the correct mentions of an entity that can be any noun or noun phrase.
In this article, a semisupervised, two-stage pattern-based bootstrapping approach is proposed for the coreference resolution task.
During Stage 1, the possible mentions are identified using word-based features, and during Stage 2, the correct mentions are identified by filtering the non-coreferents of an entity using statistical measures and graph-based features.
Whereas the existing approaches use morphosyntactic and number/gender agreement features, the proposed approach uses semantic graph-based context-level semantics and nested noun phrases in the correct mentions identification.
Moreover, mentions without the number/gender information are identified, using the context-based features of the semantic graph.
The evaluation performed for the coreference resolution shows significant improvements, when compared with the word association-based bootstrapping systems.
Related Results
Within-Document Arabic Event Coreference: Challenges, Datasets, Approaches and Future Direction
Within-Document Arabic Event Coreference: Challenges, Datasets, Approaches and Future Direction
Event coreference resolution is a crucial component in Natural Language Processing (NLP) applications as it directly affects text summarization, machine translation, classification...
A constraint-based hypergraph partitioning approach to coreference resolution
A constraint-based hypergraph partitioning approach to coreference resolution
The objectives of this thesis are focused on research in machine learning for
coreference resolution. Coreference resolution is a natural language processing
task that consists o...
Incorporating Structural Information for Better Coreference Resolution
Incorporating Structural Information for Better Coreference Resolution
Coreference resolution plays an important role in text understanding. In the literature, various neural approaches have been proposed and achieved considerable success. However, st...
Bootstrapping promotes the RSFC-behavior associations: an application of individual cognitive traits prediction
Bootstrapping promotes the RSFC-behavior associations: an application of individual cognitive traits prediction
AbstractResting state functional connectivity records enormous functional interaction information between any pair of brain nodes, which enriches the prediction of individual pheno...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...

