The ‘Galilean Style in Science’ and the Inconsistency of Linguistic Theorising

Chomsky’s principle of epistemological tolerance says that in theoretical linguistics contradictions between the data and the hypotheses may be temporarily tolerated in order to protect the explanatory power of the theory. The paper raises the following problem: What kinds of contradictions may be tolerated between the data and the hypotheses in theoretical linguistics? First a model of paraconsistent logic is introduced which differentiates between week and strong contradiction. As a second step, a case study is carried out which exemplifies that the principle of epistemological tolerance may be interpreted as the tolerance of week contradiction. The third step of the argumentation focuses on another case study which exemplifies that the principle of epistemological tolerance must not be interpreted as the tolerance of strong contradiction. The reason for the latter insight is the unreliability and the uncertainty of introspective data. From this finding the author draws the conclusion that it is the integration of different data types that may lead to the improvement of current theoretical linguistics and that the integration of different data types requires a novel methodology which, for the time being, is not available

The ‘Galilean Style in Science’ and the Inconsistency of Linguistic Theorising

Chomsky’s principle of epistemological tolerance says that in theoretical linguistics contradictions between the data and the hypotheses may be temporarily tolerated in order to protect the explanatory power of the theory. The paper raises the following problem: What kinds of contradictions may be tolerated between the data and the hypotheses in theoretical linguistics? First a model of paraconsistent logic is introduced which differentiates between week and strong contradiction. As a second step, a case study is carried out which exemplifies that the principle of epistemological tolerance may be interpreted as the tolerance of week contradiction. The third step of the argumentation focuses on another case study which exemplifies that the principle of epistemological tolerance must not be interpreted as the tolerance of strong contradiction. The reason for the latter insight is the unreliability and the uncertainty of introspective data. From this finding the author draws the conclusion that it is the integration of different data types that may lead to the improvement of current theoretical linguistics and that the integration of different data types requires a novel methodology which, for the time being, is not available

Spring School on Language, Music, and Cognition: Organizing Events in Time

The interdisciplinary spring school “Language, music, and cognition: Organizing events in time” was held from February 26 to March 2, 2018 at the Institute of Musicology of the University of Cologne. Language, speech, and music as events in time were explored from different perspectives including evolutionary biology, social cognition, developmental psychology, cognitive neuroscience of speech, language, and communication, as well as computational and biological approaches to language and music. There were 10 lectures, 4 workshops, and 1 student poster session. Overall, the spring school investigated language and music as neurocognitive systems and focused on a mechanistic approach exploring the neural substrates underlying musical, linguistic, social, and emotional processes and behaviors. In particular, researchers approached questions concerning cognitive processes, computational procedures, and neural mechanisms underlying the temporal organization of language and music, mainly from two perspectives: one was concerned with syntax or structural representations of language and music as neurocognitive systems (i.e., an intrapersonal perspective), while the other emphasized social interaction and emotions in their communicative function (i.e., an interpersonal perspective). The spring school not only acted as a platform for knowledge transfer and exchange but also generated a number of important research questions as challenges for future investigations

Coargumenthood and the processing of pronouns

We report three eye-movement experiments and an offline task investigating structural constraints on pronoun resolution in different contexts. This included ‘coargument’ contexts in which a pronoun was the direct object of a verb (‘The surgeon remembered that Jonathan had noticed him’), so-called picture noun phrases (‘The surgeon remembered that Jonathan had a picture of him’) and picture noun phrases with a possessor (‘The surgeon remembered about Jonathan’s picture of him’). In each eye-movement experiment, we observed longer reading times when the nonlocal antecedent (‘the surgeon’) mismatched in stereotypical gender with the pronoun, but little evidence of the gender of the local antecedent (‘Jonathan’) influencing reading times. The offline task suggested readers occasionally interpret pronouns as referring to local antecedents, especially in non-coargument contexts. These results suggest that structural constraints constitute more highly weighted cues to antecedent retrieval than gender congruency during the initial stages of memory retrieval during pronoun resolution

Relinquishing Control: What Romanian De Se Attitude Reports Teach Us About Immunity To Error Through Misidentification

Higginbotham argued that certain linguistic items of English, when used in indirect discourse, necessarily trigger first-personal interpretations. They are: the emphatic reflexive pronoun and the controlled understood subject, represented as PRO. PRO is special, in this respect, due to its imposing obligatory control effects between the main clause and its subordinates ). Folescu & Higginbotham, in addition, argued that in Romanian, a language whose grammar doesn’t assign a prominent role to PRO, de se triggers are correlated with the subjunctive mood of certain verbs. That paper, however, didn’t account for the grammatical diversity of the reports that display immunity to error through misidentification in Romanian: some of these reports are expressed by using de se triggers; others are not. Their IEM, moreover, is not systematically lexically controlled by the verbs, via their theta-roles; it is, rather, determined by the meaning of the verbs in question. Given the data from Romanian, I will argue, the phenomenon of IEM cannot be fully explained starting either from the syntactical or the lexical structure of a language

Syntax-semantics interface: an algebraic model

We extend our formulation of Merge and Minimalism in terms of Hopf algebras to an algebraic model of a syntactic-semantic interface. We show that methods adopted in the formulation of renormalization (extraction of meaningful physical values) in theoretical physics are relevant to describe the extraction of meaning from syntactic expressions. We show how this formulation relates to computational models of semantics and we answer some recent controversies about implications for generative linguistics of the current functioning of large language models.Comment: LaTeX, 75 pages, 19 figure

Old and New Minimalism: a Hopf algebra comparison

In this paper we compare some old formulations of Minimalism, in particular Stabler's computational minimalism, and Chomsky's new formulation of Merge and Minimalism, from the point of view of their mathematical description in terms of Hopf algebras. We show that the newer formulation has a clear advantage purely in terms of the underlying mathematical structure. More precisely, in the case of Stabler's computational minimalism, External Merge can be described in terms of a partially defined operated algebra with binary operation, while Internal Merge determines a system of right-ideal coideals of the Loday-Ronco Hopf algebra and corresponding right-module coalgebra quotients. This mathematical structure shows that Internal and External Merge have significantly different roles in the old formulations of Minimalism, and they are more difficult to reconcile as facets of a single algebraic operation, as desirable linguistically. On the other hand, we show that the newer formulation of Minimalism naturally carries a Hopf algebra structure where Internal and External Merge directly arise from the same operation. We also compare, at the level of algebraic properties, the externalization model of the new Minimalism with proposals for assignments of planar embeddings based on heads of trees.Comment: 27 pages, LaTeX, 3 figure

Optimality Theory as a Framework for Lexical Acquisition

This paper re-investigates a lexical acquisition system initially developed for French.We show that, interestingly, the architecture of the system reproduces and implements the main components of Optimality Theory. However, we formulate the hypothesis that some of its limitations are mainly due to a poor representation of the constraints used. Finally, we show how a better representation of the constraints used would yield better results

Troubles with Bayesianism: An introduction to the psychological immune system

A Bayesian mind is, at its core, a rational mind. Bayesianism is thus well-suited to predict and explain mental processes that best exemplify our ability to be rational. However, evidence from belief acquisition and change appears to show that we do not acquire and update information in a Bayesian way. Instead, the principles of belief acquisition and updating seem grounded in maintaining a psychological immune system rather than in approximating a Bayesian processor

Linearly bounded infinite graphs

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs