The Degree of Commitment to the Initial Analysis Predicts the Cost of Reanalysis: Evidence from Japanese Garden-Path Sentences

Size: px
Start display at page:

Download "The Degree of Commitment to the Initial Analysis Predicts the Cost of Reanalysis: Evidence from Japanese Garden-Path Sentences"

Transcription

1 P3-26 The Degree of Commitment to the Initial Analysis Predicts the Cost of Reanalysis: Evidence from Japanese Garden-Path Sentences Chie Nakamura, Manabu Arai Keio University, University of Tokyo, JSPS Abstract Previous research demonstrated that comprehenders of head-final languages do not delay associating pre-head arguments until the head is received. As a consequence, readers are sometimes forced to reanalyze a structure due to an incorrect pre-head attachment. It is, however, still unclear what makes comprehenders of head-final languages to commit to pre-head attachment and to experience processing difficulty when a sentence is disambiguated. The current study addressed this issue by testing Japanese relative clause structure. We conducted two reading experiments using eye-tracking technique. The results demonstrated that both semantic information and temporal delay of disambiguation point influenced the degree of comprehenders commitment to the incorrect initial analysis and the amount of cost for structural reanalysis. Keywords Garden-path sentence, initial analysis, reanalysis, eye-tracking, reading, relative clause structure 1,,, [1,2]., [3,4], Tabor and Hutching (2004) (1a) (1b), (1b) (1a),, (Digging-in effect) [5]. (1a) As the author wrote the book grew. (1b) As the author wrote the book describing Babylon grew.,,, (1b) (1a), 1 2, 718

2 P , Plausibility: High Plausibility: Low, RC Length: Short RC Length: Long 2 4, , (Eye Link II, SR Research),.,, , (Plausibility: High ), (Plausibility: Low ), (RC Length: Short, Long ) 2 2 (2a-2d)., 24, c. (Long + High ) 2d. (Long + Low ) 2.2, 1200ms 80ms [4]., First-pass reading time Second-pass reading time 2 First-pass reading time,, Second-pass reading time,,,, First-pass reading time, Second-pass reading time, Linear Mixed-Effects: LME [6,7]. 2 5, Plausibility High Low RC Length Short Long,. 2a.. (Short + High ) 2b.. (Short + Low ) First-pass reading times. 2 Plausibility (β = 29.2, t = 3.64, p < 0.001), Low High 3 719

3 P3-26 RC Length (β = 22.6, t = 10.86, p < 0.001),. 5 RC Length Plausibility (β = 19.2, t = 3.21, p < 0.01)., Plausibility, Low High (β = 18.7, t = 9.93, p = 0.07), Low (β = -19.2, t = 1.93, p = 0.06)., Regression-out, (Long + High ) (0.42), Second pass reading times. 2 RC-Length (β = 61.2, t = 4.65, p < 0.001),, 3 5, Plausibility ( 3: β = , t = 3.41, p < 0.01; 4: β = -37.9, t = 3.22, p < 0.01; 5: β = -44.2, t = 3.60, p < 0.001),, RC Length ( 3: β = 455.1, t = 8.67, p < 0.001; 4: β = 36.0, t = 3.32, p < 0.05; 5: β = , t = 3.46, p = 0.07),,., 3 Plausibility RC Length (β = -86.8, t = 2.35, p < 0.05),, Long, Short Plausibility (Long : β = , t = 3.63, p < 0.001; Short : β = -50.9, t = 2.41, p < 0.05) , (Plausibility: High ), (Plausibility: Low ),,., 3 Second-pass reading time, 5 First-pass reading time, Plausibility RC Length,,,,, , 720

4 P Plausibility (High Low ),, (Word Order: NP-Adjunct ), (Word Order: Adjunct-NP ) (3a-3d)., 24, a.. (High + NP-Adjunct ) 3b.. (High + Adjunct-NP ) 3c.. (Low + NP-Adjunct ) 3d.. (Low + Adjunct-NP ) 3.2 Plausibility High Low Word Order NP-Adjunct Adjunct-NP LME forward-selection., Right-bounded reading time Second-pass reading time 2 second-pass reading time, Word Order (β = -0.08, t = 2.21, p < 0.001),, NP-Adjunct e.g.,,, Adjunct-NP e.g.,., 4 right-bounded reading time Plausibility Word Order (β = 0.05, t = 2.30, p < 0.05)., NP-Adjunct Plausibility (β = 38.35, t = 2.13, p < 0.05), Adjunct-NP Plausibility (β = 3.40, t = 0.29, p = 0.59) ,, NP-Adjunct, Adjunct-NP, 4 Plausibility Word Order,,, (High ), (Low ) Plausibility, NP-Adjunct, Adjunct-NP, NP-Adjunct, Adjunct-NP,, Plausibility 721

