Rule Learning – Overview Goal: learn transfer rules for a language pair where one language is resource-rich, the other is resource-poor Learning proceeds.

Slides:

Advertisements

Similar presentations

YOSI! BLUE (30 sec play) Ball moves to X1 from X2

Advertisements

An Introduction to Calculus. Calculus Study of how things change Allows us to model real-life situations very accurately.

D x D V y 1 L x D L x 1 L x 2 V y 2 V y 3 xDxD y1y1 y2y2 x1x1 x2x2 y3y3 x3x3 y4y4 z.

O A Corpo 1 Cinemática e Cinética de Partículas no Plano e no Espaço Análise Dinâmica dos Corpos O X Y X1X1 Y1Y1 X2X2 Y2Y2 X3X3 Y3Y3 A B P l = 75 mm l.

1. 2 Memória (R-bit register) Circuito Combinatório D1D1 DRDR TRTR T1T1 X1X1 XLXL Y1Y1 YNYN clockreset MEF.

robot con 6 gradi di mobilità

Measurement of a Pond Basics of plane geometry Idea of the Coordinate Plane Confining an Area Practical skill Cooperation in the Group Lake measurement.

EOG Vocabulary Week of March 28, 2011 Math Words: Fractions and Properties.

Instructions for using this template. Remember this is Jeopardy, so where I have written Answer this is the prompt the students will see, and where I.

Constraint Programming Peter van Beek University of Waterloo.

Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.

Numerical Methods: Integration Department of Mathematics University of Leicester.

PROLOG MORE PROBLEMS.

INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.

Another example Max z=5x1+12x2+4x3-MR S.t. x1+2x2+x3+x4=10

CSci 4011 INHERENT LIMITATIONS OF COMPUTER PROGRAMS.

Intelligent Light Control using Sensor Networks Vipul Singhvi 1,3, Andreas Krause 2, Carlos Guestrin 2,3, Jim Garrett 1, Scott Matthews 1 Carnegie Mellon.

Inverting a Singly Linked List Instructor : Prof. Jyh-Shing Roger Jang Designer ： Shao-Huan Wang The ideas are reference to the textbook “Fundamentals.

Factoring Polynomials to Find Roots. Factoring a Polynomial to Find Roots Factor 3x x x x – 24 and find all of the roots. Roots: Factors:

On / By / With The building blocks of the Mplus language.

Rahnuma Islam Nishat Debajyoti Mondal Md. Saidur Rahman Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering.

Boolean Satisfiability The most fundamental NP-complete problem, and now a powerful technology for solving many real world problems.

Gradient of a straight line x y 88 66 44 2 44 4 For the graph of y = 2x  4 rise run  = 8  4 = 2 8 rise = 8 4 run = 4 Gradient = y.

Gamma-ray Large Area Space Telescope Efficiency Studies (Draft) Michael Kuss INFN Pisa Instrument Analysis Group Meeting 1 April 2005.

Efficient Algorithms via Precision Sampling Robert Krauthgamer (Weizmann Institute) joint work with: Alexandr Andoni (Microsoft Research) Krzysztof Onak.

LA TABLA DEL 5 5X1= 5X2= 5X3= 5X4= 5X5= 5X6= 5X7= 5X8= 5X9= 5X10=

2 x0 0 12/13/2014 Know Your Facts!. 2 x1 2 12/13/2014 Know Your Facts!

2 x /18/2014 Know Your Facts!. 11 x /18/2014 Know Your Facts!

Solving Linear Systems by Linear Combinations

2 x /10/2015 Know Your Facts!. 8 x /10/2015 Know Your Facts!

2.4 – Factoring Polynomials Tricky Trinomials The Tabletop Method.

Ken McMillan Microsoft Research

1 Lecture 5 PRAM Algorithm: Parallel Prefix Parallel Computing Fall 2008.

5 x4. 10 x2 9 x3 10 x9 10 x4 10 x8 9 x2 9 x4.

