Lexical entries & clauses

Size: px
Start display at page:

Download "Lexical entries & clauses"

Transcription

1 Lexical entries & clauses 2013 Jan 18

2 The problem The inadequacy of PS-rules a. * John devoured. John fainted. b. * Cezanne fainted the apple. Cezanne painted the apple. c. * John ate the apple the pear. John gave the woman the apple.

3 A lexical entry for fox phonology faks definition member of one of many Canidae species cat count +

4 The plan 1 Augment lexical entries with something we call an argument structure, which represents the meaning of an open class word as a predicate, and identifies the roles and grammatical functions of the predicate s arguments. 2 The argument structure of a predicate constrains lexical insertion Lexical Insertion S a P dog VP V walks

5 Argument structure sing [ ] agent slap [ ] agent, goal love [ ] experiencer, stimulus give [ ] agent, theme, recipient

6 Subcategorization sing agent slap agent, goal obj love experiencer, stimulus obj give agent, theme, recipient obj obl agent, theme, recipient obj2 obj

7 Valence alternation I a. John ate the apple. John ate. b. John devoured the apple. * John devoured. c. John is melting the snow. The snow is melting. eat agent, patient (obj) devour agent, patient obj melt 1 agent, theme obj melt 2 agent

8 Valence alternation II a. John gave Mary his old radio. John gave his old radio to Mary. b. John made the log into a canoe. John made a canoe out of the log. give agent, theme, recipient obj obl give agent, theme, recipient obj2 obj make agent, source, patie obj obl make agent, source, patie obl obj

9 Amendments Lexical Insertion S S a P dog v walks agent a np dog v walks agent

10 Principles for annotated PS-rules S np v (np) ( np ) ( pp ) obj obj2 obl Well-formedness a. completeness: Every obligatory Grammatical Relation in the subcategorization of a Verb must be assigned to a clausemate of the Verb. b. coherence: Every non-adjunct Grammatical Relation assigned to a clausemate of a verb V must be present in the subcategorization of V. c. uniqueness: o Grammatical Relation assigned more than once by a single verb.

11 Violations I Completeness S the np dog v devours agent, patient obj

12 Violations II Coherence S the np boy v faints agent the np obj dog

13 Violations III Uniqueness S the np dog v devours agent, patient obj the np obj bone the np obj steak

14 Uniqueness in English a. o new principle is really needed to rule the sentence on the previous slide. The PS-rule already SAYS there can be only one object: S np v (np) ( np ) ( pp ) obj obj2 obl b. This is because, for the simple examples we ve looked at, English does not really require a uniqueness principle. For simple clauses with canonical word order, it generally assigns unique phrase structure positions for the argument grammatical functions. c. Other languages don t work this way. In case marking languages with free word order, for example, there is no single phrase structure position assigned to ects. The uniqueness principle has some bite. d. Also in more complicated English sentences, with movement (raising, Wh-questions), the uniqueness principle has bite.

Introduction to Lexical Functional Grammar. Wellformedness conditions on f- structures. Constraints on f-structures