5 P , 1,. 2, 1, [1] Kamide, Y. (2006). Incrementality in Japanese sentence processing. In M. Nakayama, R. Mazuka & Y. Shirai (Eds.), Handbook of Japanese psycholinguistics; Cambridge University Press. [2] Miyamoto, E. T Case markers as clause boundary inducers in Japanese. Journal of Psycholinguistic Research, 31, [3] Ferreira, F.,& Henderson, J. M. (1991). Recovery from misanalyses of garden-path sentences. Journal of Memory and Language, 30, [4] Sturt, P., Pickering, M. J., & Crocker, M. W. (1999). Structural change and reanalysis difficulty in language comprehension. Journal of Memory and Language, 40, [5] Tabor, W., & Hutchins, S. (2004). Evidence for self-organized sentence processing: Digging in effects. Journal of Experimental Psychology: Learning, Memory, and Cognition, 30, [6] Βaayen, R. H. (2008). Analyzing linguistic data: a practical introduction to statistics using R. Cambridge: Cambridge University Press. [7] Βaayen, R. H., Davidson, D. J., & Βates, D. M. (2008). Mixed-effects modeling with crossed random effects for subjects and items. Journal of Memory and Language, 59,

Processing Head-Final Relative Clauses without Garden Paths

Processing Head-Final Relative Clauses without Garden Paths Processing Head-Final Relative Clauses without Garden Paths Chien-Jer Charles Lin & Thomas G. Bever National Taiwan Normal University University of Arizona clin@ntnu.edu.tw international conference on

More information

Seminar Topic Assignment

Seminar Topic Assignment Seminars @ Knowledge-based Systems Group 184/3 WS 2017/18 Seminar Topic Assignment Institut für Informationssysteme Arbeitsbereich Wissensbasierte Systeme www.kr.tuwien.ac.at Seminar Topics Seminars: Seminar

More information

Bifurcation analysis of a Gradient Symbolic Computation model of incremental processing

Bifurcation analysis of a Gradient Symbolic Computation model of incremental processing Bifurcation analysis of a Gradient Symbolic Computation model of incremental processing Pyeong Whan Cho (pcho4@jhu.edu) Paul Smolensky (smolensky@jhu.edu) Department of Cognitive Science, Johns Hopkins

More information

Semantics and Generative Grammar. A Little Bit on Adverbs and Events

