Ling 3701H / Psych 3371H: Lecture Notes 9 Hierarchic Sequential Prediction

Similar documents
NON-DETERMINISTIC FSA

Automatic Synthesis of New Behaviors from a Library of Available Behaviors

Chapter 4 State-Space Planning

Alpha Algorithm: Limitations

CS 573 Automata Theory and Formal Languages

Lecture 27: Diffusion of Ions: Part 2: coupled diffusion of cations and

Vectors. a Write down the vector AB as a column vector ( x y ). A (3, 2) x point C such that BC = 3. . Go to a OA = a

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Alpha Algorithm: A Process Discovery Algorithm

Learning Partially Observable Markov Models from First Passage Times

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS241 Week 6 Tutorial Solutions

Introduction to Olympiad Inequalities

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Bisimulation, Games & Hennessy Milner logic

Part 4. Integration (with Proofs)

Finite State Automata and Determinisation

THE PYTHAGOREAN THEOREM

CS 275 Automata and Formal Language Theory

Hyers-Ulam stability of Pielou logistic difference equation

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

Pre-Lie algebras, rooted trees and related algebraic structures

Symmetrical Components 1

Lecture Notes No. 10

The Word Problem in Quandles

ANALYSIS AND MODELLING OF RAINFALL EVENTS

Lecture 2: Cayley Graphs

Nondeterministic Finite Automata

Exercise 3 Logic Control

CSE 401 Compilers. Today s Agenda

Nondeterministic Automata vs Deterministic Automata

Spacetime and the Quantum World Questions Fall 2010

8 THREE PHASE A.C. CIRCUITS

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

Bayesian Networks: Approximate Inference

Section 4.4. Green s Theorem

Uses of transformations. 3D transformations. Review of vectors. Vectors in 3D. Points vs. vectors. Homogeneous coordinates S S [ H [ S \ H \ S ] H ]

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Test Generation from Timed Input Output Automata

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Maintaining Mathematical Proficiency

More Properties of the Riemann Integral

IN RECENT YEARS, the number of publications on evolutionary

Polynomials. Polynomials. Curriculum Ready ACMNA:

Section 1.3 Triangles

Electromagnetism Notes, NYU Spring 2018

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

Figure 1. The left-handed and right-handed trefoils

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

@#? Text Search ] { "!" Nondeterministic Finite Automata. Transformation NFA to DFA and Simulation of NFA. Text Search Using Automata

Algebra Basics. Algebra Basics. Curriculum Ready ACMNA: 133, 175, 176, 177, 179.

XML and Databases. Outline. 1. Top-Down Evaluation of Simple Paths. 1. Top-Down Evaluation of Simple Paths. 1. Top-Down Evaluation of Simple Paths

Linear Algebra Introduction

Chapter 8 Roots and Radicals

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000

Lecture 6: Coding theory

CS 360 Exam 2 Fall 2014 Name

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

CS 491G Combinatorial Optimization Lecture Notes

Arrow s Impossibility Theorem

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

1B40 Practical Skills

Data Structures and Algorithm. Xiaoqing Zheng

MATRIX INVERSE ON CONNEX PARALLEL ARCHITECTURE

Algorithm Design and Analysis

Petri Nets. Rebecca Albrecht. Seminar: Automata Theory Chair of Software Engeneering

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree

Génération aléatoire uniforme pour les réseaux d automates

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS

GM1 Consolidation Worksheet

Compiler Design. Spring Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7

Fast index for approximate string matching

Prefix-Free Regular-Expression Matching

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Algorithm Design and Analysis

CS 188: Artificial Intelligence Fall Announcements

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

Revision Sheet. (a) Give a regular expression for each of the following languages:

AVL Trees. D Oisín Kidney. August 2, 2018

Behavior Composition in the Presence of Failure

Optimizing the Nominal Introduction Rule in (Hyper)Tableau Calculi

Nondeterminism and Nodeterministic Automata

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int

Convert the NFA into DFA

1 This diagram represents the energy change that occurs when a d electron in a transition metal ion is excited by visible light.

12.4 Similarity in Right Triangles

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Bottom-Up Parsing. Canonical Collection of LR(0) items. Part II

Transcription:

Ling 3701H / Psyh 3371H: Leture Notes 9 Hierrhi Sequentil Predition Contents 9.1 Complex events.................................... 1 9.2 Reognition of omplex events using event frgments................ 2 9.3 Reognition Model.................................. 2 9.4 Exmple reognition y hierrhi sequentil predition.............. 4 9.5 Prtie........................................ 6 Lnguge proessing my e sed on domin-generl omplex event predition. This uses memory nd generliztion (lerning) to reognize omplex events (plns). (Rell tht events my e represented in the rin s elementry preditions. We will ssume events re lso onneted y elementry preditions of ustion.) 9.1 Complex events Events n ontin hierrhies of suevents, espeilly omplex plns (omplex ides): nts-in-mouth nts-on-stik stik-in-mouth nts-in-nthill stik-in-nthill stik-in-fingers fingers-in-nthill rnh-in-fingers...... rnh-in-fingers twig-wy-from-rnh hnd-on-twig hnd-wy-from-rnh Su-events re relted to prent events y use elementry preditions. When similr (reognition) opertions re nested inside other opertions, proess is lled reursive. 1

