Indirect Anaphora Resolution using Parallel Queues

Main Article Content

Lokesh Kumar Sharma
Dr. Ela Kumar

Abstract

When we are dealing with natural language text we come across the term Anaphora and for capturing the knowledge encoded in text Anaphora resolution is very essential. Indirect Anaphora are especially challenging to resolve because the referring expression and the antecedent are related by unstated background knowledge. So Such kind of Anaphora need to be resolved properly to capture the knowledge expressed in natural language. There are several ways to resolve Indirect Anaphora some of these treating as a different problem or resolving the Anaphora as semantic path search. In this paper we are proposing slightly different approach to deal with natural language inputs. And so, here first we are tagging lexically different natural inputs and putting these tagged inputs in some predefined parallel queues. Later using parallel queue communication we can determine ongoing discourse and semantic difference which is useful for Indirect Anaphora resolution.


Keywords: Anaphora, Indirect Anaphora, Universal Queue, Queue_Noun_Recency, Message Passing.

Downloads

Download data is not yet available.

Article Details

Section
Articles