The second volume in the Vancouver Studies in Cognitive Science series, this collection presents recent work in the fields of phonology, morphology, semantics, and neurolinguistics. Its overall theme is the relationship between the contents of grammatical formalisms and their real-time realizations in machine or biological systems. Individual essays address such topics as learnability, implementability, computational issues, parameter setting, and neurolinguistic issues. Contributors include Janet Dean Fodor, Richard T. Oehrle, Bob Carpenter, Edward P. Stabler, Elan Dresher, Arnold Zwicky, Mary-Louis Kean, and (...) Lewis P. Shapiro. (shrink)

The formal sciences, particularly mathematics, have had a profound influence on the development of linguistics. This insightful overview looks at techniques that were introduced in the fields of mathematics, logic and philosophy during the twentieth century, and explores their effect on the work of various linguists. In particular, it discusses the 'foundations crisis' that destabilised mathematics at the start of the twentieth century, the numerous related movements which sought to respond to this crisis, and how they influenced the development (...) of syntactic theory in the 1950s. The book concludes by discussing the resulting major consequences for syntactic theory, and provides a detailed reassessment of Chomsky's early work at the advent of Generative Grammar. Informative and revealing, this book will be invaluable to all those working in formal linguistics, in particular those interested in its history and development. (shrink)

In this paper, I will be arguing that the basic infrastructure of an ineffable formal identity between name and object which is presented in the Tractatus is still very much involved in Wittgenstein's early development of the concept of grammar. First, it will be necessary to clearly describe how the identity between name and object is initially formulated in the Tractatus. Hence, in section 1, I will show how the 'picture theory' is ontologically grounded on the identity of linguistics' (...) and worldly atomic structural elements. I will discuss the ‘picture theory’ only briefly, since my main interest is to illuminate how that infrastructure remains a core aspect of Wittgenstein's “middle period” thinking: that is, in what way the identity of name and object is contained and presupposed within his concept of grammar and how it is still used as a condition for our symbolism to make sense. Another way to describe this paper's aim, this time from its end backwards, would be to say that it is to reveal that grammatical systems of rules are nothing other than the implementations of that special kind of identity, for the latter is always and already manifest within our symbolism. (shrink)

This paper sketches or signals some ideas, results, and proposals connected with the theoretical issues related to the categorial approach to language which originated from the first author and which form the basis for further research by the second author. The main aims are the following: 1) to bring into common use some Polish ideas concerned with classical categorial grammar; 2) to take into consideration a universal and simultaneously formal-logical perspective; 3) to consider Peirce's well-known differentiation of linguistic objects, (...) i.e. their twofold ontological status as tokens and types and, according to this, to consider the biaspectual formalization of language dealing with the two main orientations in the controversy between nominalism and Platonism; 4) to characterize language according to Frege's ontological canons, according to which each expression of language corresponds to its denotation. All of these factors make possible not only the syntactic characterization of language but also the introduction of syntactic and semantic definitions of a true expression and its denotation. These notions correspond here to the old classical, but not necessarily standard, understanding of semantic concepts. The paper is divided into four sections: the first contains a brief characterization of the categorial approach to syntax; the second presents two strains of this approach; the third touches on certain general semantic issues connected with the notion of truth; and the last gives some final remarks. (shrink)

Could a computer be programmed to make moral judgments about cases of intentional harm and unreasonable risk that match those judgments people already make intuitively? If the human moral sense is an unconscious computational mechanism of some sort, as many cognitive scientists have suggested, then the answer should be yes. So too if the search for reflective equilibrium is a sound enterprise, since achieving this state of affairs requires demarcating a set of considered judgments, stating them as explanandum sentences, and (...) formulating a set of algorithms from which they can be derived. The same is true for theories that emphasize the role of emotions or heuristics in moral cognition, since they ultimately depend on intuitive appraisals of the stimulus that accomplish essentially the same tasks. Drawing on deontic logic, action theory, moral philosophy, and the common law of tort, particularly Terry's five-variable calculus of risk, I outline a formal model of moral grammar and intuitive jurisprudence along the foregoing lines, which defines the abstract properties of the relevant mapping and demonstrates their descriptive adequacy with respect to a range of common moral intuitions, which experimental studies have suggested may be universal or nearly so. Framing effects, protected values, and implications for the neuroscience of moral intuition are also discussed. (shrink)