9.2 Reognition of omplex events using event frgments Humns nd (some) nimls n reognize nd re-rete omplex hierrhi events. [Fuster, 1990, otvinik, 2007] Prtil sequenes of events n e grouped nd stored s event frgments /, where: is predited whole pex top-level event or su-event, is n expeted prt se su-event / oserved event yet to ome, whih ompletes the whole. E.g. nts-in-nthill n e ounted s nts-on-stik/stik-in-nthill. Use ued ssoition ( ) to diretly link n individul expettion to supported predition. Ner-omplete su-events n e hined together to sve memory: E.g. nts-on-stik/stik-in-nthill nd stik-in-fingers form nts-on-stik/fingers-in-nthill. When reent event frgment is ompleted, it n e dded to n erlier event frgment. E.g. if stik-in-fingers is omplete, it n stisfy stik-in-nthill with fingers-in-nthill expeted. Use ued ssoition ( ) to diretly link n individul predition to preeding expettion. Unertinty out events my e modeled using superposed tivtion vetors, desried erlier. 9.3 Reognition Model This model mintins sequene of event frgments essile from the urrent expettion : E.g. / is nts-on-stik/stik-in-nthill, / is stik-in-fingers/twig-wy-from-rnh. Cruilly, this store n only e few elements long efore interferene uses troule. The model lso ssumes set of lerned predition rules: 2

E.g. nts-on-stik () is omposed of nts-in-nthill () followed y stik-in-nthill (). Here,,, nd might e onneted y use elementry predition (mgent lines). First, distinguish frontier (simple, oserved) nd juntion (omplex, hidden) events: nts-in-mouth nts-on-stik stik-in-mouth nts-in-nthill stik-in-nthill stik-in-fingers fingers-in-nthill rnh-in-fingers...... rnh-in-fingers twig-wy-from-rnh hnd-on-twig hnd-wy-from-rnh Complex ides n now e ssemled y onneting oserved events to event frgments... Frontier deision (dd oserved event nd onnet to existing event frgment, or don t): Yes-mth outome (set urrent predition): No-mth outome (hek types, store ued ssoition from to, set urrent predition): Juntion deision (pply predition rule nd onnet resulting event frgment, or don t): 3

Yes-mth outome (hek types, pply rule, store ued ssoition from to ): No-mth outome (pply rule, store ued ssoition from to nd to : Mthing n e implemented in simple neurl networks, generlized y proedurl lerning. These opertions n reognize ny rnhing event struture using minimum mount of memory. 9.4 Exmple reognition y hierrhi sequentil predition Here is n exmple of reognizing omplex pln from oservtions. Strt with oservtion of nthill, predit nts on stik 1, nd expet stik in the nthill 1 : nts-in-nthill 1 nts-on-stik 1 stik-in-nthill Perhps other preditions nd expettions, like pushing over the nthill, re lso superposed t 1. 4

Then fork oservtion of rnh 2, predit stik 2 ; don t join, leving new event frgment: nts-in-nthill 1 nts-on-stik 2 rnh-in-fingers 2 stik-in-fingers 1 stik-in-nthill 2 twig-wy-from-rnh Then fork off oservtion out gring twig 3, nd join it to the previous event frgment: nts-in-nthill 1 nts-on-stik 2 1 stik-in-nthill 2 stik-in-fingers 3 twig-wy-from-rnh rnh-in-fingers 3 hnd-on-twig 3 hnd-wy-from-rnh Then don t fork oservtion 4 to omplete 2, nd join it to the previous event frgment, leving only one event frgment: nts-in-nthill 2 1 nts-on-stik 2 rnh-in-fingers 3 hnd-on-twig 4 stik-in-nthill stik-in-fingers 3 twig-wy-from-rnh 4 hnd-wy-from-rnh 4 fingers-in-nthill 5

Then don t fork fingers t nthill 5, predit nts in mouth 5, expet stik in mouth 5 : nts-in-nthill 2 1 nts-on-stik 2 rnh-in-fingers 3 hnd-on-twig 4 stik-in-nthill stik-in-fingers 3 twig-wy-from-rnh 5 nts-in-mouth 4 hnd-wy-from-rnh 5 fingers-in-nthill 5 stik-in-mouth The struture of rule pplitions over time n e drwn s tree: 9.5 Prtie ssume the following omplex event is eing reognized: seed-on-rok nut-on-rok...... stone-in-hnd stone-to-nut hnd-to-nut nd the following event frgments exist fter the oservtion of nut-on-rok: nut-on-rok 1 seed-on-rok 1 stone-to-nut Drw the event frgments tht would exist fter the oservtion of stone-in-hnd. Whih opertions on frontier nd juntion nodes re used to proess this oservtion? 6

Referenes [otvinik, 2007] otvinik, M. (2007). Multilevel struture in ehvior nd in the rin: omputtionl model of Fuster s hierrhy. Philosophil Trnstions of the Royl Soiety, Series : iologil Sienes, 362:1615 1626. [Fuster, 1990] Fuster, J. M. (1990). ehviorl eletrophysiology of the prefrontl ortex of the primte. Progress in rin Reserh, 85:313 324. 7