Anaphora And Type Logical Grammar

Type Logical Grammar is a framework that emerged from the synthesis of two traditions: Categorial Grammar from formal linguistics and substructural logics from logic. Grammatical composition is conceived as resource conscious logical deduction. Such a grammar is necessarily surface oriented and lexicalistic. The Curry-Howard correspondence supplies an elegant compositional mapping from syntax to semantics. Anaphora does not seem to fit well into this framework. In type logical deductions, each resource is used exactly once. Anaphora, however, is a phenomenon where semantic resources are used more than once. Generally admitting the multiple use of lexical resources is not possible because it would lead to empirical inadequacy and computational intractability. This book develops a hybrid architecture that allows to incorporate anaphora resolution into grammatical deduction while avoiding these consequences. To this end, the grammar logic is enriched with a connective that specifically deals with anaphora. After giving a self-contained introduction into Type Logical Grammar in general, the book discusses the formal properties of this connective. In the sequel, Jäger applies this machinery to numerous linguistic phenomena pertaining to the interaction of pronominal anaphora, VP ellipsis and quantification. In the final chapter, the framework is extended to indefiniteness, specificity and sluicing.

Type Logical Grammar is a framework that emerged from the synthesis of two traditions: Categorial Grammar from formal linguistics and substructural logics from logic. Grammatical composition is conceived as resource conscious logical deduction. Such a grammar is necessarily surface oriented and lexicalistic. The Curry-Howard correspondence supplies an elegant compositional mapping from syntax to semantics. Anaphora does not seem to fit well into this framework. In type logical deductions, each resource is used exactly once. Anaphora, however, is a phenomenon where semantic resources are used more than once. Generally admitting the multiple use of lexical resources is not possible because it would lead to empirical inadequacy and computational intractability. This book develops a hybrid architecture that allows to incorporate anaphora resolution into grammatical deduction while avoiding these consequences. To this end, the grammar logic is enriched with a connective that specifically deals with anaphora. After giving a self-contained introduction into Type Logical Grammar in general, the book discusses the formal properties of this connective. In the sequel, Jäger applies this machinery to numerous linguistic phenomena pertaining to the interaction of pronominal anaphora, VP ellipsis and quantification. In the final chapter, the framework is extended to indefiniteness, specificity and sluicing.

Geert-Jan Kruijff & Richard T. Oehrle A categorial grammar is both a grammar and a type inference system. As a result of this duality, the categorial framework offers a natural setting in which to study questions of grammatical composition, both empirically and abstractly. There are affinities in this perspective, of course, to basic questions in formal language theory. But the fact that categorial grammars are type in ference systems makes possible intrinsic connections among syntactic types, syntactic type inference, semantic types, and semantic type inference, a con nection less apparent in the standard constructions of formal language theory. Fixing a system of grammatical type inference T, we may explore what gram matical phenomena are compatible with T-and equally, what grammatical phenomena are not. Equally, fixing a class of grammatical phenomena g, we may seek to ascertain what systems of type inference characterize g. This dual perspective is a strong current in the categorial literature, going back to the classical papers of Ajdukiewicz, Bar-Hillel, Curry, and Lambek.

In The Dynamics of Meaning, Gennaro Chierchia tackles central issues in dynamic semantics and extends the general framework. Chapter 1 introduces the notion of dynamic semantics and discusses in detail the phenomena that have been used to motivate it, such as "donkey" sentences and adverbs of quantification. The second chapter explores in greater depth the interpretation of indefinites and issues related to presuppositions of uniqueness and the "E-type strategy." In Chapter 3, Chierchia extends the dynamic approach to the domain of syntactic theory, considering a range of empirical problems that includes backwards anaphora, reconstruction effects, and weak crossover. The final chapter develops the formal system of dynamic semantics to deal with central issues of definites and presupposition. Chierchia shows that an approach based on a principled enrichment of the mechanisms dealing with meaning is to be preferred on empirical grounds over approaches that depend on an enrichment of the syntactic apparatus. Dynamics of Meaning illustrates how seemingly abstract stances on the nature of meaning can have significant and far-reaching linguistic consequences, leading to the detection of new facts and influencing our understanding of the syntax/semantics/pragmatics interface.

This book constitutes the refereed proceedings of the 20th and 21st International Conference on Formal Grammar 2015 and 2016, collocated with the European Summer School in Logic, Language and Information in August 2015/2016. The 19 revised full papers presented together with 2 invited talks were carefully reviewed and selected from a total of 34 submissions. The focus of papers are as follows: Formal and computational phonology, morphology, syntax, semantics and pragmatics Model-theoretic and proof-theoretic methods in linguistics Logical aspects of linguistic structure Constraint-based and resource-sensitive approaches to grammar Learnability of formal grammar Integration of stochastic and symbolic models of grammar Foundational, methodological and architectural issues in grammar and linguistics Mathematical foundations of statistical approaches to linguistic analysis

This book provides a state-of-the-art introduction to categorial grammar, a type of formal grammar which analyses expressions as functions or according to a function-argument relationship. The book's focus is on linguistic, computational, and psycholinguistic aspects of logical categorial grammar, i.e. enriched Lambek Calculus. Glyn Morrill opens with the history and notation of Lambek Calculus and its application to syntax, semantics, and processing. Successive chapters extend the grammar to a number of significant syntactic and semantic properties of natural language. The final part applies Morrill's account to several current issues in processing and parsing, considered from both a psychological and a computational perspective. The book offers a rigorous and thoughtful study of one of the main lines of research in the formal and mathematical theory of grammar, and will be suitable for students of linguistics and cognitive science from advanced undergraduate level upwards.

The conference series Logical Aspects of Computational Linguistics (LACL) aims at providing a forum for the presentation and discussion of current research in all the formal and logical aspects of computational linguistics. The LACL initiative started with a workshop held in Nancy (France) in 1995. Selected papers from this event have appeared as a special issue of the Journal of Logic Language and Information, Volume 7(4), 1998. In 1996, LACL shifted to the format of an international conference. LACL’96 and ’97 were both held in Nancy (France). The proceedings appeared as volumes 1328 and 1582 of the Springer Lecture Notes in Arti cial Intelligence. This volume contains selected papers of the third international conference on Logical Aspects of Computational Linguistics (LACL’98), held in Grenoble, France, from December 14 to 16, 1998. The conference was organized by the U- versity Pierre Mend es-France (Grenoble 2) together with LORIA (Laboratoire Lorrain d’Informatique et Applications, Nancy). On the basis of 33 submitted 4-page abstracts, the Program Committee selected 19 contributions for pres- tation. In addition to the selected papers, the program featured three invited talks, by Maarten de Rijke (ILLC, Amsterdam), Makoto Kanazawa (Chiba U- versity, Japan), and Fernando Pereira (AT&T Labs). After the conference, the contributors were invited to submit a full paper for the conference proceedings.

This book constitutes the refereed proceedings of the 6th International Conference on Logical Aspects of Computational Linguistics, LACL 2011, held in Montpellier, France, in June/July 2011. The 18 revised full papers presented were carefully reviewed and selected from 31 submissions. The papers address a wide range of logical and formal methods in computational linguistics such as type-theoretic grammars, dependency grammars, formal language theory, grammatical inference, minimalism, generation, and lexical and formal semantics.