A generative grammar for a language L generates one or more syntactic structures for each sentence of L and interprets those structures both phonologically and semantically. A widely accepted assumption in generative linguistics dating from the mid-60s, the Generative Grammar Hypothesis, is that the ability of a speaker to understand sentences of her language requires her to have tacit knowledge of a generative grammar of it, and the task of linguistic semantics in those early days was taken to be that (...) of specifying the form that the semantic component of a generative grammar must take. Then in the 70s linguistic semantics took a curious turn. Without rejecting GGH, linguists turned away from the task of characterizing the semantic component of a generative grammar to pursue instead the Montague-inspired project of providing for natural languages the same kind of model-theoretic semantics that logicians devise for the artificial languages of formal systems of logic, and “formal semantics” continues to dominate semantics in linguistics. This essay argues that the sort of compositional meaning theory that would verify GGH would not only be quite different from the theories formal semanticists construct, but would be a more fundamental theory that supersedes those theories in that it would explain why they are true when they are true, but their truth wouldn’t explain its truth. Formal semantics has undoubtedly made important contributions to our understanding of such phenomena as anaphora and quantification, but semantics in linguistics is supposed to be the study of meaning. This means that the formal semanticist can’t be unconcerned that the kind of semantic theory for a natural language that interests her has no place in a theory of linguistic competence; for if GGH is correct, then the more fundamental semantic theory is the compositional meaning theory that is the semantic component of the internally represented generative grammar, and if that is so, then linguistic semantics has so far ignored what really ought to be its primary concern. (shrink)

We consider the use ofevolving algebra methods of specifying grammars for natural languages. We are especially interested in distributed evolving algebras. We provide the motivation for doing this, and we give a reconstruction of some classic grammar formalisms in directly dynamic terms. Finally, we consider some technical questions arising from the use of direct dynamism in grammar formalisms.

A generative grammar for a language L generates one or more syntactic structures for each sentence of L and interprets those structures both phonologically and semantically. A widely accepted assumption in generative linguistics dating from the mid-60s, the Generative Grammar Hypothesis , is that the ability of a speaker to understand sentences of her language requires her to have tacit knowledge of a generative grammar of it, and the task of linguistic semantics in those early days was taken to be (...) that of specifying the form that the semantic component of a generative grammar must take. Then in the 70s linguistic semantics took a curious turn. Without rejecting GGH, linguists turned away from the task of characterizing the semantic component of a generative grammar to pursue instead the Montague-inspired project of providing for natural languages the same kind of model-theoretic semantics that logicians devise for the artificial languages of formal systems of logic, and “formal semantics” continues to dominate semantics in linguistics. This essay argues that the sort of compositional meaning theory that would verify GGH would not only be quite different from the theories formal semanticists construct, but would be a more fundamental theory that supersedes those theories in that it would explain why they are true when they are true, but their truth wouldn’t explain its truth. Formal semantics has undoubtedly made important contributions to our understanding of such phenomena as anaphora and quantification, but semantics in linguistics is supposed to be the study of meaning. This means that the formal semanticist can’t be unconcerned that the kind of semantic theory for a natural language that interests her has no place in a theory of linguistic competence; for if GGH is correct, then the more fundamental semantic theory is the compositional meaning theory that is the semantic component of the internally represented generative grammar, and if that is so, then linguistic semantics has so far ignored what really ought to be its primary concern. (shrink)

This article summarizes the main ideas for formalizing categorial languages genrated by classical categorial grammar originated by K. Ajdukiewicz [1935,1960].This formalization is presented in detail in the author's monographs in Polish "Teorie Języków Syntaktycznie Kategorialnych" ("Theories of Syntactically Categorical Languages"), PWN, Warszawa-Wrocław 1985 and in English "Theory of Language Syntax, Categorial Approach", Kluwer Academic Publishers, Boston-London-Dordrecht 1991.

