DOCSLIB.ORG

Tilburg University a Natural Proof System for Natural Language

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Tilburg University a Natural Proof System for Natural Language Tilburg University A Natural Proof System for Natural Language Abzianidze, Lasha Publication date: 2017 Document Version Publisher's PDF, also known as Version of record Link to publication in Tilburg University Research Portal Citation for published version (APA): Abzianidze, L. (2017). A Natural Proof System for Natural Language. Ridderprint. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Download date: 04. okt. 2021 A In the �tle of this thesis, a proof system refers to a system that carries out formal proofs (e.g., of theorems). Logicians would interpret a system as a symbolic calculus while com- Natural puter scien�sts might understand it as a computer program. Both interpreta�ons are fine for the current purpose as the thesis develops a proof calculi and a computer program A NATURAL PROOF SYSTEM based on it. What makes the proof system natural is that it operates on formulas with a natural appearance, i.e. resembling natural language phrases. This is contrasted to the Proof artificial formulas logicians usually use. Put differently, the natural proof system is FOR NATURAL LANGUAGE designed for a natural logic, a logic that has formulas similar to natural language sentenc- es. The natural proof system represents a further development of an analy�c tableau system for natural logic (Muskens, 2010). The implementa�on of the system acts as a System pp theorem prover for wide-coverage natural language sentences. For instance, it can prove x n that not all PhD theses are interesting entails some dissertations are not interesting. On z certain textual entailment datasets, the prover achieves results compe��ve to the y s state-of-the-art. t γT pp for zγ αF s Natural vp x t β e s vp t T F e np t s n e Language y z λ e s T t T z γ α z λα t n x e F e s T npα λ γ t x β y pp T pp y np x t γ e T n λ T s e x γ t T z F λ z y γ t T s e z e λ αn s β t T np α λ λ e F t α γ Lasha Abzianidze vp x s e s t vp pp F λ s y t z z T λ β n x αpp γ Lasha Abzianidze γ ISBN 978-94-6299-494-2 A Natural Proof System for Natural Language ISBN 978-94-6299-494-2 cb 2016 by Lasha Abzianidze Cover & inner design by Lasha Abzianidze Used item: leaf1 font by Rika Kawamoto Printed and bound by Ridderprint BV, Ridderkerk A Natural Proof System for Natural Language Proefschrift ter verkrijging van de graad van doctor aan Tilburg University op gezag van de rector magnificus, prof.dr. E.H.L. Aarts, in het openbaar te verdedigen ten overstaan van een door het college voor promoties aangewezen commissie in de aula van de Universiteit op vrijdag 20 januari 2017 om 14.00 uur door Lasha Abzianidze geboren op 24 januari 1987 te Tbilisi, Georgie¨ Promotiecommissie Promotor Prof. dr. J.M. Sprenger Copromotor Dr. R.A. Muskens Overige leden Prof. dr. Ph. de Groote Dr. R. Moot Prof. dr. L.S. Moss Prof. dr. Y. Winter Acknowledgments During working on this dissertation, there were many people who helped and supported me, both inside and outside the academic life. Here I would like to thank them. First, my sincere thanks go to my supervisors Jan and Reinhard. I learned a lot from them during this period. Their joint feedback and guidance were vital for my research. This dissertation would not have been possible without their input. Many thanks go to Reinhard who believed that I was a suitable candidate for his innovative research program. He continuously provided me with crucial advice and suggestions during the research. I thank him for believing in me and giving me a freedom to choose a more exciting and demanding research direction towards wide-coverage semantics. Jan gave me valuable and needed support in the later stage of the project. His comments and suggestions have significantly improved the presentation in the thesis. I also benefited from his advice about job applications. I am grateful to him. I feel very lucky to have so much expertise and leading researchers of my field on the committee. I am thankful to Philippe de Groote, Richard Moot, Larry Moss and Yoad Winter for that. Additionally, I am indebted to Philippe for his support during my LCT master study, and I want express my gratitude to Larry whose comments and opinion on my work has been inspiring. Special thanks go to my office mate Janine and my close friend Irakli who agreed to be my paranymphs. I also thank Janine for preparing delicious cakes and sweets for me. Irakli has been a friend I can rely on any time. I appreciate it. I acknowledge the valuable benefit and feedback I got from participating in several ESSLLI schools, attending and presenting at several workshops and conferences, among them LENLS, WoLLIC, EMNLP, TbiLLC, Amsterdam Colloquium, ACL and *SEM. The local TiLPS seminars were very helpful, where I presented early results of my re- search and widened my knowledge of logic, language and philosophy. My working environment and stay in Tilburg were enjoyable due to my colleagues at TiLPS: Alessandra, Alfred, Barbara, Bart, Chiara, Colin, Dominik, Georgi, Jan, Janine, Jasmina, Jun, Silvia, Machteld, Matteo, Michal, Naftali, Reinhard, and Thomas. Thank you guys; with you I enjoyed playing footy in the corridor, having drinks, dinners or parties, watching football, going on TiLPS excursions, or simply spending time together. I also want to thank my close friend Sandro, who was also doing his PhD meanwhile. The (skype) conversations with him were helpful, encouraging and entertaining for me. Many thanks go to my family on the other side of the continent. Especially I want to thank my mother, who always did her best to support and create conditions for me to feel comfortable and to concentrate on my studies. I am deeply grateful to her for everything. Finally and mostly, I would like to thank mu kallis Eleri for her continuous and endless support, patience and unconditional love during this period. She bared me when I was obsessed with research and writing. Her help and care have been indispensable for me. I cannot thank her enough. v vi Abstract We humans easily understand semantics of natural language text and make inferences based on it. But how can we make machines reason and carry out inferences on the text? The question represents a crucial problem for several research fields and is at the heart of the current thesis. One of the most intuitive approaches to model reasoning in natural language is to translate semantics of linguistic expressions into some formal logic that comes with an automated inference procedure. Unfortunately, designing such automatized translation turns out to be almost as hard as the initial problem of reasoning. In this thesis, following Muskens(2010), we develop a model for natural reasoning that takes a proof theoretic stand. Instead of a heavy translation procedure, we opt for a light-weight one. Logical forms obtained after the translation are natural in the sense that they come close to the original linguistic expressions. But at the same time, they represent terms of higher-order logic. In order to reason over such logical forms, we extend a tableau proof system for type theory by Muskens. An obtained natural tableau system employs inference rules specially tailored for various linguistic constructions. Since we employ the logical forms close to linguistic expressions, our approach con- tributes to the project of natural logic. Put differently, we employ the higher-order logic disguised as natural logic. Due to this hybrid nature, the proof system can carry out both shallow and deep reasoning over multiple-premised arguments. While doing so, a main vehicle for shallow reasoning is monotonicity calculus. In order to evaluate the natural proof system, we automatize it as a theorem prover for wide-coverage natural language text. In particular, first the logical forms are obtained from syntactic trees of linguistic expressions, and then they are processed by the prover. Despite its simple architecture, on certain textual entailment benchmarks the prover ob- tains high competitive results for both shallow and deep reasoning. Notice that this is done while it employs only WordNet as a knowledge base. The theorem prover also rep- resents the first wide-coverage system for natural logic which can reason over multiple propositions at the same time. The thesis makes three major contributions. First, it significantly extends the natu- ral tableau system for wide-coverage natural reasoning. After extending the type system and the format of tableau entries (Chapter 2), we collect a plethora of inference rules for a wide range of constructions (Chapter 4). Second, the thesis proposes a procedure to obtain the logical forms from syntactic derivations of linguistic expressions (Chapter 3).
Load more