Introduction to Lexical Functional Grammar. Wellformedness conditions on f- structures. Constraints on f-structures Introduction to Lexical Functional Grammar Session 8 f(unctional)-structure & c-structure/f-structure Mapping II & Wrap-up Summary of last week s lecture LFG-specific grammar rules (i.e. PS-rules annotated

More information

Grammar Development with LFG and XLE. Miriam Butt University of Konstanz

Grammar Development with LFG and XLE. Miriam Butt University of Konstanz Grammar Development with LFG and XLE Miriam Butt University of Konstanz Last Time Integration of a Finite-State Morphological Analyzer - Sublexical Rules - Sublexical Entries - The -unknown entry The XLE

More information

Syntax 380L December 4, Wh-Movement 2. For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout.

Syntax 380L December 4, Wh-Movement 2. For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout. Syntax 380L December 4, 2001 Wh-Movement 2 For notational convenience, I have used traces (t i,t j etc.) to indicate copies throughout this handout. 1 The Basics of wh-movement (1) Who i does John think

More information

Grammar Development with LFG and XLE. Miriam Butt University of Konstanz

Grammar Development with LFG and XLE. Miriam Butt University of Konstanz Grammar Development with LFG and XLE Miriam Butt University of Konstanz Last Time Verbal Complements: COMP and XCOMP - Finite Complements - Subject vs. Object Control in XCOMPs - Control Equations in lexical

More information

A Brief Incomplete Introduction to NLTK

A Brief Incomplete Introduction to NLTK A Brief Incomplete Introduction to NLTK This introduction ignores and simplifies many aspects of the Natural Language TookKit, focusing on implementing and using simple context-free grammars and lexicons.

More information

AUTOMATIC LFG GENERATION

AUTOMATIC LFG GENERATION AUTOMATIC LFG GENERATION MS Thesis for the Degree of Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science (Computer Science) at the National University of Computer and

More information

Wh-questions. Ling 567 May 9, 2017

Wh-questions. Ling 567 May 9, 2017 Wh-questions Ling 567 May 9, 2017 Overview Target representation The problem Solution for English Solution for pseudo-english Lab 7 overview Negative auxiliaries interactive debugging Wh-questions: Target

More information

Semantics and Generative Grammar. Expanding Our Formalism, Part 2 1. These more complex functions are very awkward to write in our current notation

Semantics and Generative Grammar. Expanding Our Formalism, Part 2 1. These more complex functions are very awkward to write in our current notation Expanding Our Formalism, Part 2 1 1. Lambda Notation for Defining Functions A Practical Concern: Most expressions of natural language will have some kind of function as their extension... These more complex

More information

The anatomy of a syntax paper

The anatomy of a syntax paper The anatomy of a syntax paper Seminar week 4: Understanding the Theory of Syntax, Summer 2014 Asad Sayeed Uni-Saarland Asad Sayeed (Uni-Saarland) The anatomy of a syntax paper 1 There is a special secret

More information

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets:

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets: L322 Syntax Chapter 3: Structural Relations Linguistics 322 1 The Parts of a Tree A tree structure is one of an indefinite number of ways to represent a sentence or a part of it. Consider the following

More information

Context-Free Grammars. Carl Pollard Ohio State University. Linguistics 680 Formal Foundations Tuesday, November 10, 2009

Context-Free Grammars. Carl Pollard Ohio State University. Linguistics 680 Formal Foundations Tuesday, November 10, 2009 Context-Free Grammars Carl Pollard Ohio State University Linguistics 680 Formal Foundations Tuesday, November 10, 2009 These slides are available at: http://www.ling.osu.edu/ scott/680 1 (1) Context-Free

More information

Argument Structures and Semantic Roles: Actual State in ISO TC37/SC4 TDG 3

Argument Structures and Semantic Roles: Actual State in ISO TC37/SC4 TDG 3 ISO/TC 37/SC 4 N280 Argument Structures and Semantic Roles: Actual State in ISO TC37/SC4 TDG 3 Thierry Declerck (DFKI), joined work with Mandy Schiffrin (Tilburg) Possible Definition of Semantic Roles

More information

The Verb. From Probabilities to Internal Categories. Cem Bozşahin. Cognitive Science Department, The Informatics Institute, ODTÜ

The Verb. From Probabilities to Internal Categories. Cem Bozşahin. Cognitive Science Department, The Informatics Institute, ODTÜ The Verb From Probabilities to Internal Categories Cem Bozşahin bozsahin@metu.edu.tr Cognitive Science Department, The Informatics Institute, ODTÜ November 18, 2016 Joint work with Mark Steedman (with

More information

Computational Linguistics: Feature Agreement

Computational Linguistics: Feature Agreement Computational Linguistics: Feature Agreement Raffaella Bernardi Contents 1 Admin................................................... 4 2 Formal Grammars......................................... 5 2.1 Recall:

More information

Context-Free Grammars

Context-Free Grammars Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 3, 2012 (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b. N is a

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1

Proseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1 1. Statement of the Problem, Outline of the Solution to Come (1) The Key Problem There is much to recommend an algebraic

More information

The Earley Parser

The Earley Parser The 6.863 Earley Parser 1 Introduction The 6.863 Earley parser will work with any well defined context free grammar, including recursive ones and those containing empty categories. It can use either no

More information

ASSOCIATIVE NETS AND FRAME SYSTEMS

ASSOCIATIVE NETS AND FRAME SYSTEMS ASSOCIATIVE NETS AND FRAME SYSTEMS Network Representations If L is a set of labeled links and N is a set of nodes, then a network is any subset of N L N, where the order of the triples is material. Lecture

More information

Research Seminar The syntax and semantics of questions Spring 1999 February 16, 1999 Week 3: Introduction to the semantics of questions

Research Seminar The syntax and semantics of questions Spring 1999 February 16, 1999 Week 3: Introduction to the semantics of questions 050.822 Research Seminar The syntax and semantics of questions Spring 1999 February 16, 1999 Paul Hagstrom Week : Introduction to the semantics of questions The Semantics of Questions (Hamblin 1958) The

More information

Ling/CSE 472: Introduction to Computational Linguistics. 5/9/17 Feature structures and unification

Ling/CSE 472: Introduction to Computational Linguistics. 5/9/17 Feature structures and unification Ling/CSE 472: Introduction to Computational Linguistics 5/9/17 Feature structures and unification Overview Problems with CFG Feature structures Unification Agreement Subcategorization Long-distance Dependencies

More information

Unification in Unification-based Grammar

Unification in Unification-based Grammar THE SIXTH JAPANESE-KOREAN JOINT CONFERENCE ON FORMAL LINGUISTICS,1991 Unification in Unification-based Grammar K.S.Choi, D.J.Son, and G.C.Kim Department of Computer Science Korea Advanced Institute of

More information

LING 130: Quantified Noun Phrases

LING 130: Quantified Noun Phrases LING 130: Quantified Noun Phrases James Pustejovsky March 15, 2010 1 Syntax for Typed λ-calculus We will now present a language which uses specific types of entities, where the entities are combined with

More information

A Lattice Based Algebraic Model for Verb Centered Constructions

A Lattice Based Algebraic Model for Verb Centered Constructions A Lattice Based Algebraic Model for Verb Centered Constructions Bálint Sass Research Institute for Linguistics, Hungarian Academy of Sciences sass.balint@nytud.mta.hu Abstract. In this paper we present

More information

STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH

STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH Slide 3.1 3 STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 3.0 Introduction 3.1 Graph Theory 3.2 Strategies for State Space Search 3.3 Using the State Space to Represent Reasoning with the Predicate

More information

Logic and Natural Language Semantics: Formal Semantics

Logic and Natural Language Semantics: Formal Semantics Logic and Natural Language Semantics: Formal Semantics Raffaella Bernardi DISI, University of Trento e-mail: bernardi@disi.unitn.it Contents 1 Logic....................................................

More information

LING 364: Introduction to Formal Semantics. Lecture 7 February 2nd

LING 364: Introduction to Formal Semantics. Lecture 7 February 2nd LING 364: Introduction to Formal Semantics Lecture 7 February 2nd Administrivia today (3:30pm 4:40pm) lecture here in Comm 214 (4:45pm 5:45pm) (EXTRA) lab practice in Social Sciences Lab 224 also next

More information

A Minimal GB Parser. Marwan Shaban. October 26, Boston University

A Minimal GB Parser. Marwan Shaban. October 26, Boston University A Minimal GB Parser Marwan Shaban shaban@cs.bu.edu October 26, 1993 BU-CS Tech Report # 93-013 Computer Science Department Boston University 111 Cummington Street Boston, MA 02215 Abstract: We describe

More information

LING 510, Lab 3 September 23, 2013

LING 510, Lab 3 September 23, 2013 LING 510, Lab 3 September 23, 2013 Agenda: Go over Homework 1 Go over JYW, if there are questions Go over function application (what we ended with on Thursday) 1. Frequently missed questions on Homework

More information

Optional Arguments in Abstract Categorial Grammar

Optional Arguments in Abstract Categorial Grammar Optional Arguments in Abstract Categorial Grammar Chris Blom MSc. Thesis, 30 ECTS Master in Cognitive Artificial Intelligence, Utrecht University May 2012 First supervisor : dr. Yoad Winter Second supervisor

More information

Homework & NLTK. CS 181: Natural Language Processing Lecture 9: Context Free Grammars. Motivation. Formal Def of CFG. Uses of CFG.

Homework & NLTK. CS 181: Natural Language Processing Lecture 9: Context Free Grammars. Motivation. Formal Def of CFG. Uses of CFG. C 181: Natural Language Processing Lecture 9: Context Free Grammars Kim Bruce Pomona College pring 2008 Homework & NLTK Review MLE, Laplace, and Good-Turing in smoothing.py Disclaimer: lide contents borrowed

More information

Computational Linguistics: Syntax-Semantics

Computational Linguistics: Syntax-Semantics Computational Linguistics: Syntax-Semantics Raffaella Bernardi University of Trento Contents 1 The Three Tasks Revised................................... 3 2 Lambda terms and CFG...................................

More information

Proppian Functions & Moves

Proppian Functions & Moves Proppian Functions & Moves What are Functions? Proppian Functions & Moves is a classification scheme for abstract pieces of plot that are repeated across multiple folktales. It was created by Vladimir

More information

Outline. Data Definitions and Templates Syntax and Semantics Defensive Programming

Outline. Data Definitions and Templates Syntax and Semantics Defensive Programming Outline Data Definitions and Templates Syntax and Semantics Defensive Programming 1 Data Definitions Question 1: Are both of the following data definitions ok? ; A w-grade is either ; - num ; - posn ;

More information

11-682: Introduction to IR, NLP, MT and Speech. Parsing with Unification Grammars. Reading: Jurafsky and Martin, Speech and Language Processing

11-682: Introduction to IR, NLP, MT and Speech. Parsing with Unification Grammars. Reading: Jurafsky and Martin, Speech and Language Processing 11-682: Introduction to IR, NLP, MT and Speech Parsing with Unification Grammars Reading: Jurafsky and Martin, Speech and Language Processing Chapter 11 Augmenting CFGs with Features Certain linguistic

More information

Delimited Continuations, Applicative Functors and Natural Language Semantics

Delimited Continuations, Applicative Functors and Natural Language Semantics Delimited Continuations, Applicative Functors and Natural Language Semantics Björn Bringert Department of Computer Science and Engineering Chalmers University of Technology and University of Gothenburg

More information

SemTAG - a platform for Semantic Construction with Tree Adjoining Grammars

SemTAG - a platform for Semantic Construction with Tree Adjoining Grammars SemTAG - a platform for Semantic Construction with Tree Adjoining Grammars Yannick Parmentier parmenti@loria.fr Langue Et Dialogue Project LORIA Nancy Universities France Emmy Noether Project SFB 441 Tübingen

More information

The simplest notion of a list matching a pattern is when the pattern is exactly the same as the list. The list certainly matches the pattern but doesn

The simplest notion of a list matching a pattern is when the pattern is exactly the same as the list. The list certainly matches the pattern but doesn Pattern Matching Its Use Project P1 of Common Lisp: An Interactive Approach Stuart C. Shapiro Department of Computer Science State University of New York at Bualo August 3, 1999 The goal of this project

More information

structure of the presentation Frame Semantics knowledge-representation in larger-scale structures the concept of frame

structure of the presentation Frame Semantics knowledge-representation in larger-scale structures the concept of frame structure of the presentation Frame Semantics semantic characterisation of situations or states of affairs 1. introduction (partially taken from a presentation of Markus Egg): i. what is a frame supposed

More information

Definite-clause grammars: PSGs in Prolog (in principle, string rewrite described as a logical formula).

Definite-clause grammars: PSGs in Prolog (in principle, string rewrite described as a logical formula). Computational Encoding of PSGs Logical (declarative) Network-based (procedural) Definite-clause grammars: PSGs in Prolog (in principle, string rewrite described as a logical formula). For a grammar G =

More information

Introduction to Semantics. Expanding Our Formalism, Part 2 1

Introduction to Semantics. Expanding Our Formalism, Part 2 1 Expanding Our Formalism, Part 2 1 1. Lambda Notation for Defining Functions As you may have guessed by this point, most expressions of natural language will have some kind of function as their extension

More information

Towards a basic DCG for English: X-bar Theory. A DCG for English using gap threading for unbounded dependencies. Verb phrases and sentences

Towards a basic DCG for English: X-bar Theory. A DCG for English using gap threading for unbounded dependencies. Verb phrases and sentences Towards a basic DCG for English: X-bar Theory A DCG for English using gap threading for unbounded dependencies Detmar Meurers: Intro to Computational Linguistics I OSU, LING 684.01 Generalizing over possible

More information

Overgeneration and the Lexicon

Overgeneration and the Lexicon OvergenerationandtheLexicon Ling240SummerI2009 06/23 1 Complementizersandnullcategories Webeganbyintroducingsomechangestoourphrasestructurerulestoallowfor complementizerssuchasthat,if,whetherandthenullcomplementizer(whichwill

More information

Have the students look at the editor on their computers. Refer to overhead projector as necessary.

Have the students look at the editor on their computers. Refer to overhead projector as necessary. Intro to Programming (Time 15 minutes) Open the programming tool of your choice: If you ve installed, DrRacket, double-click the application to launch it. If you are using the online-tool, click here to

More information

Syntax-semantics interface and the non-trivial computation of meaning

Syntax-semantics interface and the non-trivial computation of meaning 1 Syntax-semantics interface and the non-trivial computation of meaning APA/ASL Group Meeting GVI-2: Lambda Calculi, Type Systems, and Applications to Natural Language APA Eastern Division 108th Annual

More information

CMSC 201 Fall 2016 Lab 09 Advanced Debugging

CMSC 201 Fall 2016 Lab 09 Advanced Debugging CMSC 201 Fall 2016 Lab 09 Advanced Debugging Assignment: Lab 09 Advanced Debugging Due Date: During discussion Value: 10 points Part 1: Introduction to Errors Throughout this semester, we have been working

More information

Ling/CSE 472: Introduction to Computational Linguistics. 5/21/12 Unification, parsing with unification Meaning representation

Ling/CSE 472: Introduction to Computational Linguistics. 5/21/12 Unification, parsing with unification Meaning representation Ling/CSE 472: Introduction to Computational Linguistics 5/21/12 Unification, parsing with unification Meaning representation Overview Unification Unification algorithm Parsing with unification Representing

More information

More Theories, Formal semantics

More Theories, Formal semantics Parts are based on slides by Carl Pollard Charles University, 2011-11-12 Optimality Theory Universal set of violable constraints: Faithfulness constraints:surface forms should be as close as to underlying

More information

Software Concepts. 2-8 Explain the process of translating and executing a Java program. How might the World Wide Web be involved?

Software Concepts. 2-8 Explain the process of translating and executing a Java program. How might the World Wide Web be involved? CHAPTER 2 Software Concepts Notes This chapter explores how programs are written and the process of compiling a program into machine language. Basic programs are presented and discussed. High-level software

More information

Logic Programming: Parsing. Difference Lists, DCGs

Logic Programming: Parsing. Difference Lists, DCGs O Y Logic Programming: Parsing. ifference Lists, Cs Alan maill Oct 15 2015 Alan maill Logic Programming: Parsing. ifference Lists, Cs Oct 15 2015 1/26 oday Y Context ree rammars (review) Parsing in Prolog

More information

Julia Bacskai-Atkari University of Potsdam (SFB-632) PhD-Day of the SFB-632 Potsdam 13 September 2013

Julia Bacskai-Atkari University of Potsdam (SFB-632) PhD-Day of the SFB-632 Potsdam 13 September 2013 Julia Bacskai-Atkari University of Potsdam (SFB-632) julia.bacskai-atkari@uni-potsdam.de PhD-Day of the SFB-632 Potsdam 13 September 2013 Comparative Deletion in English deletes the higher copy of the

More information

2 Ambiguity in Analyses of Idiomatic Phrases

2 Ambiguity in Analyses of Idiomatic Phrases Representing and Accessing [Textual] Digital Information (COMS/INFO 630), Spring 2006 Lecture 22: TAG Adjunction Trees and Feature Based TAGs 4/20/06 Lecturer: Lillian Lee Scribes: Nicolas Hamatake (nh39),

More information

Grammar Knowledge Transfer for Building RMRSs over Dependency Parses in Bulgarian

Grammar Knowledge Transfer for Building RMRSs over Dependency Parses in Bulgarian Grammar Knowledge Transfer for Building RMRSs over Dependency Parses in Bulgarian Kiril Simov and Petya Osenova Linguistic Modelling Department, IICT, Bulgarian Academy of Sciences DELPH-IN, Sofia, 2012

More information

Agreement, Types and Natural Language Semantics

Agreement, Types and Natural Language Semantics Agreement, Types and Natural Language Semantics Informatics 2A: Lecture 25 Shay Cohen 13 November 2017 1 / 35 Last Class How do we extract a grammar from a treebank? How do we estimate the rule probabilities

More information

ENCODING STRUCTURED OUTPUT VALUES. Edward Loper. Computer and Information Science

ENCODING STRUCTURED OUTPUT VALUES. Edward Loper. Computer and Information Science ENCODING STRUCTURED OUTPUT VALUES Edward Loper A DISSERTATION PROPOSAL in Computer and Information Science Presented to the Faculties of the University of Pennsylvania in Partial Fulfillment of the Requirements

More information

1 Introduction. 2 Set-Theory Formalisms. Formal Semantics -W2: Limitations of a Set-Theoretic Model SWU LI713 Meagan Louie August 2015

1 Introduction. 2 Set-Theory Formalisms. Formal Semantics -W2: Limitations of a Set-Theoretic Model SWU LI713 Meagan Louie August 2015 Formal Semantics -W2: Limitations of a Set-Theoretic Model SWU LI713 Meagan Louie August 2015 1 Introduction Recall from last week: The Semantic System 1. The Model/Ontology 2. Lexical Entries 3. Compositional

More information

Logical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides.

Logical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides. Logical Connectives We have learned what a statement is. Recall that a statement is just a proposition that asserts something that is either true or false. For instance, these are propositions: All kittens

More information

The uniform treatment of constraints, coherency and completeness in a Lexical Functional Grammar compiler

The uniform treatment of constraints, coherency and completeness in a Lexical Functional Grammar compiler The uniform treatment of constraints, coherency and completeness in a Lexical Functional Grammar compiler Peter Hancox School of Computer Science University of Birmingham Lexical Functional Grammar (LFG)

More information

Name: Magpie Chatbot Lab: Student Guide. Introduction

Name: Magpie Chatbot Lab: Student Guide. Introduction Magpie Chatbot Lab: Student Guide Introduction From Eliza in the 1960s to Siri and Watson today, the idea of talking to computers in natural language has fascinated people. More and more, computer programs

More information

Knowledge Representation. Dr. Asaad Sabah Hadi

Knowledge Representation. Dr. Asaad Sabah Hadi Knowledge Representation Dr. Asaad Sabah Hadi 1 Knowledge Knowledge is a collection of specialized facts, procedures and judgment rules High Degree of Abstraction Knowledge Information Low Data Quantity

More information

Clausal Architecture and Verb Movement

Clausal Architecture and Verb Movement Introduction to Transformational Grammar, LINGUIST 601 October 1, 2004 Clausal Architecture and Verb Movement 1 Clausal Architecture 1.1 The Hierarchy of Projection (1) a. John must leave now. b. John

More information

Context-Free Grammars

Context-Free Grammars Context-Free Grammars Carl Pollard yntax 2 (Linguistics 602.02) January 3, 2012 Context-Free Grammars (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b.

More information

Welcome to Unit 5~Answer Key

Welcome to Unit 5~Answer Key Welcome to Unit 5~Answer Key Easy English 나뭇가지 English Oh, yeah! Unit 5 ~ Lesson 1 ~ What s Going On? Our Objectives 짱이지 현재시제진행형 이다 + 동사 + ~ing Page 91 ~ Warm Up A 그사람어디인지맞추어보세요 living in South America.

More information

Ling 571: Deep Processing for Natural Language Processing

Ling 571: Deep Processing for Natural Language Processing Ling 571: Deep Processing for Natural Language Processing Julie Medero February 4, 2013 Today s Plan Assignment Check-in Project 1 Wrap-up CKY Implementations HW2 FAQs: evalb Features & Unification Project

More information

Computational Linguistics (INF2820 TFSs)

Computational Linguistics (INF2820 TFSs) S NP Det N VP V The dog barked LTOP h 1 INDEX e 2 def q rel bark v rel prpstn m rel LBL h 4 dog n rel LBL h RELS LBL h 1 ARG0 x 5 LBL h 9 8 ARG0 e MARG h 3 RSTR h 6 ARG0 x 2 5 ARG1 x BODY h 5 7 HCONS h

More information

English as a Second Language Podcast ESL Podcast 314 Buying a Digital Audio (MP3) Player

English as a Second Language Podcast   ESL Podcast 314 Buying a Digital Audio (MP3) Player GLOSSARY MP3 player a device that plays digital music in MP3 files * This is a very popular MP3 player, but there are many other players that are less expensive. selection the variety of things to choose

More information

1. He considers himself to be a genius. 2. He considered dieting to be unnecessary. 3. She considered that the waffle iron was broken. 4.

1. He considers himself to be a genius. 2. He considered dieting to be unnecessary. 3. She considered that the waffle iron was broken. 4. 1. He considers himself to be a genius. 2. He considered dieting to be unnecessary. 3. She considered that the waffle iron was broken. 4. He finally managed to get the bill paid. 5. I see you found the

More information

comma, comma, comma, comma, comma, chameleon

comma, comma, comma, comma, comma, chameleon comma, comma, comma, comma, comma, chameleon * Divide between lists of 3 or more things * Show contrast * Set off an exclamation Items in a Series Use the comma between a list of 3 or more things items,

More information

Lecture 9. Fragment 3 of English including Possessives, using Lambdas.

Lecture 9. Fragment 3 of English including Possessives, using Lambdas. Lecture 9. Fragment 3 of English including Possessives, using Lambdas. 1. Using lambdas to express semantics of Genitives, relational nouns, relational adjectives....1 1.1. Genitives and noun meanings....1

More information

Predicate Calculus. Problems? Syntax. Atomic Sentences. Complex Sentences. Truth

Predicate Calculus. Problems? Syntax. Atomic Sentences. Complex Sentences. Truth Problems? What kinds of problems exist for propositional logic? Predicate Calculus A way to access the components of an individual assertion Predicate Calculus: used extensively in many AI programs, especially

More information

UnElided Basic Remnants in Germanic Ellipsis or: ÜBRIGE Arguments. Bradley Larson*

UnElided Basic Remnants in Germanic Ellipsis or: ÜBRIGE Arguments. Bradley Larson* 1 Basic Goals UnElided Basic Remnants in Germanic Ellipsis or: ÜBRIGE Arguments Bradley Larson* In this paper I seek to determine what is going on with examples like (1) seen below. Here we see that the

More information

Natural Language Requirements

Natural Language Requirements Natural Language Requirements Software Verification and Validation Laboratory Requirement Elaboration Heuristic Domain Model» Requirement Relationship Natural Language is elaborated via Requirement application

More information

Getting Started With Syntax October 15, 2015

Getting Started With Syntax October 15, 2015 Getting Started With Syntax October 15, 2015 Introduction The Accordance Syntax feature allows both viewing and searching of certain original language texts that have both morphological tagging along with

More information

A Rough Guide to Punctuation

A Rough Guide to Punctuation www.theunitutor.com A Rough Guide to Punctuation Good punctuation is crucial for successful academic writing. Many students essays use little punctuation beyond commas and full stops. But to be restricted

More information

ARTIFICIAL INTELLIGENCE (CS 370D)

ARTIFICIAL INTELLIGENCE (CS 370D) Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-7) LOGICAL AGENTS Outline Agent Case (Wumpus world) Knowledge-Representation Logic in general

More information

Question Answering System for Yioop

Question Answering System for Yioop Question Answering System for Yioop Advisor Dr. Chris Pollett Committee Members Dr. Thomas Austin Dr. Robert Chun By Niravkumar Patel Problem Statement Question Answering System Yioop Proposed System Triplet

More information

The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture

The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture Denys Duchier Joseph Le Roux Yannick Parmentier LORIA Campus cientifique, BP 239, F-54 506 Vandœuvre-lès-Nancy, France MOZ

More information

MINIMALIST INQUIRIES AND DERIVATION BY PHASE MAIN POINTS

MINIMALIST INQUIRIES AND DERIVATION BY PHASE MAIN POINTS Anagnostopoulou / Fox Advanced Syntax, Spring 2007 MINIMALIST INQUIRIES AND DERIVATION BY PHASE MAIN POINTS [This handout contains material from Winfried Lechner s handout Economy in the Minimalist Program

More information

Class Intro & Compositional Semantics & Others

Class Intro & Compositional Semantics & Others LING 147. Semantics of Questions Week 1 Yimei Xiang September 1, 2016 1 Class intro Class Intro & Compositional Semantics & Others What does a declarative denote? A declarative denotes a proposition. Its

More information

An Efficient Implementation of PATR for Categorial Unification Grammar

An Efficient Implementation of PATR for Categorial Unification Grammar An Efficient Implementation of PATR for Categorial Unification Grammar Todd Yampol Stanford University Lauri Karttunen Xerox PARC and CSLI 1 Introduction This paper describes C-PATR, a new C implementation

More information

TEN CONTENT COMMANDMENTS BEST PRACTICES FOR USABLE, ACCESSIBLE CONTENT

TEN CONTENT COMMANDMENTS BEST PRACTICES FOR USABLE, ACCESSIBLE CONTENT TEN CONTENT COMMANDMENTS BEST PRACTICES FOR USABLE, ACCESSIBLE CONTENT Leonard Houx Centre for Technology-Enhanced Learning About Leonard I am an E-Learning Content Developer at the Centre for Technology-Enhanced

More information

Admin PARSING. Backoff models: absolute discounting. Backoff models: absolute discounting 3/4/11. What is (xy)?

Admin PARSING. Backoff models: absolute discounting. Backoff models: absolute discounting 3/4/11. What is (xy)? Admin Updated slides/examples on backoff with absolute discounting (I ll review them again here today) Assignment 2 Watson vs. Humans (tonight-wednesday) PARING David Kauchak C159 pring 2011 some slides

More information

Warm-up! CS 3 Final Review. Predict the output. Predict the Output. Predict the output. Predict the output. What is your favorite color?

Warm-up! CS 3 Final Review. Predict the output. Predict the Output. Predict the output. Predict the output. What is your favorite color? Warm-up! What is your favorite color? CS 3 Final Review Gilbert Chou, Jenny Franco and Colleen Lewis December 14, 2008 1-4pm GPB Brown Orange Yellow Green ((repeated bf 3) '(cat dog hat bat)) Predict the

More information

A partial and impartial view on partitives

A partial and impartial view on partitives A partial and impartial view on partitives Anne Tamm tamm.anne@gmail.com Research Institute of Linguistics, Hungarian Academy of Sciences The University of Hungarian Reformed Church, Budapest Workshop

More information

Semantic Roles. CS114 March 29, 2016 Professor Meteer. Thanks for Jurafsky & Martin, Chris Manning, & James Pustejovksy for slides

Semantic Roles. CS114 March 29, 2016 Professor Meteer. Thanks for Jurafsky & Martin, Chris Manning, & James Pustejovksy for slides + Semantic Roles CS114 March 29, 2016 Professor Meteer Thanks for Jurafsky & Martin, Chris Manning, & James Pustejovksy for slides + What are semantic roles and what is their history? n A lot of forms

More information

Outline. Announcements. Homework 2. Boolean expressions 10/12/2007. Announcements Homework 2 questions. Boolean expression

Outline. Announcements. Homework 2. Boolean expressions 10/12/2007. Announcements Homework 2 questions. Boolean expression Outline ECS 10 10/8 Announcements Homework 2 questions Boolean expressions If/else statements State variables and avoiding sys.exit( ) Example: Coin flipping (if time permits) Announcements Professor Amenta

More information

Functions that return lists

Functions that return lists 342 Chapter 23 Functions that return lists If you did exercises 22.5.15 or 22.5.16, you ve already written some functions that return lists, but only in a very simple way: adding one new element to the

More information

Linking Semantics for Modification

Linking Semantics for Modification Introduction Linking Semantics for Modification Cleo Condoravdi Joint work with David Beaver Zukunftskolleg, University of Konstanz 1 Workshop on Semantics for Textual Inference University of Colorado

More information

Lesson Share TEACHER'S NOTES LESSON SHARE. ing by Olya Sergeeva. Overview. Preparation. Procedure

Lesson Share TEACHER'S NOTES LESSON SHARE.  ing by Olya Sergeeva. Overview. Preparation. Procedure Lesson Share TEACHER'S NOTES Age: Adults Level: Intermediate + Time: 1 hour 40 minutes Objective: to practise writing work-related emails Key skills: writing Materials: one copy of the worksheet per student;

More information

Dowty Friday, July 22, 11

Dowty Friday, July 22, 11 Dowty 1994 The Role of Negative Polarity and Concord Marking in Natural Language Reasoning SALT IV, Cornell, Ithaca, NY. starts by explaining Sánchez work more lucidly than Sánchez himself presents a simpler

More information

Related Course Objec6ves

Related Course Objec6ves Syntax 9/18/17 1 Related Course Objec6ves Develop grammars and parsers of programming languages 9/18/17 2 Syntax And Seman6cs Programming language syntax: how programs look, their form and structure Syntax

More information

Indefinites and Sluicing. A type logical approach

Indefinites and Sluicing. A type logical approach Indefinites and Sluicing. A type logical approach Gerhard Jäger Zentrum für Allgemeine Sprachwissenschaft Berlin Abstract Following Jäger (2001a), we propose to extend the Lambek calculus with two additional

More information

Semantic and Multimodal Annotation. CLARA University of Copenhagen August 2011 Susan Windisch Brown

Semantic and Multimodal Annotation. CLARA University of Copenhagen August 2011 Susan Windisch Brown Semantic and Multimodal Annotation CLARA University of Copenhagen 15-26 August 2011 Susan Windisch Brown 2 Program: Monday Big picture Coffee break Lexical ambiguity and word sense annotation Lunch break

More information

Syntax and Grammars 1 / 21

Syntax and Grammars 1 / 21 Syntax and Grammars 1 / 21 Outline What is a language? Abstract syntax and grammars Abstract syntax vs. concrete syntax Encoding grammars as Haskell data types What is a language? 2 / 21 What is a language?

More information

6.863J Natural Language Processing Lecture 13: Semantics II. Robert C. Berwick

6.863J Natural Language Processing Lecture 13: Semantics II. Robert C. Berwick 6.863J Natural Language Processing Lecture 13: Semantics II Robert C. Berwick berwick@ai.mit.edu The Menu Bar Administrivia: Schedule alert: Lab 3 due today Lab 4: posted; due April 9 Agenda: Semantics:

More information

CS101 Introduction to Programming Languages and Compilers

CS101 Introduction to Programming Languages and Compilers CS101 Introduction to Programming Languages and Compilers In this handout we ll examine different types of programming languages and take a brief look at compilers. We ll only hit the major highlights

More information

LING 253: SYNTAX I SECTION. (Specifier Rule) (Adjunct Rule) (Complement Rule)

LING 253: SYNTAX I SECTION. (Specifier Rule) (Adjunct Rule) (Complement Rule) LIG 253: SYAX I SECIO SABIA MAYIKU OC. 17, 2012 1. Our current rules for English XP (YP) X X (ZP) X or X X (ZP) X X (WP) XP XP Conj XP X X Conj X X X Conj X X X WP UP (Specifier Rule) (Adjunct Rule) (Complement

More information

Wednesday, August 31, Parsers

Wednesday, August 31, Parsers Parsers How do we combine tokens? Combine tokens ( words in a language) to form programs ( sentences in a language) Not all combinations of tokens are correct programs (not all sentences are grammatically

More information

CSE 143: Computer Programming II Summer 2017 HW4: Grammar (due Tuesday, July :30pm)

CSE 143: Computer Programming II Summer 2017 HW4: Grammar (due Tuesday, July :30pm) CSE 143: Computer Programming II Summer 2017 HW4: Grammar (due Tuesday, July 25 2017 11:30pm) This assignment focuses on recursive programming, regular expressions, and grammars. It will also give you

More information

LING 388: Language and Computers. Sandiway Fong Lecture 13

LING 388: Language and Computers. Sandiway Fong Lecture 13 LING 388: Language and Computers Sandiway Fong Lecture 13 Administrivia Another Homework on recursion Homework 5 due next Wednesday by midnight LeF to Right Recursive TransformaJon x --> [z], v. v -->

More information

Sample IPC model. Evaluate FFPP P(m) w/rt <w,i >

Sample IPC model. Evaluate FFPP P(m) w/rt <w,i > 1 Sample IPC model Evaluate PPP(m) w/rt Evaluate FFPPP(m) w/rt Evaluate FFPP P(m) w/rt INTENSIONALITY (2) 2 3 Another set theory convention Related to set intersection: Generalized

More information