Since a human language consists of an infinite number of sentences, it cannot be adequately described by enumeration. Hence, as Chomsky wrote in the first paragraph of his first book, Syntactic Structures, an adequate description of a language is approached through the specification of a generative device that will generate and structurally describe all the sentences of a language. And since generative devices form a hierarchy in terms of descriptive power, the basic question of grammar is what is the minimum (...) of power needed to generate human languages. What this book does is describe the Chomsky hierarchy in a very clear and accessible way. Finite state grammars are shown to be equivalent in generative power to regular phrase structure grammars. After context free, and context sensitive phrase structure grammars, one finds at the top of the hierarchy transformational grammars, which Kimball has shown to be weakly equivalent to a universal phrase structure grammar, i.e., one in which rules can delete items. This last equivalence allows one to appreciate the central problem in current grammatical theory: that the "standard theory" of Aspects of the Theory of Syntax allows so much power for the construction of grammars that solutions become arbitrary and non-empirical, and hence the problem is to find a principled minimization of the power of transformational grammars. This is a clear, up-to-date, and elegant little book. One admirably suitable as a comparatively undemanding introduction to the abstract theory of grammar, or as a way of brushing-up on the subject.—J.L. (shrink)

Whether pattern-parsing mechanisms are specific to language or apply across multiple cognitive domains remains unresolved. Formal language theory provides a mathematical framework for classifying pattern-generating rule sets (or “grammars”) according to complexity. This framework applies to patterns at any level of complexity, stretching from simple sequences, to highly complex tree-like or net-like structures, to any Turing-computable set of strings. Here, we explored human pattern-processing capabilities in the visual domain by generating abstract visual sequences made up of abstract tiles (...) differing in form and color. We constructed different sets of sequences, using artificial “grammars” (rule sets) at three key complexity levels. Because human linguistic syntax is classed as “mildly context-sensitive,” we specifically included a visual grammar at this complexity level. Acquisition of these three grammars was tested in an artificial grammar-learning paradigm: after exposure to a set of well-formed strings, participants were asked to discriminate novel grammatical patterns from non-grammatical patterns. Participants successfully acquired all three grammars after only minutes of exposure, correctly generalizing to novel stimuli and to novel stimulus lengths. A Bayesian analysis excluded multiple alternative hypotheses and shows that the success in rule acquisition applies both at the group level and for most participants analyzed individually. These experimental results demonstrate rapid pattern learning for abstract visual patterns, extending to the mildly context-sensitive level characterizing language. We suggest that a formal equivalence of processing at the mildly context sensitive level in the visual and linguistic domains implies that cognitive mechanisms with the computational power to process linguistic syntax are not specific to the domain of language, but extend to abstract visual patterns with no meaning. (shrink)

We present a rendering of some common grammatical formalisms in terms of evolving algebras. Though our main concern in this paper is on constraint-based formalisms, we also discuss the more basic case of context-free grammars. Our aim throughout is to highlight the use of evolving algebras as a specification tool to obtain grammar formalisms.

We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a second-order operation in the case of linear context-free tree grammars, and as a third-order operation in the case of (...) linear context-free rewriting systems. This suggest the possibility of defining an Abstract Categorial Hierarchy. (shrink)

Programming is a relevant semiotic activity, resulting in millions of lines of written code: the whole digital revolution is still rooted in writing as a semiotic activity. In relation to this, AI applications based on deep learning do not present particular features. They are standard computer programs relying on the von Neumann/Turing architecture. Yet there is an interesting epistemological difference. A distinction can be made between classical programming and machine learning. As the task for programming is always problem solving, in (...) classical programming, the programmer has to input rules and data in order to gather answers in output. A machine learning approach requires a different epistemological wiring: the programmer inputs data and the required answers, while the software learns or discovers the rules. These two approaches to programming can be characterized from a semiotic perspective by referring to the couple “grammar” versus “text” and “allography” versus “autography.” A grammar defines a set of rules to be applied so that an output is generated that is formally consistent with the prescribed rules. Rather, a text acts as an example from which to infer regularities in order to generate a new text. This epistemological shift on the computation side is coupled with an analogous one on the user side. As data, that is – semiotically – texts, are the driving force, users have to focus on sets of examples in order to cope with the algorithms. The contribution discusses this shift by taking into account the relative changes in agency. (shrink)

