No Detail Found!

Toward the resolution of French anaphoric definite descriptions.

Author(s)
Allaoua Refoufi Department of Computer Science, Ferhat Abbas University, Setif, Algeria
Abstract
Anaphora resolution attempts to determine the correct antecedent (entity that it is referred to) of an anaphor (the term pointing back). In what follows, we propose an algorithm for the resolution of anaphoric definite descriptions that relies on lexical, syntactic and semantic knowledge. The semantic knowledge is incorporated as a hand-coded ontology. The algorithm, based on several heuristics, returns an indefinite noun phrase as the antecedent when the latter and the anaphor (the definite expression) satisfy one of the following semantic relations: synonymy, hyperonymy (super class), hyponymy (subclass), meronymy (part-whole) and the compatibility constraints. The compatibility constraints are applied to the modifiers of the antecedent and to those of the anaphor.
Publication Details
Page(s) 1152-1157
DOI DOI not available
Published Journal: Information technology Journal, Volume: 6, Issue: 8, Year: 2007

Request the full text from PASTIC

0

Citations

0

Downloads

65

Views