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

2. The ARIANE generator of MT systems GENERATIONGENERATION T R A N S F E R ANALYSISANALYSIS

3. A UNL deconverter using the ARIANE environment UNL graphARIANE tree T R A N S F E R French text GENERATIONGENERATION

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

5. open he obj agt window He doesn’t open the window. [S] agt(open(icl>do).@entry.@not,he) obj(open(icl>do).@entry.@not,window.@def) [/S] 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) |-- 2:'ICL>DO' -- 1:'OUVRIR' --|-- 3:'FENE!3T !-- 4:'IL' Transferring a simple graph

6. 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] 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) |-- 2:'ICL>DO' | |-- 4:'ICL>ARTICLE -- 1:'LIRE' --------|-- 3:'COMMUNICATION -!-- 5:'CONFE!1RENCIER | !-- 6:'CONFE!1RENCIER read paper lecturer obj agt pos read paper lecturer obj agt pos lecturer Transferring a graph with closed circuit

7. [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] regret he :01 agt obj know 01: agt obj you come agt and regret he :01 agt obj know 01: agt obj you come agt and he :01 Transferring a graph with closed circuit and scope (1)

8. |-- 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' regret he :01 agt obj know 01: agt obj you come agt and he :01 he regret :01 agt obj know agt obj you come agt and :01 Transferring a graph with closed circuit and scope (2)

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