It is the aim of INDICES to document recent explorations in the various fields of philosophical logic and formal linguistics and their applications in other disciplines. The main emphasis of this series is on self-contained monographs covering particular areas of recent research and surveys of methods, problems, and results in all fields of inquiry where recourse to logical analysis and logical methods has been fruitful. INDICES will contain monographs dealing with the central areas of philosophical logic (extensional and intensional (...) systems, indexical logics, non-classical logics, philosophy of logic, etc.) as well as studies in which these systems are applied to specific issues in philosophy, in the formal semantics of natural languages, the foundations of linguistic theory, in computational linguistics, and in theoretical computer science. Constructive type theory was first presented in 1970, by the Swedish logician Per Martin-Lof. It has become one of the main approaches used in the foundations of mathematics and computer science. But it has remained relatively unknown among linguists and philosophers, although it provides a considerable extension of the concepts and techniques of logic. The book first gives an introduction to type theory from the point of view of linguistics and the philosophy of language. Type theory is then applied in the areas of quantification, anaphora, temporal reference, and the structure of text and discourse. By virtue of the type-theoretical concepts of proof object and context, various phenomena of dependence and progression in language can be discussed in precise terms, and several well-known problems can be solved. A categorial grammar is presented togenerate formally a fragment of English, together with an example of a computer implementation. (shrink)

Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that (...) guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms. (shrink)

Traditional grammar and current theoretical approaches towards modelling grammatical knowledge ignore language in interaction: that is, words such as huh, eh, yup or yessssss. This groundbreaking book addresses this gap by providing the first in-depth overview of approaches towards interactional language across different frameworks and linguistic sub-disciplines. Based on the insights that emerge, a formal framework is developed to discover and compare language in interaction across different languages: the interactional spine hypothesis. Two case-studies are presented: confirmationals and response markers, (...) both of which show evidence for systematic grammatical knowledge. Assuming that language in interaction is regulated by grammatical knowledge sheds new light on old questions concerning the relation between language and thought and the relation between language and communication. It is essential reading for anyone interested in the relation between language, cognition and social interaction. (shrink)

Much ado – and increased complexity – is generally the case when it comes to checking formally the (intended) meaning of programs, as formal semantics for programs are typically extrinsic to both them and the formal grammars that generate the programming languages in which they are written. The van Wijngaarden grammars, on the contrary, have an intrinsic semantics in the sense that their rules contain or express the (intended) meaning of the terminal strings generated by them. (...) This intrinsicness allows for preservation of meaning both in syntactic change and context-sensitive conditions. In order better to show the intrinsicness of the semantics of the van Wijngaarden grammars I contrast them with the attribute grammars, a frequent choice when the semantic analysis of programming languages is called for (e.g., in compilation). (shrink)

Taking as its starting point significant similarities between a formal language model—Grammar Systems—and a grammatical theory—Autolexical Syntax—in this paper we suggest the application of the former to the topic of the latter. To show the applicability of Grammar Systems Theory to grammatical description, we introduce a formal-language-theoretic framework for the architecture of natural language grammar: Linguistic Grammar Systems. We prove the adequacy of this model by highlighting its features (modularity, parallelism, interaction) and by showing the similarity between this (...) framework and accepted and well-known grammatical models (e.g. Autolexical Syntax). (shrink)

Expressiveness and decidability are two core aspects of programming languages that should be thoroughly known by those who use them; this includes knowledge of their metalanguages a.k.a. formal grammars. The van Wijngaarden grammars (WGs) are capable of generating all the languages in the Chomsky hierarchy and beyond; this makes them a relevant tool in the design of (more) expressive programming languages. But this expressiveness comes at a very high cost: The syntax of WGs is extremely complex and (...) the decision problem for the generated languages is generally unsolvable. With this in mind, I provide here a short primer of the syntax of WGs, which includes syntactic restrictions that guarantee decidability for the corresponding generated languages. (shrink)