Parallel algorithms for expression evaluation Part1. Simultaneous substitution method (SimSub) Part2. A parallel pebble game.

DIRECTIONAL ARC-CONSISTENCY ANIMATION Fernando Miranda 5986/M

Linear Programming – Simplex Method: Computational Problems Breaking Ties in Selection of Non-Basic Variable – if tie for non-basic variable with largest.

CS 478 – Tools for Machine Learning and Data Mining Clustering: Distance-based Approaches.

The Problem of K Maximum Sums and its VLSI Implementation Sung Eun Bae, Tadao Takaoka University of Canterbury Christchurch New Zealand.

Multiplication Facts Practice

Parameter identifiability, constraints, and equifinality in data assimilation with ecosystem models Dr. Yiqi Luo Botany and microbiology department University.

A Case Study  Some Advice on How to Go about Solving Problems in Prolog  A Program to Play Connect-4 Game.

Spatial Information Systems (SIS) COMP Spatial data structures (1)

SATISFIABILITY Eric L. Frederich.

Variational Inference Amr Ahmed Nov. 6 th Outline Approximate Inference Variational inference formulation – Mean Field Examples – Structured VI.

Computational Facility Layout

Shannon Expansion Given Boolean expression F = w 2 ’ + w 1 ’w 3 ’ + w 1 w 3 Shannon Expansion of F on a variable, say w 2, is to write F as two parts:

Graeme Henchel Multiples Graeme Henchel

Low Power and Low Area Transform–Quant & Inverse Quant–Inverse Transform Hardware Design for H.264 Encoder.

Quiz Number 2 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit Jose Lopez Rosele Lynn Dave Neal Deyanira Pena Professor Kenneth D. Lawerence New.

The Project Problem formulation (one page) Literature review –“Related work" section of final paper, –Go to writing center, –Present paper(s) to class.

Susan Van Geest Artwork. Altar I: Centrality of Being Marble 1.5’x1.5’x1.5’

XDI RDF Cell Graphs V This document introduces a notation for graphing XDI RDF statements called cell graphing. The motivation is to have an.

(for Prof. Oleg Shpyrko)

0 x x2 0 0 x1 0 0 x3 0 1 x7 7 2 x0 0 9 x0 0.

Simplex (quick recap). Replace all the inequality constraints by equalities, using slack variables.

Adding & Subtracting Mixed Numbers. Objective: To develop fluency in +, –, x, and ÷ of non-negative rational numbers. Essential Question: How.

Enabling MT for Languages with Limited Resources Alon Lavie Language Technologies Institute Carnegie Mellon University.

Automatic Rule Learning for Resource-Limited Machine Translation Alon Lavie, Katharina Probst, Erik Peterson, Jaime Carbonell, Lori Levin, Ralf Brown Language.

Semi-Automatic Learning of Transfer Rules for Machine Translation of Low-Density Languages Katharina Probst April 5, 2002.

Rule Learning - Overview Goal: Syntactic Transfer Rules 1) Flat Seed Generation: produce rules from word- aligned sentence pairs, abstracted only to POS.

Transfer-based MT with Strong Decoding for a Miserly Data Scenario Alon Lavie Language Technologies Institute Carnegie Mellon University Joint work with:

