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.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

1 TITLE OF THE ARTICLE Author (Institution) Co-Author (Institution) .
From the UNL hypergraph to GETA's multilevel tree Etienne BLANC GETA, CLIPS-IMAG BP 53, F Grenoble cedex 09
Bellwork If you roll a die, what is the probability that you roll a 2 or an odd number? P(2 or odd) 2. Is this an example of mutually exclusive, overlapping,
Slide 1 Insert your own content. Slide 2 Insert your own content.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. *See PowerPoint Lecture Outline for a complete, ready-made.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 3.1 Chapter 3.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 116.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 40.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 28.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Quest ion 1? A.) answer B.) answer C.) correct answerD.) answer L C.) correct answer F.
Chapter 1 Image Slides Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Leçon 3 DF Bleu. Pg. 45- Take Notes Guiding Question: What are the similarities and differences between French teenagers and American teenagers based.
Multiplying monomials & binomials You will have 20 seconds to answer the following 15 questions. There will be a chime signaling when the questions change.
Coordinate Plane Practice The following presentation provides practice in two skillsThe following presentation provides practice in two skills –Graphing.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Teacher Name Class / Subject Date A:B: Write an answer here #1 Write your question Here C:D: Write an answer here.
Addition Facts
CS4026 Formal Models of Computation Running Haskell Programs – power.
Empty Box Problems Subtraction = 3 If you start on 6 and jump back 3 spaces you land on
Grammar Reference Materials
ABC Technology Project
DeCo : Example 1 UNL Center / UNDL Foundation.
O X Click on Number next to person for a question.
© S Haughton more than 3?
VERB CARDS AVOIR FRONT SIDE OF CARD BACK SIDE OF CARD to have j’ai nous avons tu as vous avez il a ils ont fut/cond: aur- pc: imp.
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Take from Ten First Subtraction Strategy -9 Click on a number below to go directly to that type of subtraction problems
Energy & Green Urbanism Markku Lappalainen Aalto University.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Limits (Algebraic) Calculus Fall, What can we do with limits?
Video Audio Shot 1 Shot: Long Shot Girl starts floating in the air as she is yelling at her teacher. The teacher is heard whimpering at the sight and sound.
Properties of Exponents
Addition 1’s to 20.
25 seconds left…...
Bab /44 Bab 4 Classification: Basic Concepts, Decision Trees & Model Evaluation Part 1 Classification With Decision tree Muhamad Arief Hidayat
Test B, 100 Subtraction Facts
U1A L6 Linear, Quadratic & Polynomial Inequalities
Click your mouse to move the card ahead! Work with a buddy using two Abacuses. First click and follow along using your abacus. After each click talk about.
1 STRUCTURAL AND LEXICAL TRANSFER from a UNL GRAPH to a NATURAL LANGUAGE DEPENDENCY TREE Etienne BLANC, Gilles SERASSET, WangJu TSAI GETA, CLIPS-IMAG.
What is Slope Assignment. List the four types of slope and sketch each type. 1.
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Analysis of engineering system by means of graph representation.
Week 1.
DeCo : Example 4 UNL Center / UNDL Foundation.
Visions of Australia – Regional Exhibition Touring Fund Applicant organisation Exhibition title Exhibition Sample Support Material Instructions 1) Please.
We will resume in: 25 Minutes.
1 Ke – Kitchen Elements Newport Ave. – Lot 13 Bethesda, MD.
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
1 Unit 1 Kinematics Chapter 1 Day
FIND THE AREA ( ROUND TO THE NEAREST TENTHS) 2.7 in 15 in in.
O X Click on Number next to person for a question.
Python Mini-Course University of Oklahoma Department of Psychology Day 1 – Lesson 4 Beginning Functions 4/5/09 Python Mini-Course: Day 1 - Lesson 4 1.
Unit 5 Simple Present, Time Clauses, Used To, and Would.
1/24 17/7/2002 (Papillon-02) Translation in Papillon (Ch. Boitet) The translation of examples, citations, definitions and glosses in the Papillon project.
M. Lafourcade (LIRMM & Ch. Boitet (GETA, CLIPS)LREC-02, Las Palmas, 31/5/ LREC-2002, Las Palmas, May 2002 Mathieur Lafourcade & Christian Boitet.
A roadmap for MT : four « keys » to handle more languages, for all kinds of tasks, while making it possible to improve quality (on demand) International.
Presentation transcript:

From Graph to Tree: Processing UNL Graphs Using an Existing MT System Etienne BLANC & Gilles SERASSET GETA, CLIPS-IMAG BP 53, F Grenoble cedex 09

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

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

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)

open he obj agt window He doesn’t open the window. [S] [/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

The lecturer read his paper. [S] 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

[S]; He knows that you will not come and regrets it. 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)

|-- 2:'ICL>DO' | |-- 4:'AGT>HUMAN' | |-- 5:'ICL>EVENT' | | |-- 8:'AGT>HUMAN' |-- 3:'SAVOIR' -----|-- 6:'°S01°' :'VENIR' |-- 9:'GOAL>PLACE' -- 1:'REGRETTER' ---| | !-- 10:'TU' | | | !-- 11:'IL' :'ICL>HUMAN' | |-- 13:'°S01°' !-- 14:'IL' :'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)

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