A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting
|
|
- Ethel Randall
- 5 years ago
- Views:
Transcription
1 A Multi-Modal Combinatory Categorial Grammar Analysis of Japanese Nonconstituent Clefting Department of Linguistics The Ohio State University
2 A basic cleft sentence Data Clefting Scrambling Complex predicates Ungrammaticality (1) Ken ga kono hon o yon-da. Ken NOM this book ACC read-past Ken read this book. (2) [Ken Ken It is this book that Ken read. ga t i yon-da] no wa [kono NOM read-past NMLZ TOP this (3) Template: A no wa B da. = A is B A: topic position ( old info ) B: focus position ( new info ) hon (o)] i book ACC da. COP
3 Clefting Scrambling Complex predicates Ungrammaticality Clefting different kinds of constituents (4) [ Ken ga yon-da] Ken NOM read-past It is this book that Ken read. no wa kono NMLZ TOP this (5) [ Kono hon o yon-da] this book ACC read-past It is Ken that read the book. no wa Ken NMLZ TOP Ken (6) [ Ken ga kono hon o mise-ta] Ken NOM this book ACC show-past It is to Mari that Ken showed this book. hon (o) da. book ACC COP (*ga) NOM da. COP no wa Mari NMLZ TOP Mari (7) [ Taroo ga hon o yomi-oe-ta] no wa tui Taro NOM book ACC read-finish-past NMLZ TOP just sakki da. a while ago COP It is just a while ago that Taro finished reading the book. ni da. DAT COP
4 Nonconstituent clefting Clefting Scrambling Complex predicates Ungrammaticality (8) [ Ken Ken himitu secret ga barasi-te NOM disclose o ACC da. COP simat-ta] no wa Mari ni sono EMPH-PAST NMLZ TOP Mari DAT that lit. It is to Mari that secret that Ken (inadvertently) disclosed. (which could answer What did Ken disclose to whom? ) (9) [ Sono himitu o barasi-te simat-ta] no wa Ken ga that secret ACC disclose EMPH-PAST NMLZ TOP Ken NOM Mari ni da. Mari DAT COP lit. It is Ken to Mari that (inadvertently) disclosed that secret. (which could answer Who disclosed that secret to whom? )
5 Nonconstituent clefting (cont.) Clefting Scrambling Complex predicates Ungrammaticality (10) [ Ken ga Mari Ken NOM Mari sono himitu o that secret ACC ni barasi-ta] no wa tikasitu DAT disclose-past NMLZ TOP basement da. COP de LOC lit. It is in the basement that secret that Ken disclosed to Mari. (which could answer Where did Ken disclose what to Mari? ) (11) [ Taroo ga happyoo-si-ta] no wa kyonen NELS Taro NOM present-do-past NMLZ TOP last-year NELS It is last year at NELS that Taro presented (a paper). de at da. COP
6 Scrambling in a simple sentence Clefting Scrambling Complex predicates Ungrammaticality (12) a. Ken ga sono hon o kat-ta. Ken NOM that book ACC buy-past Ken bought that book. b. Sono hon o Ken ga kat-ta. that book ACC Ken NOM buy-past Ken bought that book.
7 Clefting Scrambling Complex predicates Ungrammaticality Scrambling two nonconstituent arguments (13) [ Ken Ken himitu secret ga barasi-te NOM disclose o ACC da. COP simat-ta] no wa Mari EMPH-PAST NMLZ TOP Mari lit. It is to Mari that secret that Ken (inadvertently) disclosed. (which could answer What did Ken disclose to whom? ) ni sono DAT that (14) [ Ken ga barasi-te simat-ta] no wa sono himitu o Mari ni da.
8 Clefting Scrambling Complex predicates Ungrammaticality A basic complex predicate sentence V1 V2 (15) Ken ga Mari ni sono hon o yon-de morat-ta. Ken NOM Mari DAT that book ACC read-mkr BENEF-PAST Ken had Mari read that book for him.
9 Clefting with complex predicates Clefting Scrambling Complex predicates Ungrammaticality (16) a. [ Ken ga yon-de morat-ta] no wa Mari ni sono Ken NOM read-mkr BENEF-PAST NMLZ TOP Mari DAT that hon o da. book ACC COP lit. What Ken had read for him was Mari that book. b. * [ Ken ga Mari ni morat-ta] no wa sono hon o Ken NOM Mari DAT BENEF-PAST NMLZ TOP that book ACC yon-de da. read-mkr COP intended: What Ken had Mari do for him was read that book. c. * [ morat-ta] no wa Ken ga Mari ni sono hon o BENEF-PAST NMLZ TOP Ken NOM Mari DAT that book ACC yon-de da. read-mkr COP intended: What was done for him was that Ken had Mari read that book.
10 Ungrammatical cases of clefting Clefting Scrambling Complex predicates Ungrammaticality (17) * [ Morat-ta] no wa Ken BENEF-PAST NMLZ TOP Ken o ACC yon-de read-mkr da. COP ga Mari NOM Mari ni sono hon DAT that book lit. The thing that was done for the benefit of somebody was that Ken had Mari read that book for him. (18) * [ t i Hon o Taroo ga yon-da] no wa nagai i book ACC Taro NOM read-past NMLZ TOP long da. COP intended: lit. It is long that Taro read a book.
11 CCG Data Combinatory rules (19) Function Application a. A/B B A b. B A\B A (20) Type-Raising a. A B/(B\A) b. A B\(B/A) (21) Function Composition a. A/B B/C A/C b. B\C A\B A\C
12 Lexical entries Data From [Kubota and Smith, 2006]: (22) a. no: (S [ ] [ +N T \$)\(S N ] T \$) b. wa: (S [ ] [ +N +T \$)\(S +N ] T \$) c. da: (S [ T] \X)\(S [+T] /X)
13 Sample proof Data (23) Ken ga NP n watasi-ta S [ ] N T \NPa \NP d \NP n S [ ] < N T \NPa \NP d (S [ +N T S [ +N +T ] no [ \$)\(S N ] wa T \$) (S [ ] [ +N +T \$)\(S +N ] T \$) (S [ ] [ +N +T \$)\(S N ] FC T \$) ] < \NPa \NP d sono hon o NP a S [+T] /(S [+T] \NP a ) TR Mari ni NP d (S [+T] \NP a )/((S [+T] \NP a )\NP d ) TR S [+T] /((S [+T] \NP a )\NP d ) S [ T] \((S [+T] \NP a )\NP d ) FC da (S [ T] \X)\(S [+T] /X) < Ken ga watasi-ta no wa S [ ] sono hon o Mari ni da +N +T \NPa \NP d S [ T] \((S [+T] \NP a )\NP d ) < S [ T]
14 Overgeneration Data (24) hon o NP a NP a \(NP a /NP a ) TR S [ N T Taroo ga yon-da NP n S [ ] N T \NPa \NP n S [ ] < N T \NPa ] FC \(NPa /NP a ) (S [ +N T S [ ] +N +T \(NPa /NP a ) nagai NP/NP S [+T] /(S [+T] \(NP/NP)) TR da (S [ T] \X)\(S [+T] /X) < S [ T] \(S [+T] \(NP/NP)) ] no [ \$)\(S N ] wa T \$) (S [ ] [ +N +T \$)\(S +N ] T \$) (S [ ] [ +N +T \$)\(S N ] FC T \$) < hon o Taroo ga yon-da no wa S [ nagai da ] +N +T \(NPa /NP a ) S [ T] \(S [+T] \(NP/NP)) < S [ T]
15 MMCCG Data Framework Lexicon Proof Blocked proofs Multi-Modal Combinatory Categorial Grammar (MMCCG) [Baldridge, 2002]: introduces slash modalities manifests these modalities in lexical entries provides fine-grained structural control in terms of these modalities
16 Hierarchy of modes Data Framework Lexicon Proof Blocked proofs neither permutative nor associative left right associative associative permutative both permutative and associative
17 Framework Lexicon Proof Blocked proofs Combinatory rules with modalities (25) Function Application a. A/ B B A b. B A\ B A (26) Function Composition a. A/ B B/ C A/ C b. B\ C A\ B A\ C (27) Type-Raising a. A B/ i (B\ i A) b. A B\ i (B/ i A) (28) Permutation a. A/ B/ C$ A/ C/ B$ b. A\ B\ C$ A\ C\ B$
18 Lexical entries Data Framework Lexicon Proof Blocked proofs (29) a. morat-ta: S\NP n \NP d \ VP (V2 of complex predicate) b. yon-de: VP\NP a (V1 of complex predicate) c. nagai: NP/ NP (adjective) (/ and \ are the abbreviations for /. and \.)
19 Framework Lexicon Proof Blocked proofs Grammatical clefting with complex predicates (30) Ken ga NP n (V1) yon-de VP\NP a (dat) (acc) Mari ni sono hon o S [+T] /(S [+T] \NP d \NP a ) (V2) morat-ta S\NP n \NP d \ VP FC S\NP n \NP d \NP a Perm S\NP d \NP n \NP a Perm S\NP d \NP a \NP n no wa < S\NP d \NP a (S [ ] [ +N +T \$)\(S N ] T \$) S [ ] < +N +T \NPd \NP a da (S [ T] \X)\(S [+T] /X) < S [ T] \(S [+T] \NP d \NP a ) Ken ga yon-de morat-ta no wa S [+T] \NP d \NP a Mari ni sono hon o da S [ T] \(S [+T] \NP d \NP a ) S [ T] <
20 Framework Lexicon Proof Blocked proofs Ungrammatical clefting with complex predicates (1) (16b) (31) * [ Ken ga Mari ni morat-ta] no wa sono Ken NOM Mari DAT BENEF-PAST NMLZ TOP that hon o yon-de da. book ACC read-mkr COP intended: What Ken had Mari do for him was read that book. Mari ni NP d morat-ta S\NP n \NP d \ VP S\NP n \ VP\NP d *Perm
21 Framework Lexicon Proof Blocked proofs Ungrammatical clefting with complex predicates (2) (16c) *[ morat-ta] no wa Ken ga Mari ni sono hon BENEF-PAST NMLZ TOP Ken NOM Mari DAT that book yon-de o ACC da. COP read-mkr intended: What was done for him was that Ken had Mari read that book. (32) Mari ni NP d (S\NP n )/((S\NP n )\NP d ) TR sono hon o yon-de VP ((S\NP n )\NP d )/ (((S\NP n )\NP d )\ VP) TR *FC
22 Framework Lexicon Proof Blocked proofs Blocked derivation for adjective clefting (18) *[ t i Hon o Taroo ga yon-da] no wa nagai i da. book ACC Taro NOM read-past NMLZ TOP long COP intended: lit. It is long that Taro read a book. (33) hon o NP a NP a \ (NP a / NP a ) TR Taroo ga NP n yon-da S\NP n \NP a S\NP a \NP n Perm S\NP a < *FC
23 Data to nonconstituent clefting overgenerates in cases where clefting interacts with other phenomena (in particular, complex predicates). Accounting for these other phenomena requires the setup of MMCCG which distinguishes different combinatoric modes such as and. Once the analyses of these other phenomena are implemented in MMCCG, the simple analysis of clefting interacts with them to automatically yield correct results. Thus, the proposed analysis provides a springboard for developing a unified analysis of a range of linguistic phenomena that explains the interactions of different phenomena in a principled way.
24 Data Baldridge, J. (2002). Lexically Specified Derivational Control in Combinatory Categorial Grammar. PhD thesis, University of Edinburgh. [Available at Koizumi, M. (1995). Phrase Structure in Minimalist Syntax. PhD thesis, MIT. Kubota, Y. and Smith, E. A. (2006). Syntax and semantics of Japanese nonconstituent clefting in Combinatory Categorial Grammar. In Davis, C., Deal, A. R., and Zabbal, Y., editors, Proceedings of the Thrity-Sixth Annual Meeting of the North East Linguistic Society, pages , Amherst, MA. GLSA Publications. Moortgat, M. (1996). Categorial type logics. In van Benthem, J. and ter Meulen, A., editors, Handbook of Logic and Language, pages Elsevier, Amsterdam. Oehrle, R. T. (1998). Multi-modal type-logical grammar. To appear in R. Borsley and K. Borjars eds., Non-transformational Syntax. Blackwell. Steedman, M. (2000). The Syntactic Process. The MIT Press, Cambridge, Massachusetts.
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 informationIntroduction to Semantic Parsing with CCG
Introduction to Semantic Parsing with CCG Kilian Evang Heinrich-Heine-Universität Düsseldorf 2018-04-24 Table of contents 1 Introduction to CCG Categorial Grammar (CG) Combinatory Categorial Grammar (CCG)
More informationSurface Reasoning Lecture 2: Logic and Grammar
Surface Reasoning Lecture 2: Logic and Grammar Thomas Icard June 18-22, 2012 Thomas Icard: Surface Reasoning, Lecture 2: Logic and Grammar 1 Categorial Grammar Combinatory Categorial Grammar Lambek Calculus
More informationComputationele grammatica
Computationele grammatica Docent: Paola Monachesi Contents First Last Prev Next Contents 1 Unbounded dependency constructions (UDCs)............... 3 2 Some data...............................................
More informationLinguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar
Linguistics 819: Seminar on TAG and CCG Alexander Williams, 9 April 2008 Introduction to Combinatory Categorial Grammar Steedman and Dowty 1 The biggest picture Grammatical operations apply only to constituents.
More informationSharpening 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 informationTopics in Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple. Xerox PARC. August 1995
Projections and Semantic Interpretation Topics in Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox PARC August 199 Kaplan and Dalrymple, ESSLLI 9, Barcelona 1 Constituent structure
More informationScope parallelism in coordination in Dependent Type Semantics
Scope parallelism in coordination in Dependent Type Semantics Yusuke Kubota 1 Robert Levine 2 1 University of Tsukuba, Ohio State University 2 Ohio State University LENLS 12 Yusuke Kubota, Robert Levine
More informationAn introduction to mildly context sensitive grammar formalisms. Combinatory Categorial Grammar
An introduction to mildly context sensitive grammar formalisms Combinatory Categorial Grammar Gerhard Jäger & Jens Michaelis University of Potsdam {jaeger,michael}@ling.uni-potsdam.de p.1 Basic Categorial
More informationLambek Grammars as Combinatory Categorial Grammars
Lambek Grammars as Combinatory Categorial Grammars GERHARD JÄGER, Zentrum für Allgemeine Sprachwissenschaft (ZAS), Jägerstr 10/11, 10117 Berlin, Germany E-mail: jaeger@zasgwz-berlinde Abstract We propose
More informationA Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus
A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus Timothy A. D. Fowler Department of Computer Science University of Toronto 10 King s College Rd., Toronto, ON, M5S 3G4, Canada
More informationReflexives and non-fregean quantifiers
UCLA Working Papers in Linguistics, Theories of Everything Volume 17, Article 49: 439-445, 2012 Reflexives and non-fregean quantifiers Richard Zuber It is shown that depending on the subject noun phrase
More information1. Background. Task: Determine whether a given string of words is a grammatical (well-formed) sentence of language L i or not.
Constraints in Syntax [1] Phrase Structure and Derivations Düsseldorf LSA/DGfS Summerschool 2002 Gereon Müller (IDS Mannheim) gereon.mueller@ids-mannheim.de 1. Background Task: Determine whether a given
More informationIntroduction 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 informationCategorial Grammar. Larry Moss NASSLLI. Indiana University
1/37 Categorial Grammar Larry Moss Indiana University NASSLLI 2/37 Categorial Grammar (CG) CG is the tradition in grammar that is closest to the work that we ll do in this course. Reason: In CG, syntax
More informationCCG of Questions and Focus
CCG of Questions and Focus Sumiyo Nishiguchi School of Management Tokyo University of Science June 2, 2011 JSAI2011, Morioka, Japan 6/2/2011 Sumiyo Nishiguchi, JSAI2011 1 TABLE OF CONTENTS 1. Categories
More informationModel-Theory of Property Grammars with Features
Model-Theory of Property Grammars with Features Denys Duchier Thi-Bich-Hanh Dao firstname.lastname@univ-orleans.fr Yannick Parmentier Abstract In this paper, we present a model-theoretic description of
More informationQuantification: Quantifiers and the Rest of the Sentence
Ling255: Sem & Cogsci Maribel Romero February 17, 2005 Quantification: Quantifiers and the Rest of the Sentence 1. Introduction. We have seen that Determiners express a relation between two sets of individuals
More informationX-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 informationBringing 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 informationA 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 informationControl and Tough- Movement
Department of Linguistics Ohio State University February 2, 2012 Control (1/5) We saw that PRO is used for the unrealized subject of nonfinite verbals and predicatives where the subject plays a semantic
More informationCCG for Discourse. Sumiyo Nishiguchi. September 29, TbiLLC9, Kutaisi, Georgia. School of Management Tokyo University of Science
CCG for Discourse Sumiyo Nishiguchi School of Management Tokyo University of Science http://homepage3.nifty.com/sumiyo_nishiguchi/ September 29, 2011 TbiLLC9, Kutaisi, Georgia 9/29/2011 Sumiyo Nishiguchi,
More informationHPSG: Binding Theory
HPSG: Binding Theory Doug Arnold doug@essexacuk Introduction Binding Theory is to do with the syntactic restrictions on the distribution of referentially dependent items and their antecedents: reflexives/reciprocals
More informationThe Semantics of kara since and the Ambiguity of the teiru Construction
Tsukuba University September 2, 2004 The Semantics of kara since and the Ambiguity of the teiru Construction Kiyomi Kusumoto Hirosaki Gakuin University kusumoto@hirogaku-u.ac.jp 1. Japanese kara, English
More informationParasitic 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 informationThe Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ].
The Semantics of Definite DPs 1 Thus far, our semantics is able to interpret common nouns that occupy predicate position (1a). However, the most common position for common nouns to occupy is internal to
More informationOn 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 informationSemantics 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(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP].
CAS LX 522 Syntax I Fall 2000 September 18, 2000 Paul Hagstrom Week 2: Movement Movement Last time, we talked about subcategorization. (1) a. I can solve this problem. b. This problem, I can solve. (2)
More informationWord Order and the Floating Quantifier in Cebuano
Word Order and the Floating Quantifier in Cebuano Yumiko Ishikawa 1. Introduction The sentential subject long had been considered to be base-generated in Spec IP and to be assigned nominative Case under
More informationA Supertag-Context Model for Weakly-Supervised CCG Parser Learning
A Supertag-Context Model for Weakly-Supervised CCG Parser Learning Dan Garrette Chris Dyer Jason Baldridge Noah A. Smith U. Washington CMU UT-Austin CMU Contributions 1. A new generative model for learning
More informationn-ary Quantifiers and the Expressive Power of DP-Compositions
Research on Language and Computation (2005) 3:411 428 Springer 2006 DOI 10.1007/s11168-006-0005-9 n-ary Quantifiers and the Expressive Power of DP-Compositions SEUNGHO NAM Department of Linguistics, Seoul
More informationParsing with CFGs L445 / L545 / B659. Dept. of Linguistics, Indiana University Spring Parsing with CFGs. Direction of processing
L445 / L545 / B659 Dept. of Linguistics, Indiana University Spring 2016 1 / 46 : Overview Input: a string Output: a (single) parse tree A useful step in the process of obtaining meaning We can view the
More informationParsing with CFGs. Direction of processing. Top-down. Bottom-up. Left-corner parsing. Chart parsing CYK. Earley 1 / 46.
: Overview L545 Dept. of Linguistics, Indiana University Spring 2013 Input: a string Output: a (single) parse tree A useful step in the process of obtaining meaning We can view the problem as searching
More informationBar-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 informationContinuations 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 informationControl and Tough- Movement
Control and Tough- Movement Carl Pollard February 2, 2012 Control (1/5) We saw that PRO is used for the unrealized subject of nonfinite verbals and predicatives where the subject plays a semantic role
More informationIntroduction to Semantics. Common Nouns and Adjectives in Predicate Position 1
Common Nouns and Adjectives in Predicate Position 1 (1) The Lexicon of Our System at Present a. Proper Names: [[ Barack ]] = Barack b. Intransitive Verbs: [[ smokes ]] = [ λx : x D e. IF x smokes THEN
More informationCategorial Grammar. Algebra, Proof Theory, Applications. References Categorial Grammar, G. Morrill, OUP, 2011.
Categorial Grammar Algebra, Proof Theory, Applications References Categorial Grammar, G. Morrill, OUP, 2011. - The Logic of Categorial Grammars, R. Moot & Ch. Retore, Springer, FoLLI, 2012. Mehrnoosh Sadrzadeh
More informationModels 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 informationFocus 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 informationCAS LX 500 Topics in Linguistics: Questions Spring 2006 March 2, b: Prosody and Japanese wh-questions
CAS LX 500 Topics in Linguistics: Questions Spring 2006 March 2, 2006 Paul Hagstrom 7b: Prosody and Japanese wh-questions Prosody by phase Prosody and syntax seem to fit quite tightly together. Ishihara,
More informationSharpening 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 informationCompositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095
Compositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095 1543 kracht@humnet.ucla.edu 1. The Questions ➀ Why does
More informationProseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification
1. Introduction Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification (1) The Importance of Scha (1981/1984) The first modern work on plurals (Landman 2000) There are many ideas
More informationCounting Coordination Categorially
Counting Coordination Categorially Crit Cremers and Maarten Hijzelendoorn Department of General Linguistics Leiden University P.O. Box 9515, 2300 RA Leiden The Netherlands e-mail: {cremers, hijzelendrn}@rullet.leidenuniv.nl
More informationSemantics and Generative Grammar. Expanding Our Formalism, Part 1 1
Expanding Our Formalism, Part 1 1 1. Review of Our System Thus Far Thus far, we ve built a system that can interpret a very narrow range of English structures: sentences whose subjects are proper names,
More informationClass Notes: Tsujimura (2007), Ch. 5. Syntax (1), pp (3) a. [[akai hon]-no hyooshi] b. [akai [hon-no hyooshi]]
Class otes: Tsujimura (2007), Ch. 5. yntax (1), pp. 206-220 p. 206 What is!ytx"?! n area in linguistics that deals with the REGULRLITY of how words are put together to create grammatical sentences What
More informationFertilization 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 informationGalois Connections in Categorial Type Logic
Galois Connections in Categorial Type Logic Raffaella Bernardi joint work with Carlos Areces and Michael Moortgat Contents 1 Introduction.............................................. 4 2 Residuated operators
More informationA Computational Approach to Minimalism
A Computational Approach to Minimalism Alain LECOMTE CLIPS-IMAG BP-53 38041 Grenoble, cedex 9, France Email: Alain.Lecomte@upmf-grenoble.fr Abstract The aim of this paper is to recast minimalist principles
More informationUnifying Adjunct Islands and Freezing Effects in Minimalist Grammars
Unifying Adjunct Islands and Freezing Effects in Minimalist Grammars Tim Hunter Department of Linguistics University of Maryland TAG+10 1 / 26 Goal of This Talk Goal Present a unified account of two well-known
More informationPerson Case Constraints and Feature Complexity in Syntax
Person Case Constraints and Feature Complexity in Syntax Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University University of Vienna January 9, 2014 What is the PCC? Person Case Constraint
More informationSemantics 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 informationEnglish Pronominal Affixes in Logical Grammar
Department of Linguistics The Ohio State University October 15, 2010 Overview and Selected Data The Unaccented Pronoun Constraint (current data adapted and extended from [Zwi86]) Reduced pronouns in question
More informationParsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford)
Parsing Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) S N VP V NP D N John hit the ball Levels of analysis Level Morphology/Lexical POS (morpho-synactic), WSD Elements
More informationUnterspezifikation 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 informationThe Lambek-Grishin calculus for unary connectives
The Lambek-Grishin calculus for unary connectives Anna Chernilovskaya Utrecht Institute of Linguistics OTS, Utrecht University, the Netherlands anna.chernilovskaya@let.uu.nl Introduction In traditional
More information(1) Agreement and Non-agreement Languages: Focus, broadly conceived, is computationally equivalent to agreement.
On the EPP I Shigeru Miyagawa September 28, 2004 (1) Agreement and Non-agreement Languages: Focus, broadly conceived, is computationally equivalent to agreement. (2) (i) EPP and Agreement: e.g., Indo-European
More informationScope Ambiguities through the Mirror
Scope Ambiguities through the Mirror Raffaella Bernardi In this paper we look at the interpretation of Quantifier Phrases from the perspective of Symmetric Categorial Grammar. We show how the apparent
More informationLecture 5: Semantic Parsing, CCGs, and Structured Classification
Lecture 5: Semantic Parsing, CCGs, and Structured Classification Kyle Richardson kyle@ims.uni-stuttgart.de May 12, 2016 Lecture Plan paper: Zettlemoyer and Collins (2012) general topics: (P)CCGs, compositional
More informationPast-as-Past in Japanese Counterfactuals
Past-as-Past in Japanese Counterfactuals Teruyuki Mizuno Stefan Kaufmann University of Connecticut CLS 54, April 2018 1 / 27 Outline 1 Introduction English: basic observations Japanese: some examples 2
More informationSeminar 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 informationComplexity of the Lambek Calculus and Its Fragments
Complexity of the Lambek Calculus and Its Fragments Mati Pentus Department of Mathematical Logic and Theory of Algorithms Faculty of Mechanics and Mathematics Moscow State University 119991, Moscow, Russia
More informationMovement and alternatives don t mix: Evidence from Japanese
Movement and alternatives don t mix: Evidence from Japanese Michael Yoshitaka Erlewine National University of Singapore mitcho@nus.edu.sg Hadas Kotek New York University hadas.kotek@nyu.edu Amsterdam Colloquium
More informationComputational Coverage of TLG: The Montague Test
Computational Coverage of TLG: The Montague Test Glyn Morrill and Oriol Valentín Universitat Politècnica de Catalunya Barcelona Abstract This paper reports on the empirical coverage of Type Logical Grammar
More informationTHE LOGIC OF CATEGORIAL GRAMMARS
THE LOGIC OF CATEGORIAL GRAMMARS Christian Retoré IRISA (INRIA-Rennes) retore@irisa.fr Campus Universitaire de Beaulieu 35042 Rennes cedex LECTURE NOTES European Summer School in Logic, Language and Information,
More informationOutline. Darou as an entertain modal with a shiftable deictic agent. Rising Declaratives: darou. Falling Declaratives: darou. an inquisitive approach
0 Darou as an entertain modal with a shiftable deictic agent an inquisitive approach Yurie Hara Waseda/Hokkaido University The 25th Japanese/Korean Linguistics Conference Hara (W/H) Darou JK25 1 / 48 Hara
More informationIntensionality. 1. Intensional Propositional Logic (IntPL).
Ling255: Sem and CogSci Maribel Romero April 5, 2005 1. Intensional Propositional Logic (IntPL). Intensionality Intensional PL adds some operators O to our standard PL. The crucial property of these operators
More information2013 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 informationAfirstexample. [ VP respects Fong] : [λy.λx.respect(x, y)](fong) = λx.respect(x, fong) [β red.]
Afirstexample Lexicon Grammar Kathy, NP: kathy S : β(α) NP : α VP : β Fong, NP: fong VP : β(α) V : β NP : α respects, V: λy.λx.respect(x, y) VP : β V : β runs, V: λx.run(x) 2 Afirstexample S:respect(kathy,
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More information(5) Ú who á = people context = {John, Mary, } cf. Ú John á = John. knowing who bought what Syntax/Semantics of Questions, March 23, 1999
Some consequences of Paul Hagstrom knowing who bought what Syntax/Semantics of Questions, March 23, 1999 (5) Ú who á = people context = {John, Mary, } cf. Ú John á = John Purportedly, this is about Hagstrom
More informationEntropy. Leonoor van der Beek, Department of Alfa-informatica Rijksuniversiteit Groningen. May 2005
Entropy Leonoor van der Beek, vdbeek@rug.nl Department of Alfa-informatica Rijksuniversiteit Groningen May 2005 What is entropy? Entropy is a measure of uncertainty or surprise or disorder. Entropy was
More informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
More informationParsing Beyond Context-Free Grammars: Tree Adjoining Grammars
Parsing Beyond Context-Free Grammars: Tree Adjoining Grammars Laura Kallmeyer & Tatiana Bladier Heinrich-Heine-Universität Düsseldorf Sommersemester 2018 Kallmeyer, Bladier SS 2018 Parsing Beyond CFG:
More informationScope parallelism in coordination in Dependent Type Semantics
Scope parallelism in coordination in Dependent Type Semantics Yusuke Kubota 1 and Robert Levine 2 1 University of Tsukuba, Ohio State University 2 Ohio State University
More informationLecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
More informationWhat is a natural syntactic model for frame-semantic composition?
What is a natural syntactic model for frame-semantic composition? Timm Lichte, Laura Kallmeyer & Rainer Osswald University of Düsseldorf, Germany CTF14, August 26, 214 SFB 991 1 / 26 Overview natural syntax
More informationTowards Abstract Categorial Grammars
Towards Abstract Categorial Grammars Philippe de Groote LORIA UMR n o 7503 INRIA Campus Scientifique, B.P. 239 54506 Vandœuvre lès Nancy Cedex France degroote@loria.fr Abstract We introduce a new categorial
More informationSharpening 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 informationLing 5801: Lecture Notes 7 From Programs to Context-Free Grammars
Ling 5801: Lecture otes 7 From Programs to Context-Free rammars 1. The rules we used to define programs make up a context-free grammar A Context-Free rammar is a tuple C,X,S,R, where: C is a finite set
More informationProceedings for ESSLLI 2015 Workshop Empirical Advances in Categorial Grammar (CG 2015)
Proceedings for ESSLLI 2015 Workshop Empirical Advances in Categorial Grammar (CG 2015) Yusuke Kubota University of Tsukuba Ohio State University kubota.yusuke.fn@u.tsukuba.ac.jp Robert Levine Ohio State
More informationMovement-Generalized Minimalist Grammars
Movet-Generalized Minimalist Grammars Thomas Graf tgraf@ucla.edu tgraf.bol.ucla.edu University of California, Los Angeles LACL 2012 July 2, 2012 Outline 1 Monadic Second-Order Logic (MSO) Talking About
More informationGeneralized Discontinuity
Generalized Discontinuity Glyn Morrill 1 and Oriol Valentín 2 1 Departament de Llenguatges i Sistemes Informàtics Universitat Politècnica de Catalunya morrill@lsi.upc.edu, http: //www-lsi.upc.edu/~morrill/
More informationThe Complexity of First-Order Extensible Dependency Grammar
The Complexity of First-Order Extensible Dependency Grammar Ralph Debusmann Programming Systems Lab Universität des Saarlandes Postfach 15 11 50 66041 Saarbrücken, Germany rade@ps.uni-sb.de Abstract We
More informationTwo kinds of long-distance indefinites Bernhard Schwarz The University of Texas at Austin
Amsterdam Colloquium 2001, December 17-19, 2001 Two kinds of long-distance indefinites Bernhard Schwarz The University of Texas at Austin 1. Introduction Indefinites can often be interpreted as if they
More informationOn relational interpretation of multi-modal categorial logics
Gerhard Jäger 1 On relational interpretation of multi-modal categorial logics Gerhard Jäger Gerhard.Jaeger@let.uu.nl Utrecht Institute of Linguistics (OTS) September 27, 2001 Gerhard Jäger 2 1 Outline
More informationCS 712: Topics in NLP Linguistic Phrases and Statistical Phrases
CS 712: Topics in NLP Linguistic Phrases and Statistical Phrases Pushpak Bhattacharyya, CSE Department, IIT Bombay 18 March, 2013 (main text: Syntax by Adrew Carnie, Blackwell Publication, 2002) Domination
More informationControlling Extraction in Abstract Categorial Grammars
Controlling Extraction in Abstract Categorial Grammars Sylvain Pogodalla 1 and Florent Pompigne 2 1 sylvain.pogodalla@inria.fr LORIA/INRIA Nancy Grand Est 2 florent.pompigne@loria.fr LORIA/Nancy Université
More informationC SC 620 Advanced Topics in Natural Language Processing. Lecture 21 4/13
C SC 620 Advanced Topics in Natural Language Processing Lecture 21 4/13 Reading List Readings in Machine Translation, Eds. Nirenburg, S. et al. MIT Press 2003. 19. Montague Grammar and Machine Translation.
More informationTHE LANGUAGE OF FUNCTIONS *
PRECALCULUS THE LANGUAGE OF FUNCTIONS * In algebra you began a process of learning a basic vocabulary, grammar, and syntax forming the foundation of the language of mathematics. For example, consider the
More informationA DOP Model for LFG. Rens Bod and Ronald Kaplan. Kathrin Spreyer Data-Oriented Parsing, 14 June 2005
A DOP Model for LFG Rens Bod and Ronald Kaplan Kathrin Spreyer Data-Oriented Parsing, 14 June 2005 Lexical-Functional Grammar (LFG) Levels of linguistic knowledge represented formally differently (non-monostratal):
More informationQuantification in the predicate calculus
Quantification in the predicate calculus PHIL 43916 eptember 5, 2012 1. The problem posed by quantified sentences... 1 2. yntax of PC... 2 3. Bound and free iables... 3 4. Models and assignments... 4 5.
More informationSEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL
SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL Linguistics Department, Stanford University Department of Philosophy, Göteborg University peters csli.stanford.edu, dag.westerstahl phil.gu.se
More informationThe Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple
The Formal Architecture of Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox Palo Alto Research Center 1. Kaplan and Dalrymple, ESSLLI 1995, Barcelona Architectural Issues Representation:
More informationFregean Compositionality MCMP, June 2015 Thomas Ede Zimmermann (Goethe University, Frankfurt)
Fregean Compositionality MCMP, June 2015 Thomas Ede Zimmermann (Goethe University, Frankfurt) 1. Background (1a) John seeks a unicorn. P(Δ John, O(Δ seeks,δ a unicorn ) (c) Q(Δ a unicorn, Δ John seeks
More information564 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 informationD2: For each type 1 quantifier Q, Q acc (R) = {a : Q(aR) = 1}.
Some Formal Properties of Higher Order Anaphors R. Zuber Laboratoire de Linguistique Formelle, CNRS and University Paris-Diderot Richard.Zuber@linguist.univ-paris-diderot.fr Abstract Formal properties
More information