Journal of Intelligent Systems 23 (3):293-310 (2014)

Coreference 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.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1515/jisys-2013-0056
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,431
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Is de Jure Coreference Non-Transitive?Thea Goodsell - 2014 - Philosophical Studies 167 (2):291-312.
Coreference and Meaning.N. Ángel Pinillos - 2011 - Philosophical Studies 154 (2):301 - 324.
Resolution-Based Methods for Modal Logics.H. de Nivelle, R. Schmidt & U. Hustadt - 2000 - Logic Journal of the IGPL 8 (3):265-292.
The Complexity of Resolution Refinements.Joshua Buresh-Oppenheim & Toniann Pitassi - 2007 - Journal of Symbolic Logic 72 (4):1336 - 1352.
Playing with Networks: How Economists Explain. [REVIEW]Caterina Marchionni - 2013 - European Journal for Philosophy of Science 3 (3):331-352.
Mutual K-Nearest Neighbor Graph Construction in Graph-Based Semi-Supervised Classification.Kohei Ozaki, Masashi Shimbo, Mamoru Komachi & Yuji Matsumoto - 2013 - Transactions of the Japanese Society for Artificial Intelligence 28 (4):400-408.


Added to PP index

Total views
10 ( #826,032 of 2,374,855 )

Recent downloads (6 months)
1 ( #559,821 of 2,374,855 )

How can I increase my downloads?


My notes