This article describes an approach to connectionist language research that relies on the development of grammar formalisms rather than computer models. From formulations of the fundamental theoretical commitments of connectionism and of generative grammar, it is argued that these two paradigms are mutually compatible. Integrating the basic assumptions of the paradigms results in formal theories of grammar that centrally incorporate a certain degree of connectionist computation. Two such grammar formalisms—Harmonic Grammar and Optimality Theory —are briefly introduced to illustrate grammar‐based (...) approaches to connectionist language research. The strengths and weaknesses of grammar‐based research and more traditional model‐based research are argued to be complementary, suggesting a significant role for both strategies in the spectrum of connectionist language research. (shrink)

This is a thesis in formal semantics. It consists of two parts corresponding to the distinction, due to Richard Montague, between universal grammar and specific semantic theories. The first part concerns universal grammar and is intended to provide a precise and unified conceptual framework within which different theories of formal semantics can be represented and compared. ;The second part of the thesis is concerned with intensional logic, i.e., with the logical analysis of discourse involving so called oblique contexts. (...) These contexts are characterized by the apparent failure of certain classically valid principles of substitutivity. Two kinds of reactions among logicians to the appearance of oblique contexts in natural languages are distinguished: (1) the intensional point of view, according to which oblique contexts are seen as genuine counterexamples to classical logic and to the related semantical principle of extensionality: the principle that the denotation of an expression is a function of the denotations of its parts; and (2) the extensional point of view, according to which the conflict between oblique contexts and classical logic is only apparent. The extensional point of view therefore calls for analyses of oblique contexts that preserve the laws of classical logic and the principle of extensionality. In this thesis, we are concerned with the precise formulation of and comparison between different programs for the formal semantic representation of oblique contexts. In Chapter 5, we are concerned with Church's program of representing oblique contexts within a formal language whose semantics is fully extensional and based on Frege's distinction between sense and denotation. The ambiguity between the "direct" and "indirect" denotation of an expression A is avoided by letting A be replaced in oblique contexts by an expression which denotes A's ordinary sense. We provide a possible-worlds semantics for a version of Church's formal language with the following features: (i) Objectual quantification into oblique constructions is accounted for. The treatment of quantification requires for each entity x an essence of x, by which we mean a sense which determines x in those worlds in which x exists and is undefined in all other worlds. (ii) The variables range over actually existing entities only. It is allowed that entities of certain types are contingent, i.e., the same entity may exist in one world and fail to exist in other worlds. (iii) In order to combine a proper treatment of the cross-world identification of functions with varying domains, partial functions are allowed. (iv) Senses are allowed to be partially defined. For example, the sense of a proper name is undefined in a world in which the denotation of the name does not exist. (v) Senses of functions from objects of type a to objects of type b are identified with functions from senses of objects of type a to senses of objects of type b. In Chapters 6 and 7, we pursue the Russellian Alternative in intensional semantics, where a sense/denotation distinction is avoided. Apparent failures of substitutivity principles for singular terms are explained along the lines of Russell's theory of definite descriptions. Failures of substitutivity of coextensional sentences and predicates are explained by Russell's doctrine that sentences and predicate denote propositions and propositional functions , respectively. Russellian semantics is fully extensional in the sense that the Russellian denotation of a designator is a function of the Russellian denotations of its parts. In Chapter 6, a theory of Russellian propositions is developed within set theory. This theory is then applied in Chapter 7 to the task of providing a set-theoretic semantics for Russellian type theory. (shrink)

We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a second-order operation in the case of linear context-free tree grammars, and as a third-order operation in the case of (...) linear context-free rewriting systems. This suggest the possibility of defining an Abstract Categorial Hierarchy. (shrink)