Recommended publications
  • Expletive Negation Beyond Romance. Clausal Complementation and Epistemic Modality
    Expletive Negation beyond Romance. Clausal Complementation and Epistemic Modality. Maria-Margarita Makri Master of Arts (by Research) University of York Language and Linguistic Science December 2013 Abstract This thesis examines whether Expletive Negation (EN) in attitude contexts is in- deed semantically vacuous and which are its licensing conditions. By examining the crosslinguistic distribution of EN, I show that EN is not dependent on the mood specification of the embedded clause contra what has been previously argued (e.g. Abels 2005, Espinal 2000, Yoon 2011) but rather it is only licensed in tensed clauses. I show that EN complements are selected by predicates that also select for questions. I present new asymmetries between EN and that complements: more specifically, I show that epistemic modals are not licensed in EN complements, an attitude with an EN-complement cannot function as a felicitous answer, matrix negation has different scope in EN and non-EN clauses and that EN can be used instead of an epistemic in counterfactuals. Based on these asymmetries and the previously established necessary condition for tense, I propose that EN is an epistemic modal. EN actually indicates that the doxastic alternatives of the attitude holder are equally probably and thus the semantics of EN complements are very similar to that of embedded questions. Even though the distributions of embedded questions and EN complements largely overlap and the two constructions can be changed without any difference in the meaning I demonstrate that their distribution is not identical and thus further investigation is necessary. 2 List of Contents Abstract 2 List of Tables 6 List of Figures 7 Acknowledgments 8 Author's Declaration 9 1 Introduction 11 2 The empirical Picture: Environments that License Expletive Nega- tion 12 3 Background on Expletive Negation 19 4 Expletive Negation and Negative Concord 23 4.1 Background on Negative Concord and Negative words .
    [Show full text]
  • RASLAN 2017 Recent Advances in Slavonic Natural Language Processing
    RASLAN 2017 Recent Advances in Slavonic Natural Language Processing A. Horák, P. Rychlý, A. Rambousek (Eds.) RASLAN 2017 Recent Advances in Slavonic Natural Language Processing Eleventh Workshop on Recent Advances in Slavonic Natural Language Processing, RASLAN 2017 Karlova Studánka, Czech Republic, December 1–3, 2017 Proceedings Tribun EU 2017 Proceedings Editors Aleš Horák Faculty of Informatics, Masaryk University Department of Information Technologies Botanická 68a CZ-602 00 Brno, Czech Republic Email: [email protected] Pavel Rychlý Faculty of Informatics, Masaryk University Department of Information Technologies Botanická 68a CZ-602 00 Brno, Czech Republic Email: [email protected] Adam Rambousek Faculty of Informatics, Masaryk University Department of Information Technologies Botanická 68a CZ-602 00 Brno, Czech Republic Email: [email protected] This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the Czech Copyright Law, in its current version, and permission for use must always be obtained from Tribun EU. Violations are liable for prosecution under the Czech Copyright Law. Editors © Aleš Horák, 2017; Pavel Rychlý, 2017; Adam Rambousek, 2017 Typography © Adam Rambousek, 2017 Cover © Petr Sojka, 2010 This edition © Tribun EU, Brno, 2017 ISBN 978-80-263-1340-3 ISSN 2336-4289 Preface This volume contains the Proceedings of the Eleventh Workshop on Recent Advances in Slavonic Natural Language Processing (RASLAN 2017) held on December 1st–3rd 2017 in Karlova Studánka, Sporthotel Kurzovní, Jeseníky, Czech Republic.
    [Show full text]
  • A Natural Proof System for Natural Language
    A In the �tle of this thesis, a proof system refers to a system that carries out formal proofs (e.g., of theorems). Logicians would interpret a system as a symbolic calculus while com- Natural puter scien�sts might understand it as a computer program. Both interpreta�ons are fine for the current purpose as the thesis develops a proof calculi and a computer program A NATURAL PROOF SYSTEM based on it. What makes the proof system natural is that it operates on formulas with a natural appearance, i.e. resembling natural language phrases. This is contrasted to the Proof artificial formulas logicians usually use. Put differently, the natural proof system is FOR NATURAL LANGUAGE designed for a natural logic, a logic that has formulas similar to natural language sentenc- es. The natural proof system represents a further development of an analy�c tableau system for natural logic (Muskens, 2010). The implementa�on of the system acts as a System pp theorem prover for wide-coverage natural language sentences. For instance, it can prove x n that not all PhD theses are interesting entails some dissertations are not interesting. On z certain textual entailment datasets, the prover achieves results compe��ve to the y s state-of-the-art. t γT pp for zγ αF s Natural vp x t β e s vp t T F e np t s n e Language y z λ e s T t T z γ α z λα t n x e F e s T npα λ γ t x β y pp T pp y np x t γ e T n λ T s e x γ t T z F λ z y γ t T s e z e λ αn s β t T np α λ λ e F t α γ Lasha Abzianidze vp x s e s t vp pp F λ s y t z z T λ β n x αpp γ Lasha Abzianidze γ ISBN 978-94-6299-494-2 A Natural Proof System for Natural Language ISBN 978-94-6299-494-2 cb 2016 by Lasha Abzianidze Cover & inner design by Lasha Abzianidze Used item: leaf1 font by Rika Kawamoto Printed and bound by Ridderprint BV, Ridderkerk A Natural Proof System for Natural Language Proefschrift ter verkrijging van de graad van doctor aan Tilburg University op gezag van de rector magnificus, prof.dr.
    [Show full text]
  • Illocutionary Mood Marking in Sm'algyax
    Illocutionary mood marking in Sm’algyax Colin Brown UCLA Abstract In this paper I discuss a root-level clitic that occurs in wh-questions in Sm’algyax (Tsimshi- anic, VSO, also known as Coast Tsimshian), and analyse it as an overt instantiation of in- terrogative illocutionary mood, found in a let-peripheral position. I provide evidence for such a structure based on interrogative and non-interrogative uses of wh-words, embed- ded and coordinated questions, as well as the interaction between this clitic and other clitics associated with the evidential and mood system — providing compelling support for analyses that analyse illocutionary mood/speech acts as involving a syntactically pro- jected operator (Krika 2001; Speas & Tenny 2003; Farkas & Bruce 2010; Sauerland & Yat- sushiro 2017). 1 Introduction In this paper I discuss issues pertaining to the syntax/sentence mood interface via an investigation of questions and grammatical particles which appear in questions in Sm’algyax (Martitime Tsimshianic. ISO 639-3 language code: tsi, also known as Coast Tsimshian), and argue that the distribution of a particle =u in matrix, embedded, and coordinated questions supports analyses which encode the sentential force within the sentence’s syntactic representation (Krika 2001; Speas & Tenny 2003; Sauerland & Yat- sushiro 2017). Wh-questions in Sm’algyax are characterised by a wh-word or phrase appearing to the let of the predicate (contra declarative VSO word order as in (1)), and the appearance of a question particle (henceforth wh-particle) =u,
    [Show full text]
  • Searching for a Universal Constraint on the Possible Denotations of Clause-Embedding Predicates*
    Proceedings of SALT 30: 542–561, 2020 Searching for a universal constraint on the possible denotations of clause-embedding predicates* Floris Roelofsen Wataru Uegaki University of Amsterdam University of Edinburgh Abstract We propose a new cross-linguistic constraint on the relationship between the meaning of a clause-embedding predicate when it takes an interrogative com- plement and its meaning when it takes a declarative complement. According to this proposal, every clause-embedding predicate V satisfies a constraint that we refer to as P-TO-Q ENTAILMENT. That is, for any exhaustivity-neutral interrogative complement Q, if there is an answer p to Q such that px Vs pq, then it follows that px Vs Qq. We discuss empirical advantages of this proposal over existing proposals and explore potential counterexamples to P-TO-Q ENTAILMENT. Keywords: clause-embedding predicates, cross-linguistic semantics, linguistic universals. 1 Introduction A central question in semantics is whether there are any universal constraints on the possible denotations of lexical items of certain grammatical categories. This question has been investigated most prominently in the domain of determiners. For instance, it has been proposed that all determiners are ‘conservative’ and that all monomorphemic determiners are ‘monotonic’ (Barwise & Cooper 1981). Recent work has explored semantic universals in the domain of clause-embedding predicates like know, agree, and wonder (Spector & Egré 2015; Theiler, Roelofsen & Aloni 2018; Uegaki 2019; Steinert-Threlkeld 2020). Within this line of work, two basic questions can be distinguished. The first is empirical: Which constraints, if any, do we find in the semantics of clause-embedding predicates? The second is theoretical: What may explain such universal semantic constraints? The present paper is primarily concerned with the first question.
    [Show full text]
  • Interpreting Questions with Non-Exhaustive Answers
    Interpreting Questions with Non-exhaustive Answers A dissertation presented by Yimei Xiang to The Department of Linguistics in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Linguistics Harvard University Cambridge, Massachusetts May 2016 © 2016 – Yimei Xiang All rights reserved. iii Dissertation Advisor: Prof. Gennaro Chierchia Yimei Xiang Interpreting Questions with Non-exhaustive Answers Abstract This dissertation investigates the semantics of questions, with a focus on phenomena that challenge the standard views of the related core issues, as well as those that are technically difficult to capture under standard compositional semantics. It begins by re-examining several fundamental issues, such as what a question denotes, how a question is composed, and what a wh-item denotes. It then tackles questions with complex structures, including mention-some questions, multi-wh questions, and questions with quantifiers. It also explores several popular issues, such as variations of exhaustivity, sensitivity to false answers, and quantificational variability effects. Chapter 1 discusses some fundamental issues on question semantics. I pursue a hybrid categorial approach and define question roots as topical properties, which can supply propositional answers as well as nominal short answers. But different from traditional categorial approaches, I treat wh- items as existential quantifiers, which can be shifted into domain restrictors via a BeDom-operator. Moreover, I argue that the live-on set of a plural or number-neutral wh-item is polymorphic: it consists of not only individuals but also generalized conjunctions and disjunctions. Chapter 2 and 3 are centered on mention-some questions. Showing that the availability of mention-some should be grammatically restricted, I attribute the mention-some/mention-all ambi- guity of 3-questions to structural variations within the question nucleus.
    [Show full text]
  • (Syntax)–Semantics Part Two
    Current Issues in Generative Linguistics Syntax, Semantics, and Phonology edited by Joanna Błaszczak, Bożena Rozwadowska, and Wojciech Witkowski Contents About this volume part one: syntax Generative Linguistics in Wrocław (GLiW) series is published by the Center Ángel l. Jiménez-FernÁndez and Selçuk İşSever for General and Comparative Linguistics, a unit of the Institute of English at the University of Wrocław. Deriving A/A’-Effects in Topic Fronting: Intervention of Focus and Binding Address: nataša knežević Center for General and Comparative Linguistics (CGCL) Serbian Distributive Children ul. Kuźnicza 22 50-138 Wrocław, Poland Slavica kochovSka Two Kinds of Dislocated Topics in Macedonian about the series: Generative Linguistics in Wrocław (GLiW) is meant to provide a suitable forum for the presentation and discussion of the Pol- katarzyna miechowicz-mathiaSen ish research within the field of generative linguistics. We are interested in Licensing Polish Higher Numerals: An Account of the Accusative Hypothesis studies that employ generative methodology to the synchronic or diachronic analysis of phonology, semantics, morphology, and syntax. Apart from that, kathleen m. o’connor we express a keen interest in interdisciplinary research that is based on typol- On the Positions of Subjects and Floating Quantifiers in Appositives ogy, diachrony, and especially experimental methods taken from psycho- or neurolinguistics and applied so as to provide a psycholinguistic background yurie okami to purely theoretical research. We believe that the dissemination of ideas is Two Types of Modification and the Adnominal Modification in Japanese fundamental to any scientific advancement and thus our choice is to publish research studies in the form of ebooks, available for free on our website.
    [Show full text]
  • Person Features: Deriving the Inventory of Persons
    Chapter 2 Person Features: Deriving the Inventory of Persons 1. Introduction One long-standing aim of research into person has been to achieve a deeper understanding of the inventory of personal pronouns by decomposing them into a limited set of person features. The main aim of this chapter is to make a contribution to this enterprise. We will argue that a set of two privative person features is sufficient to derive the full inventory of attested pronouns and their interpretations, without generating non-attested pronouns. In chapter 1 we showed that the cross-linguistic inventory of attested persons is a small subset of the set of theoretically possible persons. The theoretically possible persons are those that can be formed by freely combining the speaker (for which we use the symbol i), associates of the speaker (ai), the addressee (u), associates of the addressee (au), and others (o). The generalizations that distinguish between the attested and non-attested persons are the following (repeated from (9) in chapter 1): (1) a. There is no person that contains associates of a participant but not the participant itself. b. There is no person that consists of others and only speaker(s) or of others and only addressee(s). c. No person system distinguishes pluralities containing a participant but not its associates from pluralities containing that participant as well as its associates. d. First and second person plural pronouns show an ‘associative effect’: any element contained in them other than i or u must be ai or au and cannot be o. 31 This leaves us with three persons with a singular interpretation and four persons with a plural interpretation.
    [Show full text]
  • Picky Predicates: Why Believe Doesn't Like Interrogative Complements, and Other Puzzles
    UvA-DARE (Digital Academic Repository) Picky predicates: why believe doesn't like interrogative complements, and other puzzles Theiler, N.; Roelofsen, F.; Aloni, M. DOI 10.1007/s11050-019-09152-9 Publication date 2019 Document Version Final published version Published in Natural Language Semantics License CC BY Link to publication Citation for published version (APA): Theiler, N., Roelofsen, F., & Aloni, M. (2019). Picky predicates: why believe doesn't like interrogative complements, and other puzzles. Natural Language Semantics, 27(2), 95-134. https://doi.org/10.1007/s11050-019-09152-9 General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:28 Sep 2021 Natural Language Semantics
    [Show full text]
  • Predicates of Relevance and Theories of Question Embedding Patrick D
    Predicates of relevance and theories of question embedding Patrick D. Elliott, Nathan Klinedinst, Yasutada Sudo, and Wataru Uegaki Background: Lahiri (2002) distinguishes two broad categories of question-embedding pred- icates: responsive and rogative predicates. Responsive predicates, such as know, tell, etc. tolerate both declarative and interrogative complements, whereas rogative predicates such as wonder, ask, etc. permit interrogative but not declarative complements. (1) a. Jeff knew fwhere Britta was j that Britta was outsideg. responsive b. Jeff wondered fwhere Britta was j *that Britta was outsideg. rogative There are two main theories of responsive predicates: (i) the standard analysis says that they semantically select for a proposition, which is taken to be the basic meaning of a declarative complement. Interrogative complements too denote (or come to denote) propositions (see e.g., Karttunen 1977, Groenendijk & Stokhof 1984, Heim 1994, Dayal 1996, Lahiri 2002, and Spec- tor & Egre´ 2015). (ii) an alternative analysis has recently been proposed by Uegaki (2015) (see also Roelofsen et al. 2015), according to which responsive predicates semantically select for a question, which is taken to be the basic meaning of an interrogative complement. Declarative complements come to denote a (resolved) question, i.e., a singleton set containing a proposi- tion. We argue that Predicates of Relevance (PoRs) favour the alternative approach. Predicates of relevance: PoRs, which include care, matter, and relevant, are compatible with both declarative and interrogative complements, as illustrated in (2). (2) a. Abed cares which girl left. interrogative embedding b. Abed cares that Annie left. declarative embedding We observe two problems that examples like (2) pose for the standard theory.
    [Show full text]
  • Cross-Linguistic Representations of Numerals and Number Marking∗
    Proceedings of SALT 20: 582–598, 2011 Cross-linguistic representations of numerals and number marking∗ Alan Bale Michaël Gagnon Concordia University University of Maryland Hrayr Khanjian Massachusetts Institute of Technology Abstract Inspired by Partee(2010), this paper defends a broad thesis that all mod- ifiers, including numeral modifiers, are restrictive in the sense that they can only restrict the denotation of the NP or VP they modify. However, the paper concentrates more narrowly on numeral modification, demonstrating that the evidence that moti- vated Ionin & Matushansky(2006) to assign non-restrictive, privative interpretations to numerals – assigning them functions that map singular sets to sets containing groups – is in fact consistent with restrictive modification. Ionin & Matushansky’s (2006) argument for this type of interpretation is partly based on the distribution of Turkish numerals which exclusively combine with singular bare nouns. Section 2 demonstrates that Turkish singular bare nouns are not semantically singular, but rather are unspecified for number. Western Armenian has similar characteristics. Building on some of the observations in section2, section3 demonstrates that re- strictive modification can account for three different types of languages with respect to the distribution of numerals and plural nouns: (i) languages where numerals exclusively combine with plural nouns (e.g., English), (ii) languages where they exclusively combine with singular bare nouns (e.g., Turkish), (iii) languages where they optionally combine with either type of noun (e.g., Western Armenian). Ac- counting for these differences crucially involves making a distinction between two kinds of restrictive modification among the numerals: subsective vs. intersective modification. Section3 also discusses why privative interpretations of numerals have trouble accounting for these different language types.
    [Show full text]
  • Ellipsis in Comparatives
    TITEL$0733 25-06-04 10:21:40 Titelei: SGG 72, Lechner META-Systems Ellipsis in Comparatives ≥ Studies in Generative Grammar 72 Editors Henk van Riemsdijk Harry van der Hulst Jan Koster Mouton de Gruyter Berlin · New York Ellipsis in Comparatives by Winfried Lechner Mouton de Gruyter Berlin · New York Mouton de Gruyter (formerly Mouton, The Hague) is a Division of Walter de Gruyter GmbH & Co. KG, Berlin. The series Studies in Generative Grammar was formerly published by Foris Publications Holland. Țȍ Printed on acid-free paper which falls within the guidelines of the ANSI to ensure permanence and durability. ISBN 3-11-018118-5 Bibliographic information published by Die Deutsche Bibliothek Die Deutsche Bibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data is available in the Internet at Ͻhttp://dnb.ddb.deϾ. Ą Copyright 2004 by Walter de Gruyter GmbH & Co. KG, D-10785 Berlin. All rights reserved, including those of translation into foreign languages. No part of this book may be reproduced in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Printed in Germany. Acknowledgments This book profited greatly from many stimulating discussions with and con- structive comments by numerous linguists. I would like to express my grati- tude for their invaluable contributions at various stages of this project to: Artemis Alexiadou, Elena Anagnostopoulou, Rajesh Bhatt, Jonathan
    [Show full text]