1 Recursive Transition Networks Allen ’ s Chapters 3 J&M ’ s Chapter 10.

Slides:



Advertisements
Similar presentations
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Advertisements

Finite State Automata. A very simple and intuitive formalism suitable for certain tasks A bit like a flow chart, but can be used for both recognition.
Augmented Transition Networks
Chapter 9 Pointers and Dynamic Arrays. Overview 9.1 Pointers 9.2 Dynamic Arrays.
1 Unification Grammars Allen ’ s Chapter 4 J&M ’ s Chapter 11.
Analysis of programs with pointers. Simple example What are the dependences in this program? Problem: just looking at variable names will not give you.
1 Natural Language Processing Lecture 7 Unification Grammars Reading: James Allen NLU (Chapter 4)
1 Chapter Chapter 5 Grammars for Natural Language 5.1 Auxiliary Verbs and Verb Phrases 5.2 Movement Phenomena in Language 5.3 Handling Questions in Context-Free.
Natural Language Understanding Understanding NL (infinite language) means determining the meaning of the sentence with respect to contest in which it is.
1 Features and Augmented Grammars Allen ’ s Chapter 4 J&M ’ s Chapter 11.
1 Auxiliary Verbs and Movement Phenomena Allen ’ s Chapter 5 J&M ’ s Chapter 11.
COMP 4060 Natural Language Processing Using Features.
1 Pertemuan 22 Natural Language Processing Syntactic Processing Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/2.
LING 364: Introduction to Formal Semantics Lecture 9 February 9th.
Parsing: Features & ATN & Prolog By
Amirkabir University of Technology Computer Engineering Faculty AILAB Parsing Ahmad Abdollahzadeh Barfouroush Aban 1381 Natural Language Processing Course,
Artificial Intelligence 2005/06 Features, Gaps, Movement Questions and Passives.
© The McGraw-Hill Companies, 2006 Chapter 5 Arrays.
1 CONTEXT-FREE GRAMMARS. NLE 2 Syntactic analysis (Parsing) S NPVP ATNNSVBD NP AT NNthechildrenate thecake.
Fall 2004 Lecture Notes #5 EECS 595 / LING 541 / SI 661 Natural Language Processing.
Natural Language Processing Features Passives Questions Gaps Movement.
Context Free Grammar S -> NP VP NP -> det (adj) N
1 CSC 594 Topics in AI – Applied Natural Language Processing Fall 2009/ Outline of English Syntax.
Computational Grammars Azadeh Maghsoodi. History Before First 20s 20s World War II Last 1950s Nowadays.
Natural Language Processing
Chapter 7 Methods: A Deeper Look Visual C# 2010 How to Program © by Pearson Education, Inc. All Rights Reserved.
Syntax 3: Back to State Networks... Recursive Transition Networks John Barnden School of Computer Science University of Birmingham Natural Language Processing.
1 Contents. 2 Run-Time Storage Organization 3 Static Allocation In many early languages, notably assembly and FORTRAN, all storage allocation is static.
Syntax Nuha AlWadaani.
1 Semantics Interpretation Allen ’ s Chapter 9 J&M ’ s Chapter 15.
Compiler Construction 1. Objectives Given a context-free grammar, G, and the grammar- independent functions for a recursive-descent parser, complete the.
1 CS 385 Fall 2006 Chapter 14 Understanding Natural Language (omit 14.4)
1.Syntax: the rules of sentence formation; the component of the mental grammar that represent speakers’ knowledge of the structure of phrase and sentence.
CSCI 130 Scope of Variables Chapter 6. What is scope Parts of program which can access a variable –accessibility –visibility How long variable takes up.
1 Natural Language Processing Lecture 11 Efficient Parsing Reading: James Allen NLU (Chapter 6)
Object-Oriented Programming (OOP). Implementing an OOD in Java Each class is stored in a separate file. All files must be stored in the same package.
Chapter 15 Natural Language Processing (cont)
LING 388: Language and Computers Sandiway Fong Lecture 26 11/22.
10. Parsing with Context-free Grammars -Speech and Language Processing- 발표자 : 정영임 발표일 :
Context-Free Parsing Read J & M Chapter 10.. Basic Parsing Facts Regular LanguagesContext-Free Languages Required Automaton FSMPDA Algorithm to get rid.
Objectives - 11  We will work with processing Arrays.  Objectives:  Describe the concept of an array and its benefits.  Define the terms index, traverse,
PHRASE STRUCTURE GRAMMARS RTNs ATNs Augmented phrase structure rules / trees.
LING 388: Language and Computers Sandiway Fong Lecture 13.
11 Chapter 14 Part 1 Statistical Parsing Based on slides by Ray Mooney.
LING/C SC/PSYC 438/538 Lecture 26 Sandiway Fong. Administrivia 538 Presentations – Send me your choices if you haven’t already Thanksgiving Holiday –
Transition Network Grammars for Natural Language Analysis - W. A. Woods In-Su Yoon Pusan National University School of Electrical and Computer Engineering.
For Wednesday Read chapter 23 Homework: –Chapter 22, exercises 1,4, 7, and 14.
Interpreting Language (with Logic)
LING 388: Language and Computers Sandiway Fong Lecture 12.
1 Definite Clause Grammars for Language Analysis – A Survey of the Formalism and a Comparison with Augmented Transition Networks 인공지능 연구실 Hee keun Heo.
The man bites the dog man bites the dog bites the dog the dog dog Parse Tree NP A N the man bites the dog V N NP S VP A 1. Sentence  noun-phrase verb-phrase.
1 Natural Language Processing Lectures 8-9 Auxiliary Verbs Movement Phenomena Reading: James Allen NLU (Chapter 5)
1 Natural Language Processing Lecture 6 Features and Augmented Grammars Reading: James Allen NLU (Chapter 4)
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
Syntax II. Specifiers Specifiers tell us more information about nouns, verbs, adjectives, adverbs and prepositions The, a, this, three, some, many etc.
Natural Language Processing Vasile Rus
Lecture 4b: Verb Processes
Ch. 4 – Semantic Analysis Errors can arise in syntax, static semantics, dynamic semantics Some PL features are impossible or infeasible to specify in grammar.
Chapter Eight Syntax.
Part I: Basics and Constituency
Using local variable without initialization is an error.
TREE ADJOINING GRAMMAR
Chapter Eight Syntax.
Self-Assessment of Chapter 1 Limits and Continuity
The University of Texas Rio Grande Valley
CSCI 3328 Object Oriented Programming in C# Chapter 3: Introduction to Classes and Objects – Exercises UTPA – Fall 2012 This set of slides is revised.
The University of Texas – Pan American
Lab 6 Introduction to grammars Vectors in C++ Lab Exercise.
1.4 ทบทวน JAVA OO Programming Concepts Declaring and Creating Objects
Chapter Equations of Circles.
Presentation transcript:

1 Recursive Transition Networks Allen ’ s Chapters 3 J&M ’ s Chapter 10

2 Recursive Transition Networks

3 RTN Arc Types

4 The metal can was dark blue

5 1 The 2 metal 3 can 4 was 5 dark 6 blue 7

6

7

8

9 Augmented Transition Networks Allen ’ s Chapters 4 J&M ’ s Chapter 20

10 Augmented Transition Networks An augmented transition network (ATN) is a recursive transition network that can perform tests and take actions during arc transitions. An ATN uses a set of registers to store information. A set of actions is defined for each arc, and the actions can look at and modify the registers. An arc may have a test associated with it. The arc is traversed (and its action is taken) only if the test succeeds. When a lexical arc is traversed, it is put in a special variable (*) that keeps track of the current word.

11 An ATN for NP

12 An ATN for S

13 1 the 2 dog 3 saw 4 Jack 5

14 An ATN Grammar for Simple Declarative Statements

15 The NP Network

16 The PP Network

17 Register Presetting Register Presetting  Parameter Passing vp:inf Mary wants to have a party. _np_vp:inf Mary wants John to have a party. Register VFORM of VP Graph should be preset to inf