{"id":986,"date":"2021-12-15T08:02:41","date_gmt":"2021-12-15T07:02:41","guid":{"rendered":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/nouveausite\/?page_id=986"},"modified":"2023-01-16T18:09:42","modified_gmt":"2023-01-16T17:09:42","slug":"these-rita-hijazi","status":"publish","type":"page","link":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/these-rita-hijazi\/","title":{"rendered":"These Rita Hijazi"},"content":{"rendered":"

\"\"Rita Hijazi<\/span><\/strong>, \u00ab Simplification syntaxique de textes \u00e0 base de repr\u00e9sentation s\u00e9mantique exprim\u00e9es avec le formalisme Dependency Minimal Recursion Semantics (DMRS)<\/span> \u00bb. Th\u00e8se AMU. Co-direction avec N. Gala. (LPL). Soutenance le 14 d\u00e9cembre\u00a0 2022. Manuscrit<\/a><\/span><\/p>\n

Cette recherche porte sur la proposition d\u2019une m\u00e9thode et d\u2019un syst\u00e8me informatique associ\u00e9 de simplification syntaxique de phrases. Cette simplification syntaxique repose dans cette th\u00e8se sur des transformations de repr\u00e9sentation s\u00e9mantique des phrases \u00e0 simplifier, transformation r\u00e9alis\u00e9es par des r\u00e8gles d\u00e9finies manuellement. Nous avons retenue une repr\u00e9sentation s\u00e9mantique de texte sp\u00e9cifique, une repr\u00e9sentation s\u00e9mantique profonde, la notation DMRS (Dependency Minimal Recursion Semantics<\/em>) attribu\u00e9e par Copestake (2009), notation DMRS prennant en compte \u00e0 la fois les annotations s\u00e9mantiques et syntaxiques des phrases. La m\u00e9thode de simplification syntaxique propos\u00e9e repose sur trois \u00e9tapes principales. La premi\u00e8re \u00e9tape consiste \u00e0 repr\u00e9senter la phrase complexe par un graphe DMRS, dans le seconde \u00e9tape il s\u2019agit de transformer ce graphe DMRS en un ou plusieurs autres graphes DMRS en appliquant un ensemble de r\u00e8gles de transformation. Enfin, dans la troisi\u00e8me \u00e9tape s\u2019agit de g\u00e9n\u00e9rer \u00e0 partir de ces nouveaux graphes obtenus les phrases simplifi\u00e9es associ\u00e9es \u00e0 la phrase complexe de d\u00e9part. Les outils informatique utilis\u00e9s sont notamment le parseurs DMRS (et g\u00e9n\u00e9rateur) ACE, le syst\u00e8me de r\u00e9\u00e9criture de graphe \u00e0 base de r\u00e8gles GREW, les visualisateurs de graphes, tout en d\u00e9veloppant un algorithme pour automatiser la t\u00e2che. Nous traitons diff\u00e9rentes constructions syntaxiques, telles que les coordinations, les relatives et les appositives.<\/span><\/p>\n

This research concerns the proposal of a method and an associated computer system for the syntactic simplification of sentences. This syntactic simplification is based in this thesis on transformations of the semantic representation of the sentences to be simplified, transformations carried out by manually defined rules. We have chosen a specific semantic representation of text, a deep semantic representation, the DMRS notation (Dependency Minimal Recursion Semantics) attributed by Copestake (2009), a DMRS notation taking into account both semantic and syntactic annotations of sentences. The proposed syntactic simplification method is based on three main steps. The first step consists in representing the complex sentence by a DMRS graph, in the second step it consists in transforming this DMRS graph into one or several other DMRS graphs by applying a set of transformation rules. Finally, in the third step, the simplified sentences associated with the original complex sentence are generated from these new graphs. The computer tools used are the DMRS parser (and generator) ACE, the rule-based graph rewriting system GREW, graphs viewers, while developing an algorithm to automate the task. We deal with different syntactic constructions, such as coordinations, relatives and appositives.<\/em><\/span><\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

Rita Hijazi, \u00ab Simplification syntaxique de textes \u00e0 base de repr\u00e9sentation s\u00e9mantique exprim\u00e9es avec le formalisme Dependency Minimal Recursion Semantics (DMRS) \u00bb. Th\u00e8se AMU. Co-direction avec N. Gala. (LPL). Soutenance le 14 d\u00e9cembre\u00a0 2022. Manuscrit Cette recherche porte sur la proposition d\u2019une m\u00e9thode et d\u2019un syst\u00e8me informatique associ\u00e9 de simplification syntaxique de phrases. Cette simplification … <\/p>\n

Continuer la lecture \u00ab\u00a0These Rita Hijazi\u00a0\u00bb<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_crdt_document":"","footnotes":""},"class_list":["post-986","page","type-page","status-publish","hentry","entry"],"_links":{"self":[{"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/pages\/986","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/comments?post=986"}],"version-history":[{"count":15,"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/pages\/986\/revisions"}],"predecessor-version":[{"id":1680,"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/pages\/986\/revisions\/1680"}],"wp:attachment":[{"href":"https:\/\/pageperso.lis-lab.fr\/bernard.espinasse\/index.php\/wp-json\/wp\/v2\/media?parent=986"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}