October 10, 2003BLTS Kickoff Meeting1 Transfer with Strong Decoding Learning Module Transfer Rules {PP,4894} ;;Score: PP::PP [NP POSTP] -> [PREP.

CMU MilliRADD Small-MT Report TIDES PI Meeting 2002 The CMU MilliRADD Team: Jaime Carbonell, Lori Levin, Ralf Brown, Stephan Vogel, Alon Lavie, Kathrin.

AVENUE: Machine Translation for Resource-Poor Languages NSF ITR

Semi-Automatic Learning of Transfer Rules for Machine Translation of Minority Languages Katharina Probst Language Technologies Institute Carnegie Mellon.

Enabling MT for Languages with Limited Resources Alon Lavie and Lori Levin Language Technologies Institute Carnegie Mellon University.

The AVENUE Project: Automatic Rule Learning for Resource-Limited Machine Translation Faculty: Alon Lavie, Jaime Carbonell, Lori Levin, Ralf Brown Students:

Faculty: Alon Lavie, Jaime Carbonell, Lori Levin, Ralf Brown Students:

Presentation transcript:

Rule Learning – Overview Goal: learn transfer rules for a language pair where one language is resource-rich, the other is resource-poor Learning proceeds in three steps: 1.Flat Seed Generation: informed guessing of transfer rules 2.Compositionality: adding structure to rules, using previously learned rules 3.Seeded Version Space Learning: generalizing rules to make them scale to more unseen examples

S::S [det adv adj n aux neg v det n] [det adv adj n v det n neg vpart] (;;alignments: (x1:y1)(x2::y2)(x3::y3)(x4::y4)(x6::y8)(x7::y5)(x7::y9)(x8::y6)(x9::y7)) ;;constraints: ((x1 def) = *+) ((x4 agr) = *3-sing) ((x5 tense) = *past) …. ((y1 def) = *+) ((y3 case) = *nom) ((y4 agr) = *3-sing) …. ) The highly qualified applicant did not accept the offer. Der äußerst qualifizierte Bewerber nahm das Angebot nicht an. ((1,1),(2,2),(3,3),(4,4),(6,8),(7,5),(7,9),(8,6),(9,7)) Flat Seed Generation - Example

S::S [det adv adj n aux neg v det n] [det adv adj n v det n neg vpart] (;;alignments: (x1:y1)(x2::y2)(x3::y3)(x4::y4)(x6::y8)(x7::y5)(x7::y9)(x8::y6)(x9::y7) ;;constraints: ((x1 def) = *+) ((x4 agr) = *3-sing) ((x5 tense) = *past) …. ((y1 def) = *+) ((y3 case) = *nom) ((y4 agr) = *3-sing) …. ) S::S [NP aux neg v det n] [NP v det n neg vpart] (;;alignments: (x1::y1)(x3::y5)(x4::y2)(x4::y6)(x5::y3)(x6::y4) ;;constraints: ((x2 tense) = *past) …. ((y1 def) = *+) ((y1 case) = *nom) …. ) NP::NP [det AJDP n] [det ADJP n] ((x1::y1)… ((y3 agr) = *3-sing) ((x3 agr = *3-sing) ….) Compositionality - Example

S::S [NP aux neg v det n] [NP v det n neg vpart] (;;alignments: (x1::y1)(x3::y5)(x4::y2)(x4::y6)(x5::y3)(x6::y4) ;;constraints: ((x2 tense) = *past) …. ((y1 def) = *+) ((y1 case) = *nom) ((y1 agr) = *3-sing) … ) ((y3 agr) = *3-sing) ((y4 agr) = *3-sing)… ) S::S [NP aux neg v det n] [NP v det n neg vpart] (;;alignments: (x1::y1)(x3::y5)(x4::y2)(x4::y6)(x5::y3)(x6::y4) ;;constraints: ((x2 tense) = *past) … ((y1 def) = *+) ((y1 case) = *nom) ((y1 agr) = *3-plu) … ((y3 agr) = *3-plu) ((y4 agr) = *3-plu)… ) S::S [NP aux neg v det n] [NP n det n neg vpart] ( ;;alignments: (x1::y1)(x3::y5) (x4::y2)(x4::y6) (x5::y3)(x6::y4) ;;constraints: ((x2 tense) = *past) … ((y1 def) = *+) ((y1 case) = *nom) ((y4 agr) = (y3 agr)) … ) Seeded Version Space Learning - Example

Remaining Research Issues Improvement of existing algorithms Reversal of translation direction Learning with less information on the resource-poor language Learning from an unstructured corpus