Allaoua Refoufi | Universite Farehat Abes Setif (original) (raw)

Papers by Allaoua Refoufi

Research paper thumbnail of Ontology Matching Algorithms

Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication - IPAC '15, 2015

Research paper thumbnail of Toward the Resolution of French Anaphoric Definite Descriptions

Information Technology Journal, 2007

... Network for Scientific Information Toward the Resolution of French Anaphoric Definite Descrip... more ... Network for Scientific Information Toward the Resolution of French Anaphoric Definite Descriptions Allaoua Refoufi Department of Computer Science, Ferhat Abbas University ... An example of verb phrase anaphora would be: «Sarah essaya de convaincre Rachid de se reposer. ...

Research paper thumbnail of A Modular Architecture for Anaphora Resolution

Journal of Computer Science, 2007

Anaphora resolution attempts to determine the correct antecedent of an anaphor (the term pointing... more Anaphora resolution attempts to determine the correct antecedent of an anaphor (the term pointing back). In what follows, we propose an algorithm for the resolution of anaphoric pronouns that relies on lexical and syntactic knowledge incorporated in a modular approach based on constraints and preferences. Our objective was to find the correct antecedent to the following subject pronouns (il, ils, elle, elles), object pronouns (l', le, la, les) and possessive pronouns (son, sa, ses, leur, leurs) in unrestricted texts. We also identify and eliminate pleonastic pronouns and discard candidates appearing in appositions. Moreover we use a focus mechanism to determine salient entities. The algorithm, implemented in Prolog, realizes a success rate of 68%, which was considered a good performance for unrestricted French texts.

Research paper thumbnail of Pronominal Anaphora Resolution Using XML Tagged Documents

Anaphora resolution has become a major issue in natural language processing systems; in this work... more Anaphora resolution has become a major issue in natural language processing systems; in this work we propose a resolution approach in which texts are parsed by a definite clause grammar and then converted into an XML-tagged representation, where sentence elements are marked with discourse, syntactic, and semantic attributes. This extension was made primarily to test the viability of using XML tagged documents for anaphora resolution. The XML representation allows valuable text's enrichment with anaphoric information in an elegant and easy way. The system's performance arises primarily from the integration of multiple knowledge sources in a modular architecture and uses constraints and preferences to select the antecedent. The developed system proposes to resolve pronominal anaphora, namely personal pronouns for French language texts.

Research paper thumbnail of Ontology Matching Algorithms

Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication - IPAC '15, 2015

Research paper thumbnail of Toward the Resolution of French Anaphoric Definite Descriptions

Information Technology Journal, 2007

... Network for Scientific Information Toward the Resolution of French Anaphoric Definite Descrip... more ... Network for Scientific Information Toward the Resolution of French Anaphoric Definite Descriptions Allaoua Refoufi Department of Computer Science, Ferhat Abbas University ... An example of verb phrase anaphora would be: «Sarah essaya de convaincre Rachid de se reposer. ...

Research paper thumbnail of A Modular Architecture for Anaphora Resolution

Journal of Computer Science, 2007

Anaphora resolution attempts to determine the correct antecedent of an anaphor (the term pointing... more Anaphora resolution attempts to determine the correct antecedent of an anaphor (the term pointing back). In what follows, we propose an algorithm for the resolution of anaphoric pronouns that relies on lexical and syntactic knowledge incorporated in a modular approach based on constraints and preferences. Our objective was to find the correct antecedent to the following subject pronouns (il, ils, elle, elles), object pronouns (l', le, la, les) and possessive pronouns (son, sa, ses, leur, leurs) in unrestricted texts. We also identify and eliminate pleonastic pronouns and discard candidates appearing in appositions. Moreover we use a focus mechanism to determine salient entities. The algorithm, implemented in Prolog, realizes a success rate of 68%, which was considered a good performance for unrestricted French texts.

Research paper thumbnail of Pronominal Anaphora Resolution Using XML Tagged Documents

Anaphora resolution has become a major issue in natural language processing systems; in this work... more Anaphora resolution has become a major issue in natural language processing systems; in this work we propose a resolution approach in which texts are parsed by a definite clause grammar and then converted into an XML-tagged representation, where sentence elements are marked with discourse, syntactic, and semantic attributes. This extension was made primarily to test the viability of using XML tagged documents for anaphora resolution. The XML representation allows valuable text's enrichment with anaphoric information in an elegant and easy way. The system's performance arises primarily from the integration of multiple knowledge sources in a modular architecture and uses constraints and preferences to select the antecedent. The developed system proposes to resolve pronominal anaphora, namely personal pronouns for French language texts.