Coreference Resolution Using Verbs Knowledge
Journal Title: Journal of Information Systems and Telecommunication - Year 2017, Vol 5, Issue 2
Abstract
Coreference resolution is the problem of determining which mention in a text refer to the same entities, and is a crucial and difficult step in every natural language processing task. Despite the efforts that have been made in the past to solve this problem, its performance still does not meet today’s applications requirements. Given the importance of the verbs in sentences, in this work we tried to incorporate three types of their information on coreference resolution problem, namely, selectional restriction of verbs on their arguments, semantic relation between verb pairs, and the truth that arguments of a verb cannot be coreferent of each other. As a needed resource for supporting our model, we generate a repository of semantic relations between verb pairs automatically using Distributional Memory (DM), a state-of-the-art framework for distributional semantics. This resource consists of pairs of verbs associated with their probable arguments, their role mapping, and significance scores based on our measures. Our proposed model for coreference resolution encodes verbs’ knowledge with Markov logic network rules on top of deterministic Stanford coreference resolution system. Experiment results show that this semantic layer can improve the recall of the Stanford system while preserves its precision and improves it slightly.
Authors and Affiliations
Hasan Zafari, Maryam Hourali, Heshaam Faili
Keywords
Related Articles
- EP ID EP211814
- DOI -
- Views 119
- Downloads 0
Safe Use of the Internet of Things for Privacy Enhancing
New technologies and their uses have always had complex economic, social, cultural, and legal implications, with accompanying concerns about negative consequences. So it will probably be with the IoT and their use of dat...
Efficient Land-cover Segmentation Using Meta Fusion
Most popular fusion methods have their own limitations; e.g. OWA (order weighted averaging) has “linear model” and “summation of inputs proportions in fusion equal to 1” limitations. Considering all possible models for f...
Towards Accelerating IP Lookups on Commodity PC Routers using Bloom Filter: Proposal of Bloom-Bird
Nowadays, routers are the main backbone of computer networks specifically the Internet. Moreover, the need for high-performance and high-speed routers has become a fundamental issue due to significant growth of informati...
COGNISON: A Novel Dynamic Community Detection Algorithm in Social Network
The problem of community detection has a long tradition in data mining area and has many challenging facet, especially when it comes to community detection in time-varying context. While recent studies argue the usabilit...
PSO-Algorithm-Assisted Multiuser Detection for Multiuser and Inter-symbol Interference Suppression in CDMA Communications
Applying particle swarm optimization (PSO) algorithm has become a widespread heuristic technique in many fields of engineering. In this paper, we apply PSO algorithm in additive white Gaussian noise (AWGN) and multipath...