[PDF] Top 20 An Algorithm for Pronominal Anaphora Resolution

... ~9 The comparative blind test indicates that incorporating statistical information on lexical preference patterns into a salience-based anaphora resolution procedure can yield a modest i[r] ... See full document

... references resolution is a common phenomenon in natural language processing, and has correspondingly received a significant amount of attention in the ...Myanmar pronominal anaphora resolution ... See full document

... of anaphora resolution has been taken up from long ...and anaphora in Telugu language and make an attempt to build a rule based pronominal anaphora resolution algorithm ... See full document

... an algorithm called Anaphora Matcher (AM) was implemented to handle inter-sentential anaphora in a two-sentence ...that anaphora do not refer back more than one sentence in most ...for ... See full document

... Little computational linguistics research has been done for anaphora resolution (AR) in Indic lan- guages. Notable research efforts in this area are conducted by Shobha et al. (2000), Prasad et al. (2000), ... See full document

... an algorithm called Anaphora Matcher (AM) is implemented to handle inter-sentential anaphora over a two-sentence ...most anaphora does not refer back more than one sentence in any ...for ... See full document

... Anaphora for Everyone Pronominal Anaphora Resolution without a Parser Anaphora for Everyone Pronominal Anaphora Resolution with o u t a Parser Christopher Kennedy Board of Studies in Linguistics Unive[.] ... See full document

... In this paper we describe the rule-based MT system Its-2 developed at the Uni- versity of Geneva and submitted for the shared task on pronoun translation orga- nized within the Second DiscoMT Work- shop. For improving ... See full document

... INTRODUCTION In this paper we present an implemented algorithm which filters intra-sentential relations of referential dependence between pronouns and putative NP antecedents both full a[r] ... See full document

... We have presented QurAna as a language resource for Quranic scholars, students and for researchers in the computational linguistics community, particularly those investigating computational anaphora ... See full document

... in the target clause; for example in sentence 1 the target clause may receive one of two readings, namely one in which Bill likes John's mother the strict read- ing, and one in which Bil[r] ... See full document

... The mentioned checks resulted in roughly 100,000 sentences across all three corpora. At least some of these remaining sentences have similar properties to Winograd schema sentences; that is, the two noun phrases (NPs) ... See full document

... the antecedent, following the approach used for corefer- ence resolution, see i.a. (Grosz et al., 1995). Most of the semantic types we have used are taken from the middle layer of the hierarchy of abstract objects ... See full document

... Semantic Link algorithm (For a pair of AgP head name category) For each name category a representative synset from the wordnet was selected manually. Then the procedure is follow- ing: First, find matching synset ... See full document

... as pronominal resolution module, which works on basis of salience factors, and non-pronominal resolution module to detect non-anaphoric pronouns using machine-learning ...of pronominal ... See full document

... The probabilistic model results from a simple de- composition process applied to a conditional proba- bility equation that involves several parameters (fea- tures). It is inspired by Ge et al.’s (1998) probabilis- tic ... See full document

... computers. Anaphora resolution is one among the challenging research areas, in which a number of algorithms were proposed but lack of an efficient semantic proposal for a complete ...solution. ... See full document

... The anaphora resolution and other such methods provide the basis for extracting the important information from the source and thus providing a better platform on which the information management techniques ... See full document

... Anaphora resolution. Basically there are three main algorithms for anaphora resolution- Hobbs, Centering and Lappin Leass ...Leass algorithm and the second model is based on the concept ... See full document

... The first three experiments in Table 4 show results for the ‘No Context’ setting. These are on the noisy data (Exp. 1-2) and are indicative of how sensitive our model is to pronouns, since R and R 0 differ in a single ... See full document