1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平.

Slides:



Advertisements
Similar presentations
Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
Advertisements

Translator Architecture Code Generator ParserTokenizer string of characters (source code) string of tokens abstract program string of integers (object.
Statistical NLP: Lecture 3
Lecture # 7 Chapter 4: Syntax Analysis. What is the job of Syntax Analysis? Syntax Analysis is also called Parsing or Hierarchical Analysis. A Parser.
GRAMMAR & PARSING (Syntactic Analysis) NLP- WEEK 4.
1 Statistical NLP: Lecture 12 Probabilistic Context Free Grammars.
LTAG Semantics on the Derivation Tree Presented by Maria I. Tchalakova.
The Query Compiler Varun Sud ID: 104. Agenda Parsing  Syntax analysis and Parse Trees.  Grammar for a simple subset of SQL  Base Syntactic Categories.
NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.
1 Introduction to Computability Theory Lecture5: Context Free Languages Prof. Amos Israeli.
Introduction to Semantics To be able to reason about the meanings of utterances, we need to have ways of representing the meanings of utterances. A formal.
1 A Tree Sequence Alignment- based Tree-to-Tree Translation Model Authors: Min Zhang, Hongfei Jiang, Aiti Aw, et al. Reporter: 江欣倩 Professor: 陳嘉平.
A Tree-to-Tree Alignment- based Model for Statistical Machine Translation Authors: Min ZHANG, Hongfei JIANG, Ai Ti AW, Jun SUN, Sheng LI, Chew Lim TAN.
PZ02A - Language translation
1 Learning Translation Templates from Bilingual Translation Examples Source: Applied Intelligence, 2001 Authors: Ilyas Cicekli and H. Altay Guvenir Reporter:
Extracting LTAGs from Treebanks Fei Xia 04/26/07.
Starting With Complex Primitives Pays Off: Complicate Locally, Simplify Globally ARAVIND K. JOSHI Department of Computer and Information Science and Institute.
Reference Book: Modern Compiler Design by Grune, Bal, Jacobs and Langendoen Wiley 2000.
MC-TAG, flexible composition, etc. ARAVIND K. JOSHI March
Specifying Languages CS 480/680 – Comparative Languages.
Probabilistic Parsing Ling 571 Fei Xia Week 5: 10/25-10/27/05.
Creation of a Russian-English Translation Program Karen Shiells.
(2.1) Grammars  Definitions  Grammars  Backus-Naur Form  Derivation – terminology – trees  Grammars and ambiguity  Simple example  Grammar hierarchies.
Grammars This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. To view a copy of this license, visit.
Chapter 2 Syntax A language that is simple to parse for the compiler is also simple to parse for the human programmer. N. Wirth.
The College of Saint Rose CIS 433 – Programming Languages David Goldschmidt, Ph.D. from Concepts of Programming Languages, 9th edition by Robert W. Sebesta,
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
Continuous Discontinuity in It-Clefts Introduction Tension between the two approaches Our proposal: TAG analysis Equative it-cleft: It was Ohno who won.
CISC 471 First Exam Review Game Questions. Overview 1 Draw the standard phases of a compiler for compiling a high level language to machine code, showing.
Winter 2007SEG2101 Chapter 71 Chapter 7 Introduction to Languages and Compiler.
Concordia University Department of Computer Science and Software Engineering Click to edit Master title style COMPILER DESIGN Review Joey Paquet,
1 Chapter 3 Describing Syntax and Semantics. 3.1 Introduction Providing a concise yet understandable description of a programming language is difficult.
PETRA – the Personal Embedded Translation and Reading Assistant Werner Winiwarter University of Vienna InSTIL/ICALL Symposium 2004 June 17-19, 2004.
Intro to NLP - J. Eisner1 Tree-Adjoining Grammar (TAG) One of several formalisms that are actually more powerful than CFG Note: CFG with features.
1 Natural Language Processing Lecture Notes 11 Chapter 15 (part 1)
CS 3240: Languages and Computation Context-Free Languages.
Joey Paquet, Lecture 12 Review. Joey Paquet, Course Review Compiler architecture –Lexical analysis, syntactic analysis, semantic.
Review 1.Lexical Analysis 2.Syntax Analysis 3.Semantic Analysis 4.Code Generation 5.Code Optimization.
Parsing Introduction Syntactic Analysis I. Parsing Introduction 2 The Role of the Parser The Syntactic Analyzer, or Parser, is the heart of the front.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Linguistic Essentials
Detection of Links between Words in the Task of Syntactic-Semantic Analysis of Russian Texts. Dmitry V. Merkuryev Saint-Petersburg State University, Russia.
Chapter 1 Introduction Major Data Structures in Compiler
Compiler Introduction 1 Kavita Patel. Outlines 2  1.1 What Do Compilers Do?  1.2 The Structure of a Compiler  1.3 Compilation Process  1.4 Phases.
Supertagging CMSC Natural Language Processing January 31, 2006.
LING 6520: Comparative Topics in Linguistics (from a computational perspective) Martha Palmer Jan 15,
CPSC 422, Lecture 27Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 27 Nov, 16, 2015.
Syntax and Semantics Form and Meaning of Programming Languages Copyright © by Curt Hill.
Handling Unlike Coordinated Phrases in TAG by Mixing Syntactic Category and Grammatical Function Carlos A. Prolo Faculdade de Informática – PUCRS CELSUL,
CS412/413 Introduction to Compilers Radu Rugina Lecture 13 : Static Semantics 18 Feb 02.
Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation Author: Mark Minas Presenter: Song Gu.
C H A P T E R T W O Linking Syntax And Semantics Programming Languages – Principles and Paradigms by Allen Tucker, Robert Noonan.
Chapter 5 Context-Free Languages Regular language are effective in describing certain simple patterns. But it is not enough to describe programming languages.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Presented by : A best website designer company. Chapter 1 Introduction Prof Chung. 1.
Chapter 3: Describing Syntax and Semantics
Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur
Statistical NLP: Lecture 3
Syntax Analysis Chapter 4.
CPE 480 Natural Language Processing
Lecture 2: General Structure of a Compiler
Chapter 2: A Simple One Pass Compiler
CS4705 Natural Language Processing
Linguistic Essentials
Syntax vs Semantics Backus-Naur Form Extended BNF Derivations
High-Level Programming Language
Tree-Adjoining Grammar (TAG)
Programming Languages 2nd edition Tucker and Noonan
A Link Grammar for an Agglutinative Language
Compiler design Review COMP 442/6421 – Compiler Design
Presentation transcript:

1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平

2/15 Introduction Advantage of TAG (Tree-adjoining grammar)  The domain of locality  The statements of dependencies and recursion possibilities in a tree are factored Synchronous TAGs  Characterize correspondences between languages

3/15 Synchronous TAGs The two TAGs are synchronous in the sense that adjunction and substitution operations are applied simultaneously to related nodes in pairs of trees, one for each language.  two languages: source and target languages (nondirectional) English and French  Example

4/15 A derivation step A derivation step from a pair of trees (α 1, α 2 )  Nondeterministically choose a link in the pair connecting two nodes (n 1 in α 1 and n 2 in α 2 )  Nondeterministically choose a pair of trees (β 1, β 2 ) in the grammar.  Form the resultant pair (β 1 (α 1,n 1 ), β 2 (α 2,n 2 ))

5/15 Example The tree pair α Nondeterministically choose a link in the pair connecting two nodes

6/15 Example Nondeterministically choose a pair of trees (β 1, β 2 ) in the grammar Form the resultant pair (β 1 (α 1,n 1 ), β 2 (α 2,n 2 ))

7/15 Example Nondeterministically choose a link in the pair connecting two nodes Nondeterministically choose a pair of trees (γ 1, γ 2 ) in the grammar

8/15 Example Form the resultant pair (γ 1 (α 1,n 1 ), γ 2 (α 2,n 2 )) Nondeterministically choose a pair of trees (δ 1, δ 2 ) and (ε 1, ε 2 ) in the grammar

9/15 Example Form the resultant pair (δ 1 (α 1,n 1 ), δ 2 (α 2,n 2 )) and (ε 1 (α 1,n 1 ), ε 2 (α 2,n 2 ))

10/15 Synchronous TAGs The arguments for factoring recursion and dependencies as TAGs do for the syntax of natural language have their counterparts in the semantics. the use of the synchronous TAG augmentation allows an even more radical reduction in the role of features in a TAG grammar.

11/15 Applications: Idioms Discontinuous syntactic constituents can be semantically localized. Nonstandard long-distance dependencies are statable without resort to reanalysis. Both frozen and flexible idioms can be easily characterized.

12/15 Applications: Quantifiers

13/15 Applications: Quantifiers

14/15 Using Synchronous TAGs Synchronous TAGs are inherently semantically monotonic. LTAG allow for more efficient parsing according to the semantic grammar and more efficient generation.  Context free grammars are not possible to require nontrivial semantics to be associated with each lexical item. Lexicalization of the syntactic grammar aids parsing, so lexicalization of the semantic grammar aids generation.

15/15 Conclusion Synchronous TAGs provide a simple mechanism that can be used to graft such an ability onto a base TAG formalism.