1 / 9

From Graph to Tree: Processing UNL Graphs Using an Existing MT System

From Graph to Tree: Processing UNL Graphs Using an Existing MT System Etienne BLANC & Gilles SERASSET GETA, CLIPS-IMAG BP 53, F-38041 Grenoble cedex 09. T R A N S F E R. G E N E R A T I O N. A N A L Y S I S. The ARIANE generator of MT systems. T R A N S F E R.

cree
Download Presentation

From Graph to Tree: Processing UNL Graphs Using an Existing MT System

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. From Graph to Tree: Processing UNL Graphs Using an Existing MT System • EtienneBLANC & Gilles SERASSET • GETA, CLIPS-IMAG • BP 53, F-38041 Grenoble cedex 09

  2. T R A N S F E R G E N E R A T I O N A N A L Y S I S The ARIANE generator of MT systems

  3. T R A N S F E R UNL graph ARIANE tree G E N E R A T I O N French text A UNL deconverter using the ARIANE environment

  4. The graph-to-tree transfer Text deep representation (UNL graph form) UNL graph graph to tree lexical & structural transfer module UNL-to-French dictionary Text deep representation (French tree form) Input ARIANE tree

  5. window obj open agt he He doesn’t open the window. [S] agt(open(icl>do).@entry.@not,he) obj(open(icl>do).@entry.@not,window.@def) [/S] Transferring a simple graph |-- 2:'ICL>DO' -- 1:'OUVRIR' --|-- 3:'FENE!3T !-- 4:'IL' 1 'OUVRIR': UL('OUVRIR'),CAT(CATV),AUX(AVOIR),VAL1(GN), VARUNL(ENTRY,NOT),INST(2) 2 'ICL>DO': UL('ICL>DO'), RESTR(1) 3 'FENE!3TRE': UL('FENE!3TRE'), VARUNL(DEF), RSUNL(OBJ),INST(2),CAT(CATN),GNR(FEM) 4 'IL': UL('IL'), RSUNL(AGT),INST(2),CAT(CATR)

  6. pos paper lecturer paper obj obj read pos read agt agt lecturer lecturer The lecturer read his paper. [S] agt(read(icl>do).@entry.@past,lecturer.@def) obj(read(icl>do).@entry.@past,paper(icl>article)) pos(paper(icl>article),lecturer) [/S] Transferring a graph with closed circuit |-- 2:'ICL>DO' | |-- 4:'ICL>ARTICLE -- 1:'LIRE' --------|-- 3:'COMMUNICATION -!-- 5:'CONFE!1RENCIER | !-- 6:'CONFE!1RENCIER 1 'LIRE': UL('LIRE'),CAT(CATV),AUX(AVOIR),VAL1(GN), VARUNL(ENTRY,PAST),INST(2) 2 'ICL>DO': UL('ICL>DO'), RESTR(1) 3 'COMMUNICATION': UL('COMMUNICATION'),CAT(CATN),GNR(FEM), RSUNL(OBJ),INST(2) 4 'ICL>ARTICLE': UL('ICL>ARTICLE'), RESTR(1) 5 'CONFE!1RENCIER': UL('CONFE!1RENCIER'), RSUNL(POS),INST(2),CAT(CATN),GNR(MAS,FEM),N(NC) 6 'CONFE!1RENCIER': UL('CONFE!1RENCIER'), VARUNL(DEF), RSUNL(AGT),INST(2),CAT(CATN),GNR(MAS,FEM)

  7. he he 01: 01: he agt agt agt agt come come and and regret regret know know agt agt obj obj obj obj you you :01 :01 :01 [S]; He knows that you will not come and regrets it. agt(regret(icl>do).@entry,he(icl>human)) obj(regret(icl>do).@entry,:01) agt:01(come(agt>human,goal>place).@entry.@future.@not,you) and(regret(icl>do).@entry,know(agt>human,icl>event)) agt(know(agt>human,icl>event),he(icl>human)) obj(know(agt>human,icl>event),:01) [/S] Transferring a graph with closed circuit and scope (1)

  8. he he agt agt and regret know obj obj :01 :01 come agt he he 01: you agt agt come and regret know agt obj obj you :01 :01 Transferring a graph with closed circuit and scope (2) |-- 2:'ICL>DO' | |-- 4:'AGT>HUMAN' | |-- 5:'ICL>EVENT' | | |-- 8:'AGT>HUMAN' |-- 3:'SAVOIR' -----|-- 6:'°S01°' -------- 7:'VENIR' -------|-- 9:'GOAL>PLACE' -- 1:'REGRETTER' ---| | !-- 10:'TU' | | | !-- 11:'IL' ---------- 12:'ICL>HUMAN' | |-- 13:'°S01°' !-- 14:'IL' ---------- 15:'ICL>HUMAN'

  9. Conclusion : An existing modular MT system using tree representation was quite easily adapted to UNL deconversion.

More Related