It is sometimes said that questions of form are questions of logic or language. In his "Logical Investigations" Husserl, however, clearly distinguished formal ontology from formal grammar and formal logic. The article attempts to explain Husserl's notion of formal ontology. It investigates the relation between formal and material ontology as well as the relation between epistemic and metaphysical necessity. The article provides an interpretation of Husserl's claim that there are metaphysical necessities which are necessarily recognized (...) by the human mind on the basis of Husserl's well-known distinction between the meanings of mental acts and their objective correlates. (shrink)

The essays in this collection are the outgrowth of a workshop, held in June 1976, on formal approaches to the semantics and pragmatics of natural languages. They document in an astoundingly uniform way the develop ments in the formal analysis of natural languages since the late sixties. The avowed aim of the' workshop was in fact to assess the progress made in the application of formal methods to semantics, to confront different approaches to essentially the same problems (...) on the one hand, and, on the other, to show the way in relating semantic and pragmatic explanations of linguistic phenomena. Several of these papers can in fact be regarded as attempts to close the 'semiotic circle' by bringing together the syntactic, semantic and pragmatic properties of certain constructions in an explanatory framework thereby making it more than obvious that these three components of an integrated linguistic theory cannot be as neatly separated as one would have liked to believe. In other words, not only can we not elaborate a syntactic description of (a fragment of) a language and then proceed to the semantics (as Montague pointed out already forcefully in 1968), we cannot hope to achieve an adequate integrated syntax and semantics without paying heed to the pragmatic aspects of the constructions involved. The behavior of polarity items, 'quantifiers' like any, conditionals or even logical particles like and and or in non-indicative sentences is clear-cut evidence for the need to let each component of the grammar inform the other. (shrink)

Husserl’s Logical Grammar is intended to explain how complex expressions can be constructed out of simple ones so that their meaning turns out to be determined by the meanings of their constituent parts and the way they are put together. Meanings are thus understood as structured contents and classified into formal categories to the effect that the logical properties of expressions reflect their grammatical properties. As long as linguistic meaning reduces to the intentional content of pre-linguistic representations, however, it (...) is not trivial to account for how semantics relates to syntax in this context. In this paper, I analyze Husserl’s Logical Grammar as a system of recursive rules operating on representations and suggest that the syntactic form of representations contributes to their semantics because it carries information about semantic role. I further discuss Husserl’s syntactic account of the unity of propositions and argue that, on this account, logical form supervenes on syntactic form. In the last section I draw some implications for the phenomenology of thought and conjecture that the structural features it displays are likely to convey the syntactic structures of an underlying language-like representational system. (shrink)

Cognitive Science, Volume 46, Issue 2, February 2022.

In this paper we show that the membership problem for second order non-linear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of λ-terms and presents an interest in its own.

What is the nature of a conceptual scheme? Are there alternative conceptual schemes? If so, are some more justifiable or correct than others? The later Wittgenstein already addresses these fundamental philosophical questions under the general rubric of "grammar" and the question of its "arbitrariness"--and does so with great subtlety. This book explores Wittgenstein's views on these questions. Part I interprets his conception of grammar as a generalized version of Kant's transcendental idealist solution to a puzzle about necessity. It also seeks (...) to reconcile Wittgenstein's seemingly inconsistent answers to the question of whether or not grammar is arbitrary by showing that he believed grammar to be arbitrary in one sense and non-arbitrary in another. Part II focuses on an especially central and contested feature of Wittgenstein's account: a thesis of the diversity of grammars. The author discusses this thesis in connection with the nature of formal logic, the limits of language, and the conditions of semantic understanding or access. Strongly argued and cleary written, this book will appeal not only to philosophers but also to students of the human sciences, for whom Wittgenstein's work holds great relevance. (shrink)

This paper provides a précis of Ernst Cassirer’s concept of art as a symbolic form. It does so, though, in a specific respect. It points to the fact that Cassirer’s concept of “symbolic form” is two-sided. On the one hand, the concept captures general cultural phenomena that are not only meaningful but also manifest the way man makes sense of the world; thus myth, religion, and art are considered general symbolic forms. On the other hand, it captures the formal (...) structures and semiotic tools thanks to which meaning is constructed within each general symbolic form ; thus, in art, perspective or the golden section are well-known examples of symbolic forms, now in a narrow sense, i.e. they are means to configure parts into an organized, meaningful whole. The paper will comment on art along both these two dimensions, but its main goal is to provide with concrete examples of aesthetic symbolic forms in the narrow sense in order to show how conceptual meaning can be inscribed in the space of aesthetic intuition. (shrink)