Semantics and Generative Grammar. A Little Bit on Adverbs and Events A Little Bit on Adverbs and Events 1. From Adjectives to Adverbs to Events We ve just developed a theory of the semantics of adjectives, under which they denote either functions of type (intersective

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities ESSLLI, August 2015 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

The relation of surprisal and human processing

The relation of surprisal and human processing The relation of surprisal and human processing difficulty Information Theory Lecture Vera Demberg and Matt Crocker Information Theory Lecture, Universität des Saarlandes April 19th, 2015 Information theory

More information

Processing Difficulty and Structural Uncertainty in Relative Clauses across East Asian Languages

Processing Difficulty and Structural Uncertainty in Relative Clauses across East Asian Languages Processing Difficulty and Structural Uncertainty in Relative Clauses across East Asian Languages Zhong Chen and John Hale Department of Linguistics Cornell University Incremental parsing... 0 Incremental

More information

Unterspezifikation in der Semantik Scope Semantics in Lexicalized Tree Adjoining Grammars

Unterspezifikation in der Semantik Scope Semantics in Lexicalized Tree Adjoining Grammars in der emantik cope emantics in Lexicalized Tree Adjoining Grammars Laura Heinrich-Heine-Universität Düsseldorf Wintersemester 2011/2012 LTAG: The Formalism (1) Tree Adjoining Grammars (TAG): Tree-rewriting

More information

Strong connectivity hypothesis and generative power in TAG

Strong connectivity hypothesis and generative power in TAG 15 Strong connectivity hypothesis and generative power in TAG Alessandro Mazzei, Vincenzo ombardo and Patrick Sturt Abstract Dynamic grammars are relevant for psycholinguistic modelling and speech processing.

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities NASSLLI, June 2014 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

CMPT-825 Natural Language Processing. Why are parsing algorithms important?

CMPT-825 Natural Language Processing. Why are parsing algorithms important? CMPT-825 Natural Language Processing Anoop Sarkar http://www.cs.sfu.ca/ anoop October 26, 2010 1/34 Why are parsing algorithms important? A linguistic theory is implemented in a formal system to generate

More information

Penn Treebank Parsing. Advanced Topics in Language Processing Stephen Clark

Penn Treebank Parsing. Advanced Topics in Language Processing Stephen Clark Penn Treebank Parsing Advanced Topics in Language Processing Stephen Clark 1 The Penn Treebank 40,000 sentences of WSJ newspaper text annotated with phrasestructure trees The trees contain some predicate-argument

More information

Preferred Mental Models in Qualitative Spatial Reasoning: A Cognitive Assessment of Allen s Calculus

Preferred Mental Models in Qualitative Spatial Reasoning: A Cognitive Assessment of Allen s Calculus Knauff, M., Rauh, R., & Schlieder, C. (1995). Preferred mental models in qualitative spatial reasoning: A cognitive assessment of Allen's calculus. In Proceedings of the Seventeenth Annual Conference of

More information

Chunks and Dependencies and Human Sentence Processing. Steven Abney University of Tübingen

Chunks and Dependencies and Human Sentence Processing. Steven Abney University of Tübingen Chunks and ependencies and Human entence Processing teven Abney University of Tübingen What are Chunks Introspection about sentence processing in reading old man in park was feeding pigeons [ old man ]

More information

October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification

October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification October 16 th 2015, Budapest Workshop on Linguistic and Cognitive aspects of Quantification The semantics and the acquisition of the distributive marker po, which is notorious, (common to Slavic and has

More information

Pei Wang( 王培 ) Temple University, Philadelphia, USA

Pei Wang( 王培 ) Temple University, Philadelphia, USA Pei Wang( 王培 ) Temple University, Philadelphia, USA Artificial General Intelligence (AGI): a small research community in AI that believes Intelligence is a general-purpose capability Intelligence should

More information

Seminar in Semantics: Gradation & Modality Winter 2014

Seminar in Semantics: Gradation & Modality Winter 2014 1 Subject matter Seminar in Semantics: Gradation & Modality Winter 2014 Dan Lassiter 1/8/14 Handout: Basic Modal Logic and Kratzer (1977) [M]odality is the linguistic phenomenon whereby grammar allows

More information

EXERCISE 10 SOLUTIONS

EXERCISE 10 SOLUTIONS CSE541 EXERCISE 10 SOLUTIONS Covers Chapters 10, 11, 12 Read and learn all examples and exercises in the chapters as well! QUESTION 1 Let GL be the Gentzen style proof system for classical logic defined

More information

Computationele grammatica

Computationele grammatica Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................

More information

Where linguistic meaning meets non-linguistic cognition

Where linguistic meaning meets non-linguistic cognition Where linguistic meaning meets non-linguistic cognition Tim Hunter and Paul Pietroski NASSLLI 2016 Friday: Putting things together (perhaps) Outline 5 Experiments with kids on most 6 So: How should we

More information

X-bar theory. X-bar :

X-bar theory. X-bar : is one of the greatest contributions of generative school in the filed of knowledge system. Besides linguistics, computer science is greatly indebted to Chomsky to have propounded the theory of x-bar.

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities ESSLLI, August 2015 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

On rigid NL Lambek grammars inference from generalized functor-argument data

On rigid NL Lambek grammars inference from generalized functor-argument data 7 On rigid NL Lambek grammars inference from generalized functor-argument data Denis Béchet and Annie Foret Abstract This paper is concerned with the inference of categorial grammars, a context-free grammar

More information

Natural Language Processing

Natural Language Processing SFU NatLangLab Natural Language Processing Anoop Sarkar anoopsarkar.github.io/nlp-class Simon Fraser University September 27, 2018 0 Natural Language Processing Anoop Sarkar anoopsarkar.github.io/nlp-class

More information

Computational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters

Computational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters Computational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters Klinton Bicknell & Roger Levy LSA 2015 Summer Institute University

More information

A Case Study Approach to the Sources of Slumps in Skill Learning

A Case Study Approach to the Sources of Slumps in Skill Learning 86 23 3 SP-A 2008 A Case Study Approach to the Sources of Slumps in Skill Learning Hiroaki Suzuki Hitoshi Ohnishi Chie Takeba Aoyama Gakuin University susan@ri.aoyama.ac.jp, http://edhs.ri.aoyama.ac.jp/~susan/mt/

More information

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically NP S AUX VP Ali will V NP help D N the man A node is any point in the tree diagram and it can

More information

Fertilization of Case Frame Dictionary for Robust Japanese Case Analysis

Fertilization of Case Frame Dictionary for Robust Japanese Case Analysis Fertilization of Case Frame Dictionary for Robust Japanese Case Analysis Daisuke Kawahara and Sadao Kurohashi Graduate School of Information Science and Technology, University of Tokyo PRESTO, Japan Science

More information

Computer Sciences Department

Computer Sciences Department Computer Sciences Department 1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Computer Sciences Department 3 ADVANCED TOPICS IN C O M P U T A B I L I T Y

More information

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system): Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building

More information

Kripke on Frege on Sense and Reference. David Chalmers

Kripke on Frege on Sense and Reference. David Chalmers Kripke on Frege on Sense and Reference David Chalmers Kripke s Frege Kripke s Frege Theory of Sense and Reference: Some Exegetical Notes Focuses on Frege on the hierarchy of senses and on the senses of

More information

2013 ISSN: JATLaC Journal 8: t 1. t t Chomsky 1993 I Radford (2009) R I t t R I 2. t R t (1) (= R's (15), p. 86) He could have helped

2013 ISSN: JATLaC Journal 8: t 1. t t Chomsky 1993 I Radford (2009) R I t t R I 2. t R t (1) (= R's (15), p. 86) He could have helped t 1. tt Chomsky 1993 IRadford (2009) R Itt R I 2. t R t (1) (= R's (15), p. 86) He could have helped her, or [she have helped him]. 2 have I has had I I could ellipsis I gapping R (2) (= R (18), p.88)

More information

Dynamic encoding of structural uncertainty in gradient symbols

Dynamic encoding of structural uncertainty in gradient symbols Dynamic encoding of structural uncertainty in gradient symbols Pyeong Whan Cho Department of Cognitive Science Johns Hopkins University pcho4@jhu.edu Matthew Goldrick Department of Linguistics Northwestern

More information

Reasoning with Memory Augmented Neural Networks for Language Comprehension, ICLR17

Reasoning with Memory Augmented Neural Networks for Language Comprehension, ICLR17 Reasoning with Memory Augmented Neural Networks for Language Comprehension, ICLR17 UMass Medical School ICLR 2017 Presenter: Jack Lanchantin ICLR 2017 Presenter: Jack Lanchantin 1 Outline 1 Intro 2 Hypothesis

More information

Constructing Wh-in-situ Dependencies

Constructing Wh-in-situ Dependencies Constructing Wh-in-situ Dependencies Ming Xiang 1, Luxi Mo 2, Suiping Wang 2 1 University of Chicago; 2 South China Normal University Wh-in-situ construction 警察保护了哪个 人? police officer protect which man?

More information

Programming in Japanese for Literacy Education

Programming in Japanese for Literacy Education Programming in Japanese for Literacy Education Ken Okada, Manabu Sugiura, Yoshiaki Matsuzawa, Megumi Araki, and Hajime Ohiwa Keio University - Graduate School of Media and Governance 5322 Endo, Fujisawa-shi,

More information

Artificial Intelligence

Artificial Intelligence CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20-21 Natural Language Parsing Parsing of Sentences Are sentences flat linear structures? Why tree? Is

More information

Computational Linguistics

Computational Linguistics Computational Linguistics Dependency-based Parsing Clayton Greenberg Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2016 Acknowledgements These slides

More information

Sentence Planning 2: Aggregation

Sentence Planning 2: Aggregation Pipelined Microplanning Sentence Planning 2: Aggregation Lecture 10 February 28, 2012 Reading: Chapter 5, Reiter and Dale Document Plan! Lexical choice! PPSs Aggregation PPSs Referring Expression Gen!

More information

Generalisation and inductive reasoning. Computational Cognitive Science 2014 Dan Navarro

Generalisation and inductive reasoning. Computational Cognitive Science 2014 Dan Navarro Generalisation and inductive reasoning Computational Cognitive Science 2014 Dan Navarro Where are we at? Bayesian statistics as a general purpose tool for doing inductive inference A specific Bayesian

More information

Marrying Dynamic Programming with Recurrent Neural Networks

Marrying Dynamic Programming with Recurrent Neural Networks Marrying Dynamic Programming with Recurrent Neural Networks I eat sushi with tuna from Japan Liang Huang Oregon State University Structured Prediction Workshop, EMNLP 2017, Copenhagen, Denmark Marrying

More information

Spatial Reasoning Test Examples

Spatial Reasoning Test Examples Test Examples Free PDF ebook Download: Test Examples Download or Read Online ebook spatial reasoning test examples in PDF Format From The Best User Guide Database structures influences spatial reasoning,

More information

Computational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters

Computational Psycholinguistics Lecture 2: human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters Computational Psycholinguistics Lecture : human syntactic parsing, garden pathing, grammatical prediction, surprisal, particle filters Klinton Bicknell & Roger Levy LSA 05 Summer Institute University of

More information

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World

More information

Computational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing

Computational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing Computational Linguistics Dependency-based Parsing Dietrich Klakow & Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2013 Acknowledgements These slides

More information

Models of Adjunction in Minimalist Grammars

Models of Adjunction in Minimalist Grammars Models of Adjunction in Minimalist Grammars Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University FG 2014 August 17, 2014 The Theory-Neutral CliffsNotes Insights Several properties

More information

Natural Language Processing CS Lecture 06. Razvan C. Bunescu School of Electrical Engineering and Computer Science

Natural Language Processing CS Lecture 06. Razvan C. Bunescu School of Electrical Engineering and Computer Science Natural Language Processing CS 6840 Lecture 06 Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu Statistical Parsing Define a probabilistic model of syntax P(T S):

More information

2 Higginbotham & May s proposal

2 Higginbotham & May s proposal A Generalized Definition of Quantifier Absorption Nissim Francez Technion, Haifa Yoad Winter OTS, Utrecht University 1 Introduction In most artificial logical languages with quantifier operators variable

More information

Two-Color Counters. KEY TERM additive inverses

Two-Color Counters. KEY TERM additive inverses Two-Color Counters Adding Integers, Part II 3 WARM UP Use a number line to determine each sum. Then write a sentence to describe the movement you used on the number line to compute the sum of the two integers.

More information

Introduction to Semantics. The Formalization of Meaning 1

Introduction to Semantics. The Formalization of Meaning 1 The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions

More information

Transition-Based Parsing

Transition-Based Parsing Transition-Based Parsing Based on atutorial at COLING-ACL, Sydney 2006 with Joakim Nivre Sandra Kübler, Markus Dickinson Indiana University E-mail: skuebler,md7@indiana.edu Transition-Based Parsing 1(11)

More information

An Analysis of the CARIN Model of Conceptual Combination

An Analysis of the CARIN Model of Conceptual Combination An Analysis of the CARIN Model of Conceptual Combination Barry Devereux (Barry.Devereux@ucd.ie) 1 Phil Maguire (Phil.Maguire@ucd.ie) Fintan Costello (Fintan.Costello@ucd.ie) Arthur Cater (Arthur.Cater@ucd.ie)

More information

Genre-specific properties of adverbial clauses in English academic writing and newspaper texts. Elma Kerz & Daniel Wiechmann

Genre-specific properties of adverbial clauses in English academic writing and newspaper texts. Elma Kerz & Daniel Wiechmann Genre-specific properties of adverbial clauses in English academic writing and newspaper texts Elma Kerz & Daniel Wiechmann A constructionist perspective on patterns Schematicity Complex sentence constructions

More information

Continuations in Type Logical Grammar. Grafting Trees: (with Chris Barker, UCSD) NJPLS, 27 February Harvard University

Continuations in Type Logical Grammar. Grafting Trees: (with Chris Barker, UCSD) NJPLS, 27 February Harvard University Grafting Trees: Continuations in Type Logical Grammar Chung-chieh Shan Harvard University ccshan@post.harvard.edu (with Chris Barker, UCSD) NJPLS, 27 February 2004 Computational Linguistics 1 What a linguist

More information

Propositional logic. First order logic. Alexander Clark. Autumn 2014

Propositional logic. First order logic. Alexander Clark. Autumn 2014 Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and

More information

564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets.

564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets. 564 Lecture 25 Nov. 23, 1999 1 Continuing note on presuppositional vs. nonpresuppositional dets. Here's the argument about the nonpresupp vs. presupp analysis of "every" that I couldn't reconstruct last

More information

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities NASSLLI, June 2014 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

Chiastic Lambda-Calculi

Chiastic Lambda-Calculi Chiastic Lambda-Calculi wren ng thornton Cognitive Science & Computational Linguistics Indiana University, Bloomington NLCS, 28 June 2013 wren ng thornton (Indiana University) Chiastic Lambda-Calculi NLCS,

More information

Natural Language Processing : Probabilistic Context Free Grammars. Updated 5/09

Natural Language Processing : Probabilistic Context Free Grammars. Updated 5/09 Natural Language Processing : Probabilistic Context Free Grammars Updated 5/09 Motivation N-gram models and HMM Tagging only allowed us to process sentences linearly. However, even simple sentences require

More information

Semantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns

Semantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns The Semantics of Adjectival Modification 1 (1) Our Current Assumptions Regarding Adjectives and Common Ns a. Both adjectives and common nouns denote functions of type (i) [[ male ]] = [ λx : x D

More information

Human interpretation and reasoning about conditionals

Human interpretation and reasoning about conditionals Human interpretation and reasoning about conditionals Niki Pfeifer 1 Munich Center for Mathematical Philosophy Language and Cognition Ludwig-Maximilians-Universität München www.users.sbg.ac.at/~pfeifern/

More information

Focus in complex noun phrases

Focus in complex noun phrases Focus in complex noun phrases Summary In this paper I investigate the semantics of association with focus in complex noun phrases in the framework of Alternative Semantics (Rooth 1985, 1992). For the first

More information

Probabilistic Context-free Grammars

Probabilistic Context-free Grammars Probabilistic Context-free Grammars Computational Linguistics Alexander Koller 24 November 2017 The CKY Recognizer S NP VP NP Det N VP V NP V ate NP John Det a N sandwich i = 1 2 3 4 k = 2 3 4 5 S NP John

More information

Features of Statistical Parsers

Features of Statistical Parsers Features of tatistical Parsers Preliminary results Mark Johnson Brown University TTI, October 2003 Joint work with Michael Collins (MIT) upported by NF grants LI 9720368 and II0095940 1 Talk outline tatistical

More information

Bar-Hillel and the Division of Labor in Language

Bar-Hillel and the Division of Labor in Language Bar-Hillel and the Division of Labor in Language On the interaction of grammar, logic, and pragmatics Luka Crnič November 2, 2015 Language, Logic and Cognition Center http://scholars.huji.ac.il/llcc Luka

More information

From Language towards. Formal Spatial Calculi

From Language towards. Formal Spatial Calculi From Language towards Formal Spatial Calculi Parisa Kordjamshidi Martijn Van Otterlo Marie-Francine Moens Katholieke Universiteit Leuven Computer Science Department CoSLI August 2010 1 Introduction Goal:

More information

pursues interdisciplinary long-term research in Spatial Cognition. Particular emphasis is given to:

pursues interdisciplinary long-term research in Spatial Cognition. Particular emphasis is given to: The Transregional Collaborative Research Center SFB/TR 8 Spatial Cognition: Reasoning, Action, Interaction at the Universities of Bremen and Freiburg, Germany pursues interdisciplinary long-term research

More information

1 Completeness Theorem for First Order Logic

1 Completeness Theorem for First Order Logic 1 Completeness Theorem for First Order Logic There are many proofs of the Completeness Theorem for First Order Logic. We follow here a version of Henkin s proof, as presented in the Handbook of Mathematical

More information

CS460/626 : Natural Language Processing/Speech, NLP and the Web

CS460/626 : Natural Language Processing/Speech, NLP and the Web CS460/626 : Natural Language Processing/Speech, NLP and the Web Lecture 23: Binding Theory Pushpak Bhattacharyya CSE Dept., IIT Bombay 8 th Oct, 2012 Parsing Problem Semantics Part of Speech Tagging NLP

More information

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 1. Overview Attempts to provide a compositional, fully semantic account of same. Elements other than NPs in particular, adjectives can be scope-taking

More information

Annotation tasks and solutions in CLARIN-PL

Annotation tasks and solutions in CLARIN-PL Annotation tasks and solutions in CLARIN-PL Marcin Oleksy, Ewa Rudnicka Wrocław University of Technology marcin.oleksy@pwr.edu.pl ewa.rudnicka@pwr.edu.pl CLARIN ERIC Common Language Resources and Technology

More information

Lecture 15: Validity and Predicate Logic

Lecture 15: Validity and Predicate Logic Lecture 15: Validity and Predicate Logic 1 Goals Today Learn the definition of valid and invalid arguments in terms of the semantics of predicate logic, and look at several examples. Learn how to get equivalents

More information

COMPUTATIONAL COMPLEXITY

COMPUTATIONAL COMPLEXITY ATHEATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Computational Complexity - Osamu Watanabe COPUTATIONAL COPLEXITY Osamu Watanabe Tokyo Institute of Technology, Tokyo, Japan Keywords: {deterministic, randomized,

More information

Two Reconstruction Puzzles Yael Sharvit University of Connecticut

Two Reconstruction Puzzles Yael Sharvit University of Connecticut Workshop on Direct Compositionality June 19-21, 2003 Brown University Two Reconstruction Puzzles Yael Sharvit University of Connecticut yael.sharvit@uconn.edu Some constructions exhibit what is known as

More information

Statistiek II. John Nerbonne. February 26, Dept of Information Science based also on H.Fitz s reworking

Statistiek II. John Nerbonne. February 26, Dept of Information Science based also on H.Fitz s reworking Dept of Information Science j.nerbonne@rug.nl based also on H.Fitz s reworking February 26, 2014 Last week: one-way ANOVA generalized t-test to compare means of more than two groups example: (a) compare

More information

Driving Semantic Parsing from the World s Response

Driving Semantic Parsing from the World s Response Driving Semantic Parsing from the World s Response James Clarke, Dan Goldwasser, Ming-Wei Chang, Dan Roth Cognitive Computation Group University of Illinois at Urbana-Champaign CoNLL 2010 Clarke, Goldwasser,

More information

an efficient procedure for the decision problem. We illustrate this phenomenon for the Satisfiability problem.

an efficient procedure for the decision problem. We illustrate this phenomenon for the Satisfiability problem. 1 More on NP In this set of lecture notes, we examine the class NP in more detail. We give a characterization of NP which justifies the guess and verify paradigm, and study the complexity of solving search

More information

Dynamic Interpretations and Interpretation Structures

Dynamic Interpretations and Interpretation Structures Dynamic Interpretations and Interpretation Structures Yasuo Nakayama Graduate School of Human Sciences, Osaka University, Japan 1 Introduction Dynamic semantics has its roots in the research of anaphoric

More information

BAYESIAN MODELS FOR ASTROPHYSICAL DATA: USING R, JAGS, PYTHON, AND STAN BY JOSEPH M. HILBE, RAFAEL S. DE SOUZA, EMILLE E. O.

BAYESIAN MODELS FOR ASTROPHYSICAL DATA: USING R, JAGS, PYTHON, AND STAN BY JOSEPH M. HILBE, RAFAEL S. DE SOUZA, EMILLE E. O. Read Online and Download Ebook BAYESIAN MODELS FOR ASTROPHYSICAL DATA: USING R, JAGS, PYTHON, AND STAN BY JOSEPH M. HILBE, RAFAEL S. DE SOUZA, EMILLE E. O. ISHIDA DOWNLOAD EBOOK : BAYESIAN MODELS FOR ASTROPHYSICAL

More information

Spatial Role Labeling CS365 Course Project

Spatial Role Labeling CS365 Course Project Spatial Role Labeling CS365 Course Project Amit Kumar, akkumar@iitk.ac.in Chandra Sekhar, gchandra@iitk.ac.in Supervisor : Dr.Amitabha Mukerjee ABSTRACT In natural language processing one of the important

More information

Logic: Intro & Propositional Definite Clause Logic

Logic: Intro & Propositional Definite Clause Logic Logic: Intro & Propositional Definite Clause Logic Alan Mackworth UBC CS 322 Logic 1 February 27, 2013 P & M extbook 5.1 Lecture Overview Recap: CSP planning Intro to Logic Propositional Definite Clause

More information

Tick Talk. Introduction

Tick Talk. Introduction Tick Talk Douglas J. Davidson (dvdsn@casper.beckman.uiuc.edu) Kathryn Bock (kbock@s.psych.uiuc.edu) David E. Irwin (dirwin@s.psych.uiuc.edu) Beckman Institute University of Illinois 405 N. Mathews Urbana,

More information

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting A Multi-Modal Combinatory Categorial Grammar Analysis of Japanese Nonconstituent Clefting Department of Linguistics The Ohio State University {kubota,esmith}@ling.osu.edu A basic cleft sentence Data Clefting

More information

MIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October,

MIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October, MIDTERM: CS 6375 INSTRUCTOR: VIBHAV GOGATE October, 23 2013 The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run

More information

Bringing machine learning & compositional semantics together: central concepts

Bringing machine learning & compositional semantics together: central concepts Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding

More information

Handout 8: Computation & Hierarchical parsing II. Compute initial state set S 0 Compute initial state set S 0

Handout 8: Computation & Hierarchical parsing II. Compute initial state set S 0 Compute initial state set S 0 Massachusetts Institute of Technology 6.863J/9.611J, Natural Language Processing, Spring, 2001 Department of Electrical Engineering and Computer Science Department of Brain and Cognitive Sciences Handout

More information

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees Recap: Lexicalized PCFGs We now need to estimate rule probabilities such as P rob(s(questioned,vt) NP(lawyer,NN) VP(questioned,Vt) S(questioned,Vt)) 6.864 (Fall 2007): Lecture 5 Parsing and Syntax III

More information

Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs

Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs Junjie Cao, Sheng Huang, Weiwei Sun, Xiaojun Wan Institute of Computer Science and Technology Peking University September 5, 2017

More information

A proof theoretical account of polarity items and monotonic inference.

A proof theoretical account of polarity items and monotonic inference. A proof theoretical account of polarity items and monotonic inference. Raffaella Bernardi UiL OTS, University of Utrecht e-mail: Raffaella.Bernardi@let.uu.nl Url: http://www.let.uu.nl/ Raffaella.Bernardi/personal

More information

2. Linear Forces 3. Rotational Motion 4. Forces in fluids. 2. Sound Waves 3. Light Waves

2. Linear Forces 3. Rotational Motion 4. Forces in fluids. 2. Sound Waves 3. Light Waves Scope And Sequence Timeframe Unit Instructional Topics 6 Week(s) 6 Week(s) 6 Week(s) Ongoing Course The emphasis is on the role physics plays in everyday life, thus helping the student to better understand

More information

Semantics 2 Part 1: Relative Clauses and Variables

Semantics 2 Part 1: Relative Clauses and Variables Semantics 2 Part 1: Relative Clauses and Variables Sam Alxatib EVELIN 2012 January 17, 2012 Reviewing Adjectives Adjectives are treated as predicates of individuals, i.e. as functions from individuals

More information

Department of Computer Science and Engineering Indian Institute of Technology, Kanpur. Spatial Role Labeling

Department of Computer Science and Engineering Indian Institute of Technology, Kanpur. Spatial Role Labeling Department of Computer Science and Engineering Indian Institute of Technology, Kanpur CS 365 Artificial Intelligence Project Report Spatial Role Labeling Submitted by Satvik Gupta (12633) and Garvit Pahal

More information

Lecture 25: Cook s Theorem (1997) Steven Skiena. skiena

Lecture 25: Cook s Theorem (1997) Steven Skiena.   skiena Lecture 25: Cook s Theorem (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Prove that Hamiltonian Path is NP

More information

China Academic Journal Electronic Publishing House. All rights reserved. most ), (clause), ( discourse analysis)

China Academic Journal Electronic Publishing House. All rights reserved.   most ), (clause), ( discourse analysis) ,, ( Conversation Analysis),, (Discourse Grammar),, 20 80, (, Discourse Analysis/ Text Grammar), Brow and Yule Discourse Analysis,,,,,?,,,?,,,,,,, (naturally occurring data) (linguistic context) (extra2linguistic

More information

APHASIA and BRAIN ORGANIZA TION

APHASIA and BRAIN ORGANIZA TION APHASIA and BRAIN ORGANIZA TION APPLIED PSYCHOLINGUISTICS AND COMMUNICATION DISORDERS APPLIED PSYCHOLINGUISTICS AND MENTAL HEALTH Edited by R. W. Rieber PSYCHOLOGY OF LANGVAGE AND THOUGHT Essays on the

More information

CSE 505, Fall 2008, Midterm Examination 29 October Please do not turn the page until everyone is ready.

CSE 505, Fall 2008, Midterm Examination 29 October Please do not turn the page until everyone is ready. CSE 505, Fall 2008, Midterm Examination 29 October 2008 Please do not turn the page until everyone is ready. Rules: The exam is closed-book, closed-note, except for one side of one 8.5x11in piece of paper.

More information

CS626: NLP, Speech and the Web. Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: Parsing Algorithms 30 th August, 2012

CS626: NLP, Speech and the Web. Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: Parsing Algorithms 30 th August, 2012 CS626: NLP, Speech and the Web Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: Parsing Algorithms 30 th August, 2012 Parsing Problem Semantics Part of Speech Tagging NLP Trinity Morph Analysis

More information

On the Complexity of Input/Output Logic

On the Complexity of Input/Output Logic On the Complexity of Input/Output Logic Xin Sun 1 and Diego Agustín Ambrossio 12 1 Faculty of Science, Technology and Communication, University of Luxembourg, Luxembourg xin.sun@uni.lu 2 Interdisciplinary

More information

University of New Mexico Department of Computer Science. Final Examination. CS 561 Data Structures and Algorithms Fall, 2013

University of New Mexico Department of Computer Science. Final Examination. CS 561 Data Structures and Algorithms Fall, 2013 University of New Mexico Department of Computer Science Final Examination CS 561 Data Structures and Algorithms Fall, 2013 Name: Email: This exam lasts 2 hours. It is closed book and closed notes wing

More information

Springer-Verlag Berlin Heidelberg GmbH

Springer-Verlag Berlin Heidelberg GmbH Springer-Verlag Berlin Heidelberg GmbH Kazuhiro Arai The Economics of Education An Analysis of College-Going Behavior With 18 Figures Springer Kazuhiro Arai Professor of Economics Hitotsubashi University

More information