[PDF] Top 20 An Algorithm for Anaphora Resolution in Spanish Texts

... In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics COLING-ACL'98, pages 385-391, Mo[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 ...pronominal anaphora resolution ... 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

... ~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

... pronoun resolution algorithms ...pronoun resolution algorithms can select the antecedent for a pronoun from a list of known candidates and are not influenced by wrongly identified ... See full document

... Co-reference resolution is a process which deter-mines the entity a noun phrase is referring ...reference resolution is related to Anaphora resolution in which the closest reference is ... See full document

... other? Anaphora resolution is one of the most important area in Natural Language ...of anaphora and its antecedents for ...Centering algorithm for identification of pronoun and its ... 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

... This paper describes an evaluation of a focusbased approach to pronoun resolution not anaphora in general, based on an extension of Sidner's algorithm Sidner, 1981 proposed in Azzam, 199[r] ... See full document

... The probabilistic model results from a simple decomposition process applied to a conditional probability equation that involves several param- eters (features). The decomposition makes use of Bayes’ theorem and ... See full document

... W e present three algorithms for resolving anaphora in Slot Grammar: 1 an algorithm for interpreting elliptical VPs in antecedent-contained deletion structures, subdeletion constructions[r] ... 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

... Abstract: Anaphora Resolution is one of the fundamental tasks in Natural Language ...on Anaphora Resolution but still very limited research have been carried out on Indian languages like ... See full document

... Anaphora resolution approaches can also be broadly classified as knowledge-poor approaches and knowledge-rich, depending on the amount of contextual knowledge integrated into the ...earliest ... 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 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

... pronoun resolution and report on the few proposals for integrat- ing prosody into pronoun resolution ...online anaphora resolution algo- rithms to predict the features under investigation ... See full document

... Traditionally, anaphora resolution systems have relied on syntactic, semantic or pragmatic clues to identify the antecedent of an ...Hobbs’ algorithm [Hobbs, 76] was the first syntax-oriented method ... See full document

... learning algorithm can effectively identify the importance of the pattern features for the resolution decision, and therefore including non-indicative patterns would not damage the ... 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