In recent years, the study of formal semantics and formal pragmatics has grown tremendously showing that core aspects of language meaning can be explained by a few principles. These principles are grounded in the logic that is behind - and tightly intertwined with - the grammar of human language. In this book, some of the most prominent figures in linguistics, including Noam Chomsky and Barbara H. Partee, offer new insights into the nature of linguistic meaning and pave the (...) way for the further development of formal semantics and formal pragmatics. Each chapter investigates various dimensions in which the logical nature of human language manifests itself within a language and/or across languages. Phenomena like bare plurals, free choice items, scalar implicatures, intervention effects, and logical operators are investigated in depth and at times cross-linguistically and/or experimentally. This volume will be of interest to scholars working within the fields of semantics, pragmatics, language acquisition and psycholinguistics. (shrink)

Jackendoff's account of relating linguistic structure and brain structure is too restricted in concentrating on formal features of computational requirements, neglecting the achievements of various types of neuroscientific modelling. My own approaches to neuronal models of syntactic organization show how these requirements could be met. The book's lack of discussion of a sound philosophy of the relation is briefly mentioned.

We introduce _Interleave-Disjunction-Lock parallel multiple context-free grammars_ (IDL-PMCFG), a novel grammar formalism designed to describe the syntax of free word order languages that allow for extensive interleaving of grammatical constituents. Though interleaved constituents, and especially the so-called hyperbaton, are common in several ancient (Classical Latin and Greek, Sanskrit...) and modern (Hungarian, Finnish...) languages, these syntactic structures are often difficult to express in existing formalisms. The IDL-PMCFG formalism combines Seki et al.’s parallel multiple context-free grammars (PMCFG) with Nederhof and Satta’s (...) IDL expressions. We define the semantics of IDL-PMCFGs and study their expressivity, proving that IDL-PMCFG extends both PMCFG and IDL-CFG (context-free grammars equipped with IDL expressions) and that IDL-PMCFG parsing is \(\mathrm {NP}\) -hard. We then introduce COMPĀ, a programming language extending Ranta’s Grammatical Framework (GF) and built as a high-level front-end formalism to IDL-PMCFG for practical grammar development. We present a parsing algorithm for IDL-PMCFG inspired by earlier Earley-style PMCFG parsing algorithms and Nederhof and Satta’s IDL graphs and give a worst-case estimate of its complexity as a function of several metrics on IDL expressions, the size of the input and a new notion of the _G_-density of a language. (shrink)

Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different such tools are being increasingly used in order to accelerate and simplify proof checking, and the Coq proof assistant is one of the most well known and used in large-scale projects. Language and automata theory is a well-established area of mathematics, relevant to computer science foundations and information technology. In particular, context-free language (...) theory is of fundamental importance in the analysis, design, and implementation of computer programming languages. This work describes a formalization effort, using the Coq proof assistant, of fundamental results of the classical theory of contextfree grammars and languages. These include closure properties (union, concatenation, and Kleene star), grammar simplification (elimination of useless symbols, inaccessible symbols, empty rules, and unit rules), the existence of a Chomsky Normal Form for context-free grammars and the Pumping Lemma for context-free languages. The result is an important set of libraries covering the main results of context-free language theory, with more than 500 lemmas and theorems fully proved and checked. As it turns out, this is a comprehensive formalization of the classical context-free language theory in the Coq proof assistant and includes the formalization of the Pumping Lemma for context-free languages. The perspectives for the further development of this work are diverse and can be grouped in three different areas: inclusion of new devices and results, code extraction, and general enhancements of its libraries. (shrink)

While rules and exemplars are usually viewed as opposites, this paper argues that they form end points of the same distribution. By representing both rules and exemplars as (partial) trees, we can take into account the fluid middle ground between the two extremes. This insight is the starting point for a new theory of language learning that is based on the following idea: If a language learner does not know which phrase‐structure trees should be assigned to initial sentences, s/he allows (...) (implicitly) for all possible trees and lets linguistic experience decide which is the “best” tree for each sentence. The best tree is obtained by maximizing “structural analogy” between a sentence and previous sentences, which is formalized by the most probable shortest combination of subtrees from all trees of previous sentences. Corpus‐based experiments with this model on the Penn Treebank and the Childes database indicate that it can learn both exemplar‐based and rule‐based aspects of language, ranging from phrasal verbs to auxiliary fronting. By having learned the syntactic structures of sentences, we have also learned the grammar implicit in these structures, which can in turn be used to produce new sentences. We show that our model mimicks children’s language development from item‐based constructions to abstract constructions, and that the model can simulate some of the errors made by children in producing complex questions. (shrink)

Lambek categorial grammars is a class of formal grammars based on the Lambek calculus. Pentus proved in 1993 that they generate exactly the class of context-free languages without the empty word. In this paper, we study categorial grammars based on the Lambek calculus with the permutation rule LP. Of particular interest is the product-free fragment of LP called the Lambek-van Benthem calculus LBC. Buszkowski in his 1984 paper conjectured that grammars based on the Lambek-van Benthem (...) calculus (LBC-grammars for short) generate exactly permutation closures of context-free languages. In this paper, we disprove this conjecture by presenting a language generated by an LBC-grammar that is not a permutation closure of any context-free language. Firstly, we introduce an ad-hoc modification of vector addition systems called linearly-restricted branching vector addition systems with states and additional memory (LRBVASSAMs for short) and prove that the latter are equivalent to LBC-grammars. Then we construct an LRBVASSAM that generates a non-semilinear set and thus disprove Buszkowski’s conjecture. Since Buszkowski’s conjecture is false, not so much is known about the languages generated by LBC-grammars or by LP-grammars. The equivalence of LRBVASSAMs and LBC-grammars allows us to establish a number of their properties. We show that LP-grammars generate the same class of languages as LBC-grammars; that is, removing product from LP does not decrease expressive power of corresponding categorial grammars. We also prove that this class of languages is closed under union, intersection, concatenation, and Kleene plus. (shrink)

 Language is a human instinct.   All societies have complex language, and everywhere the languages use the same kinds of grammatical machinery like nouns, verbs, auxiliaries, and agreement. All normal children develop language without conscious effort or formal lessons, and by the age of three they speak in  fluent  grammatical  sentences, outperforming the most sophisticated computers. Brain damage or congenital conditions can make a person a linguistic savant while severely retarded, or unable to speak (...) normally despite high intelligence. All this has led many scientists,  beginning with the linguist Noam Chomsky in the late 1950's, to conclude that there are specialized circuits in the human brain, and perhaps specialized genes, that create the gift of articulate speech.Â. (shrink)

This book addresses fundamental issues in linguistic theory, including the relation between formal and cognitive approaches, the autonomy of syntax, the content of universal grammar, and the value of generative and functional approaches to grammar. It focuses on the grammar of case relations, signalled by morphological case, prepositions, and word order. Part I offers a critical history of modern grammars of case, focussing on the last four decades and setting this in the context of earlier, including ancient, developments. (...) The subjects considered include the evolution of ideas concerning deep structure and semantic and grammatical relations, and arguments for the maintenance of the traditional central position of case in the grammar. In parts II and III Professor Anderson examines the category of case and central unresolved issues in the grammar of case. The latter include questions relating to the idea of an ontologically-based grammar, particularly the degree to which syntactic categories and relationships are grounded in meaning, and the notion of linguistic creativity. This involves a consideration of the way in which cases may be identified and whether their distribution is determined through semantics. The book sheds new light on the interactions between meaning and grammar and on the structure and development of lexical and grammatical systems. The argument and its far-reaching consequences will be of wide interest to linguists, philosophers and others seeking to understand the workings of language. (shrink)