The paper describes a computational model that we have implemented in an experimental dialogue system. Communication in a natural language between two participants A and B is considered, where A has a communicative goal that his/her partner B will make a decision to perform an action D. A argues the usefulness, pleasantness, etc. of D, in order to guide B's reasoning in a desirable direction. A computational model of argumentation is developed, which includes reasoning. Our model (...) is based on the studies in the common-sense conception of how the human mind works in such situations. Theoretical considerations are followed by an analysis of Estonian spoken human–human dialogues. First, calls of clients to travel agencies are studied where a travel agent could use various arguments in order to persuade a client to book a trip. The analysis demonstrates that clients are primarily looking for information; argumentation occurs in a small number of dialogues. Secondly, calls of s... (shrink)

In this paper, we present a model of pathos, delineate its operationalisation, and demonstrate its utility through an analysis of natural language argumentation. We understand pathos as an interactional persuasive process in which speakers are performing pathos appeals and the audience experiences emotional reactions. We analyse two strategies of such appeals in pre-election debates: pathotic Argument Schemes based on the taxonomy proposed by Walton et al. (Argumentation schemes, Cambridge University Press, Cambridge, 2008), and emotion-eliciting language based (...) on psychological lexicons of emotive words (Wierzba in Behav Res Methods 54:2146–2161, 2021). In order to match the appeals with possible reactions, we collect real-time social media reactions to the debates and apply sentiment analysis (Alswaidan and Menai in Knowl Inf Syst 62:2937–2987, 2020) method to observe emotion expressed in language. The results point to the importance of pathos analysis in modern discourse: speakers in political debates refer to emotions in most of their arguments, and the audience in social media reacts to those appeals using emotion-expressing language. Our results show that pathos is a common strategy in natural language argumentation which can be analysed with the support of computational methods. (shrink)

This article presents an architecture for natural language generation of biomedical argumentation. The goal is to reconstruct the normative arguments that a domain expert would provide, in a manner that is transparent to a lay audience. Transparency means that an argument's structure and functional components are accessible to its audience. Transparency is necessary before an audience can fully comprehend, evaluate or challenge an argument, or re-evaluate it in light of new findings about the case or changes (...) in scientific knowledge. The architecture has been implemented and evaluated in the Genetics Information Expression Assistant, a prototype system for drafting genetic counselling patient letters. Argument generation makes use of abstract argumentation schemes. Derived from the analysis of arguments used in genetic counselling, these mainly causal argument patterns refer to abstract properties of qualitative causal domain models. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed (...) in polynomial time. Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

This book compiles and reviews the most prominent linguistic theories into a single source that serves as an essential reference for future solutions to one of the most important challenges of our age.

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes is built.

Notice that this paper has not claimed that all natural languages are CFL's. What it has shown is that every published argument purporting to demonstrate the non-context-freeness of some natural language is invalid, either formally or empirically or both.18 Whether non-context-free characteristics can be found in the stringset of some natural language remains an open question, just as it was a quarter century ago.Whether the question is ultimately answered in the negative or the affirmative, (...) there will be interesting further questions to ask. If it turns out that natural languages are indeed always CFL's, it will be reasonable to ask whether this helps to explain why speakers apparently recognize so quickly whether a presented utterance corresponds to a grammatical sentence or not, and to associate structural and semantic details with it. It might also be reasonable to speculate about the explanation for the universally context-free character of the languages used by humans, and to wonder whether evolutionary biological factors are implicated in some way (Sampson (1979) could be read in this light). And naturally, it will be reasonable to pursue the program put forward by Gazdar (1981, in press) to see to what extent CFL-inducing grammatical devices can be exploited to yield insightful descriptions of natural languages that capture generalizations in revealing ways.If a human language that is not a CFL is proved to exist, on the other hand, a different question will be raised: give the non-context-free character of human languages in general, why has this property been so hard to demonstrate that it has taken over twenty-five years to bring it to light since the issue was first explicitly posed? If human languages do not have to be CFL's, why do so many (most?) of them come so close to having the property of context-freeness? And, since the CFL's certainly constitute a very broad class of mathematically natural and computationally tractable languages, what property of human beings or their communicative or cognitive needs is it that has caused some linguistic communities to reach beyond the boundaries of this class in the course of evolving a linguistic system?Either way, we shall be interested to see our initial question resolved, and further questions raised. One cautionary word should be said, however, about the implications (or lack of them) that the answer will have for grammatical studies. Chomsky has repeatedly stated that he does not see weak generative capacity as a theme of central importance in the theory of grammar, and we agree. It is very far from being the case that the recent resurgence of interest in exploring the potential of CF-PSG or equivalent systems will, or should, be halted dead in its tracks by the discovery (if it is ever forthcoming) that some natural language is not a CFL. In the area of parsing, for instance, it seems possible that natural languages are not only parsed on the basis of constituent structure such as a CF-PSG would assign, but are parsed as if they were finite state languages (see Langendoen (1975) and Church (1980) for discussion along these lines). That is, precisely those construction-types that figure in the various proofs that English is not an FSL appear to cause massive difficulty in the human processing system; the sentences crucial to the proofs are for the most part unprocessable unless they are extremely short (yet the arguments for English not being and FSL only go through if length is not an issue). This means that in practice properties of finite state grammars are still of great potential importance to linguistic theory despite the fact that they do not provide the framework for defining the total class of grammatical sentences. The same would almost certannly be true of CF-PSG's if they were shown to be inadequate in a similar sense. It is highly unlikely that the advances made so far in far in phrase structure description could be nullified by a discovery about weak generative capacity. Moreover, there are known to be numerous ways in which the power of CF-PSG's can be marginally enhanced to permit, for example, xx languages to be generated without allowing anything like the full class of recursively enumerable or even context-sensitive languages (see Hopcroft and Ullmann (1979), Chapter 14) for an introduction to this topic, noting especially Figure 14.7 on p. 393. The obvious thing to do if natural languages were ever shown not to be CFL's in the general case would be to start exploring such minimal enhancements of expressive power to determine exactly what natural languages call for in this regard and how it could be effectively but parsimoniously provided in a way that closely modelled human linguistic capacities.In the meantime, it seems reasonable to assume that the natural languages are a proper subset of the infinite-cardinality CFL's until such time as they are validly shown not to be. (shrink)

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes is built.

Hamblin distinguished between formal and descriptive dialectic. Formal normative models of deliberation dialogue have been strongly emphasized as argumentation frameworks in computer science. But making such models of deliberation applicable to real natural language examples has reached a point where the descriptive aspect needs more interdisciplinary work. The new formal and computational models of deliberation dialogue that are being built in computer science seem to be closely related to some already existing and very well (...) established computing technologies such as problem solving and decision making, but whether or how dialectical argumentation can be helpful to support these systems remains an open question. The aim of this paper is to examine some real examples of argumentation that seem to hover on the borderlines between deliberation, problem solving and decision making. (shrink)

How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in the cognitive science of language. Computational modeling is an important methodology in research aimed at addressing this issue. We must determine appropriate learning mechanisms that can grasp generalizations from examples of specific usages, and that exhibit patterns of behavior over the course of learning similar to those in children. (...) Early learning of verb argument structure is an area of language acquisition that provides an interesting testbed for such approaches due to the complexity of verb usages. A range of linguistic factors interact in determining the felicitous use of a verb in various constructions—associations between syntactic forms and properties of meaning that form the basis for a number of linguistic and psycholinguistic theories of language. This article presents a computational model for the representation, acquisition, and use of verbs and constructions. The Bayesian framework is founded on a novel view of constructions as a probabilistic association between syntactic and semantic features. The computational experiments reported here demonstrate the feasibility of learning general constructions, and their exceptions, from individual usages of verbs. The behavior of the model over the timecourse of acquisition mimics, in relevant aspects, the stages of learning exhibited by children. Therefore, this proposal sheds light on the possible mechanisms at work in forming linguistic generalizations and maintaining knowledge of exceptions. (shrink)

Humor plays an essential role in human interactions. Precisely what makes something funny, however, remains elusive. While research on natural language understanding has made significant advancements in recent years, there has been little direct integration of humor research with computational models of language understanding. In this paper, we propose two information-theoretic measures—ambiguity and distinctiveness—derived from a simple model of sentence processing. We test these measures on a set of puns and regular sentences and show that (...) they correlate significantly with human judgments of funniness. Moreover, within a set of puns, the distinctiveness measure distinguishes exceptionally funny puns from mediocre ones. Our work is the first, to our knowledge, to integrate a computational model of general language understanding and humor theory to quantitatively predict humor at a fine-grained level. We present it as an example of a framework for applying models of language processing to understand higher level linguistic and cognitive phenomena. (shrink)

The paper presents a proof-theoretic semantics (PTS) for a fragment of natural language, providing an alternative to the traditional model-theoretic (Montagovian) semantics (MTS), whereby meanings are truth-condition (in arbitrary models). Instead, meanings are taken as derivability-conditions in a dedicated natural-deduction (ND) proof-system. This semantics is effective (algorithmically decidable), adhering to the meaning as use paradigm, not suffering from several of the criticisms formulated by philosophers of language against MTS as a theory of meaning. In particular, (...) Dummett’s manifestation argument does not obtain, and assertions are always warranted, having grounds of assertion. The proof system is shown to satisfy Dummett’s harmony property, justifying the ND rules as meaning conferring. The semantics is suitable for incorporation into computational linguistics grammars, formulated in type-logical grammar. (shrink)

A growing body of recent work in informal logic investigates the process of argumentation. Among other things, this work focuses on the ways in which individuals attempt to understand written or verbalised arguments in light of the fact that these are often presented in forms that are incomplete and unmarked. One of its aims is to develop general procedures for natural language argument recognition and reconstruction. Our aim here is to draw on this growing body of knowledge (...) in informal logic in order to take preliminary steps towards developing an architecture for computer systems that are able to recognise and reconstruct natural language arguments. This architecture aims to structure research of an applied and computational nature that strives to implement linguistic systems of various sorts, and to analyse problems in a way that both yields manageable and relatively independent components and also highlights how implementations can interact with existing resources from natural language processing. (shrink)

In natural language understanding, a crucial goal is correctly interpreting open-textured phrases. In practice, disagreements over the meanings of open-textured phrases are often resolved through the generation and evaluation of interpretive arguments, arguments designed to support or attack a specific interpretation of an expression within a document. In this paper, we discuss some of our work towards the goal of automatically generating and evaluating interpretive arguments. We have curated a set of rules from the code of ethics of (...) various professional organizations and a set of associated scenarios that are ambiguous with respect to some open-textured phrase within the rule. We collected and evaluated arguments from both human annotators and state-of-the-art generative language models in order to determine the relative quality and persuasiveness of both sets of arguments. Finally, we performed a Turing test-inspired study in order to assess whether human annotators can tell the difference between human arguments and machine-generated arguments. The results show that machine-generated arguments, when prompted a certain way, can be consistently rated as more convincing than human-generated arguments, and to the untrained eye, the machine-generated arguments can convincingly sound human-like. (shrink)

Words are the essence of communication: They are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisition: Children must first learn words before they can combine them into complex utterances. Many theories have been developed to explain the impressive efficiency of young children in acquiring the vocabulary of their language, as well as the developmental patterns observed in the course of lexical acquisition. A major (...) source of disagreement among the different theories is whether children are equipped with special mechanisms and biases for word learning, or their general cognitive abilities are adequate for the task. We present a novel computational model of early word learning to shed light on the mechanisms that might be at work in this process. The model learns word meanings as probabilistic associations between words and semantic elements, using an incremental and probabilistic learning mechanism, and drawing only on general cognitive abilities. The results presented here demonstrate that much about word meanings can be learned from naturally occurring child-directed utterances (paired with meaning representations), without using any special biases or constraints, and without any explicit developmental changes in the underlying learning mechanism. Furthermore, our model provides explanations for the occasionally contradictory child experimental data, and offers predictions for the behavior of young word learners in novel situations. (shrink)

Argumentation mining is an application of natural language processing (NLP) that emerged a few years ago and has recently enjoyed considerable popularity, as demonstrated by a series of international workshops and by a rising number of publications at the major conferences and journals of the field. Its goals are to identify argumentation in text or dialogue; to construct representations of the constellation of claims, supporting and attacking moves (in different levels of detail); and to characterize the patterns of (...) reasoning that appear to license the argumentation. Furthermore, recent work also addresses the difficult tasks of evaluating the persuasiveness and quality of arguments. Some of the linguistic genres that are being studied include legal text, student essays, political discourse and debate, newspaper editorials, scientific writing, and others. The book starts with a discussion of the linguistic perspective, characteristics of argumentative language, and their relationship to certain other notions such as subjectivity. Besides the connection to linguistics, argumentation has for a long time been a topic in Artificial Intelligence, where the focus is on devising adequate representations and reasoning formalisms that capture the properties of argumentative exchange. It is generally very difficult to connect the two realms of reasoning and text analysis, but we are convinced that it should be attempted in the long term, and therefore we also touch upon some fundamentals of reasoning approaches. Then the book turns to its focus, the computational side of mining argumentation in text. We first introduce a number of annotated corpora that have been used in the research. From the NLP perspective, argumentation mining shares subtasks with research fields such as subjectivity and sentiment analysis, semantic relation extraction, and discourse parsing. Therefore, many technical approaches are being borrowed from those (and other) fields. We break argumentation mining into a series of subtasks, starting with the preparatory steps of classifying text as argumentative (or not) and segmenting it into elementary units. Then, central steps are the automatic identification of claims, and finding statements that support or oppose the claim. For certain applications, it is also of interest to compute a full structure of an argumentative constellation of statements. Next, we discuss a few steps that try to 'dig deeper': to infer the underlying reasoning pattern for a textual argument, to reconstruct unstated premises (so-called 'enthymemes'), and to evaluate the quality of the argumentation. We also take a brief look at 'the other side' of mining, i.e., the generation or synthesis of argumentative text. The book finishes with a summary of the argumentation mining tasks, a sketch of potential applications, and a—necessarily subjective—outlook for the field. Table of Contents: Preface / Acknowledgments / Introduction / Argumentative Language / Modeling Arguments / Corpus Annotation / Finding Claims / Finding Supporting and Objecting Statements / Deriving the Structure of Argumentation / Assessing Argumentation / Generating Argumentative Text / Summary and Perspectives / Bibliography / Authors' Biographies / Index. (shrink)

In this paper, I argue for a modified version of what Devitt calls the Representational Thesis. According to RT, syntactic rules or principles are psychologically real, in the sense that they are represented in the mind/brain of every linguistically competent speaker/hearer. I present a range of behavioral and neurophysiological evidence for the claim that the human sentence processing mechanism constructs mental representations of the syntactic properties of linguistic stimuli. I then survey a range of psychologically plausible computational models (...) of comprehension and show that they are all committed to RT. I go on to sketch a framework for thinking about the nature of the representations involved in sentence processing. My claim is that these are best characterized not as propositional attitudes but, rather, as subpersonal states whose representational properties are determined by their functional role. Finally, I distinguish between explicit and implicit representations and argue that the latter can be drawn on as data by the algorithms that constitute our sentence processing routines. I conclude that skepticism concerning the psychological reality of grammars cannot be sustained. (shrink)

This paper reviews computational models of surprise, with a specific focus on the authors’ probabilistic, contrast model. The contrast model casts surprise, and its intensity, as emerging from the difference between the probability of the surprising event and the probability of the highest expected‐event in a given situation. Strong arguments are made for the central role of surprise in creativity and learning by natural and artificial agents.

In this paper I review the Neo-Davidsonian semantics of prepositional phrases and secondary predication. I argue that certain types of examples pose challenge to this semantics. I present an alternative to the Neo-Davidsonian analysis which successfully deals with the problematic examples. The core idea lies in representing theta-roles not as functions from events to their participants, but rather as argument-labels encoding the role of each argument in a given verb. As a result, natural-language predicates can now (...) be treated in the manner in which relations are treated in the relational model of data, that is, as naming sets of tuples in which every object is given together with its role named by a corresponding attribute (a theta-role). Such a representation allows the employment of relational algebra operators to calculate the extensions of complex predicates (predicates built out of atomic predicates and/or atomic predicates and prepositions). I lay out the foundations of a relational FOL appropriate for the representation of natural-language predicates and present solutions to the problematic examples. From a practical perspective, the expressions of a relational FOL can be translated to a relational algebra or SQL, which makes it possible to operate with these three languages on the same relational model of data. From a philosophical perspective, a relational FOL permits a return to ‘property-based’ semantics, one in which properties named by predicates are those of individuals, and not of events. (shrink)

Transformer-based Pre-Trained Language Models currently dominate the field of Natural Language Inference (NLI). We first survey existing NLI datasets, and we systematize them according to the different kinds of logical inferences that are being distinguished. This shows two gaps in the current dataset landscape, which we propose to address with one dataset that has been developed in argumentative writing research as well as a new one building on syllogistic logic. Throughout, we also explore the promises of (...) ChatGPT. Our results show that our new datasets do pose a challenge to existing methods and models, including ChatGPT, and that tackling this challenge via fine-tuning yields only partly satisfactory results. (shrink)

This article demonstrates that typical restrictions which are imposed in dialogical logic in order to recover first-order logical consequence from a fragment of natural language argumentation are also forthcoming from preference profiles of boundedly rational players, provided that these players instantiate a specific player type and compute partial strategies. We present two structural rules, which are formulated similarly to closure rules for tableaux proofs that restrict players' strategies to a mapping between games in extensive forms and proof trees. (...) Both rules are motivated from players' preferences and limitations; they can therefore be viewed as being player-self-imposable. First-order logical consequence is thus shown to result from playing a specific type of argumentation game. The alignment of such games with the normative model of the Pragma-dialectical theory of argumentation is positively evaluated. But explicit rules to guarantee that the argumentation game instantiates first-order logical consequence have now become gratuitous, since their normative content arises directly from players' preferences and limitations. A similar naturalization for non-classical logics is discussed. (shrink)

In this article, we first present the platform and the Dislog language, designed for discourse analysis with a logic and linguistic perspective. The platform has now reached a certain level of maturity which allows the recognition of a large diversity of discourse structures including general-purpose rhetorical structures as well as domain-specific discourse structures. The Dislog language is based on linguistic considerations and includes knowledge access and inference capabilities. Functionalities of the language are presented together with a method (...) for writing discourse analysis rules. Efficiency and portability of the system over domains and languages are investigated to conclude this first part. In a second part, we analyse the different types of arguments found in several document genres, most notably: procedures, didactic texts and requirements. Arguments form a large class of discourse relations. A generic and frequently encountered form emerges from our analysis: ?reasons for conclusion? which constitutes a homogeneous family of arguments from a language, functional and conceptual point of view. This family can be viewed as a kind of proto-argument. We then elaborate its linguistic structure and show how it is implemented in . We then investigate the cooperation between explanation and arguments, in particular in didactic texts where they are particularly rich and elaborated. This article ends with a prospective section that develops current and potential uses of this work and how it can be extended to the recognition of other forms of arguments. (shrink)

Frost has given us good reason to question the universality of existing computational models of reading. Yet, he has not provided arguments showing that all languages share fundamental and invariant reading universals. His goal of outlining the blueprint principles for a universal model of reading is premature. Further, it is questionable whether natural evolution can provide the optimal solutions that Frost invokes.

While agent-based modelling languages naturally implement concurrency, the currently available languages for argumentation do not allow to explicitly model this type of interaction. In this paper we introduce a concurrent language for handling agents arguing and communicating using a shared argumentation space. We also show how to perform high-level operations like persuasion and negotiation through basic belief revision constructs, and present a working implementation of the language and the associated web interface.

We propose a model of natural language inference which identifies valid inferences by their lexical and syntactic features, without full semantic interpretation. We extend past work in natural logic, which has focused on semantic containment and monotonicity, by incorporating both semantic exclusion and implicativity. Our model decomposes an inference problem into a sequence of atomic edits linking premise to hypothesis; predicts a lexical semantic relation for each edit; propagates these relations upward through a semantic composition tree according (...) to properties of intermediate nodes; and joins the resulting semantic relations across the edit sequence. A computational implementation of the model achieves 70% accuracy and 89% precision on the FraCaS test suite. Moreover, including this model as a component in an existing system yields significant performance gains on the Recognizing Textual Entailment challenge. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use (...) class='Hi'>computational complexity results to investigate semantic distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

According to logical theories of meaning, a meaning of an expression can be formalized and encoded in truth conditions. Vagueness of the language and individual differences between people are a challenge to incorporate into the meaning representations. In this paper, we propose a new approach to study truth-conditional representations of vague concepts. For a case study, we selected two natural language quantifiers most and more than half. We conducted two online experiments, each with 90 native English speakers. (...) In the first experiment, we tested between-subjects variability in meaning representations. In the second experiment, we tested the stability of meaning representations over time by testing the same group of participants in two experimental sessions. In both experiments, participants performed the verification task. They verified a sentence with a quantifier (e.g., “Most of the gleerbs are feezda.”) based on the numerical information provided in the second sentence, (e.g., “60% of the gleerbs are feezda”). To investigate between-subject and within-subject differences in meaning representations, we proposed an extended version of the Diffusion Decision Model with two parameters capturing truth conditions and vagueness. We fit the model to responses and reaction times data. In the first experiment, we found substantial between-subject differences in representations of most as reflected by the variability in the truth conditions. Moreover, we found that the verification of most is proportion-dependent as reflected in the reaction time effect and model parameter. In the second experiment, we showed that quantifier representations are stable over time as reflected in stable model parameters across two experimental sessions. These findings challenge semantic theories that assume the truth-conditional equivalence of most and more than half and contribute to the representational theory of vague concepts. The current study presents a promising approach to study semantic representations, which can have a wide application in experimental linguistics. (shrink)

Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible argumentation. Its language, which is of a logic-programming-like nature, has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these (...) priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled.The proof theory of the system is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument. An argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. Despite this dialectical form, the system reflects a declarative, or relational approach to modelling legal argument. A basic assumption of this paper is that this approach complements two other lines of research in AI and Law, investigations of precedent-based reasoning and the development of procedural, or dialectical models of legal argument. (shrink)

The social epistemology of science would benefit from paying more attention to the nature of argumentative exchanges. Argumentation is not only a cognitive activity but a collaborative social activity whose functioning needs to be understood from a psychological and communicative perspective. Thus far, social and organizational psychology has been used to discuss how social diversity affects group deliberation by changing the mindset of the participants. Argumentative exchanges have comparable effects, but they depend on cognitive diversity and emerge through critical interaction. (...) An example of a cognitive psychological theory is discussed that explains how mutual reasoning affects how we think, make decisions, and solve problems, as well as how cognitive biases may facilitate an efficient division of cognitive labor. These observations are compared with the existing results in the social epistemology of science. Moreover, I explicate the conceptual differences between the distributed and social processing of information. While argumentative exchanges belong to the latter domain, most existing simulations model distributed processing, which may compromise their real-world relevance and proper conceptual interpretation. However, I aim not to criticize the existing simulation methods but to promote an approach from the cognitive psychology of reasoning that complements the current use of organizational psychology and computer simulations by investigating a different set of mechanisms relating to similar phenomena of interest in the social epistemology of science. (shrink)

The use of findings from conversation analysis in the design of human-computer interfaces and especially in the design of computer-human speech dialogues is a matter of considerable controversy. For example, in “Going up a Blind Alley” (Button, 1990) and “On Simulacrums of Conversation” (Button and Sharrock, 1995), Button argues that conversation analysis is of only limited use in the computational modelling of interaction. He suggests that computers will never be able to “converse” with humans because of the fundamentally different (...) ways in which humans and computers use rules in the production of language.We show in this paper that these arguments are neither necessary nor sufficient to rule out the possibility of computers which can be said to converse. They depend on a view about the nature of rules which is based on a fundamental misunderstanding of the scope of computation. The way in which mathematical systems such as Context Free Grammars use rules is very different from the use of the rules in principle-based approaches to language or the “micro-rules” of neural networks. If there is a problem with conversing computers, it lies more with the true nature of the interaction that is taking place and with considerations about the nature of cognition than with the construction and use of rules. (shrink)

We discuss McMillan et al. (2005) paper devoted to study brain activity during comprehension of sentences with generalized quantifiers. According to the authors their results verify a particular computational model of natural language quantifier comprehension posited by several linguists and logicians (e. g. see van Benthem, 1986). We challenge this statement by invoking the computational difference between first-order quantifiers and divisibility quantifiers (e. g. see Mostowski, 1998). Moreover, we suggest other studies on quantifier comprehension, which can (...) throw more light on the role of working memory in processing quantifiers. (shrink)

COVID-19 is a disease that affects the quality of life in all aspects. However, the government policy applied in 2020 impacted the lifestyle of the whole world. In this sense, the study of sentiments of people in different countries is a very important task to face future challenges related to lockdown caused by a virus. To contribute to this objective, we have proposed a natural language processing model with the aim to detect positive and negative feelings in open-text (...) answers obtained from a survey in pandemic times. We have proposed a distilBERT transformer model to carry out this task. We have used three approaches to perform a comparison, obtaining for our best model the following average metrics: Accuracy: 0.823, Precision: 0.826, Recall: 0.793 and F1 Score: 0.803. (shrink)

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis, in the context for type-logical grammars, of the logical models and algorithms currently used in natural language semantics, defined as a function from a grammatical sentence to a set of logical formulas—because a statement can be ambiguous, it (...) can correspond to multiple formulas, one for each reading. We argue that as long as we do not explicitly compute the interpretation in terms of possible world models, one can compute the semantic representation of a given statement, including aspects of lexical meaning. This is a very generic process, so the results are, at least in principle, widely applicable. We also discuss the algorithmic complexity of this process. (shrink)

The emphasis in most process-oriented models of argumentation is placed heavily upon analysis of dialogue. The current work puts forward an account which examines the argumentation involved in persuasive monologue, drawing upon commitment-based theories of dialogue. The various differences between monologue and dialogue are discussed, with particular reference to the possibility of designing a monologue game in which commitments are dynamically incurred and updated as the monologue is created. Finally, the computational advantages of adopting such an approach are (...) explored in the context of an existing architecture for the generation of natural language arguments. (shrink)

This book explores issues at the core of modern linguistics and cognitive science. Why are all languages similar in some ways and in others utterly different? Why do languages change and change variably? How did the human capacity for language evolve, and how far did it do so as an innate ability? Simon Kirby looks at these questions from a broad perspective, arguing that they can be studied together. The author begins by examining how far the universal properties of (...) language may be explained by examining the way it is used, and how far by the way it is structured. He then considers what insights may be gained by combining functional and formal approaches. In doing so he develops a way of treating language as an adaptive system, in which its communicative and formal roles are both crucial and complementary. In order to test the effectiveness of competing theories and explanations, Simon Kirby develops computational models to show what universals emerge given a particular theory of language use or acquisition. He presents here both the methodology and the results. Function, Selection, and Innateness is important for its argument, its methodology, and its conclusions. It is a powerful demonstration of the value of looking at language as an adaptive system and goes to the heart of current debates on the evolution and nature of language. (shrink)

It can be said that the roots of the studies on the argumentation theory go back to rhetorical and dialectical studies. One of the sub-fields of the argumentation theory is argument schemes, used in everyday language and various fields within certain rules. Today, with the studies in the field of informal logic, argumentation schemes have aslo become an important field to study. The argumentation schemes approach also plays an important role in the study of artificial language at (...) the intersection of the computer science area. In this article, we discussed Douglas Walton’s argumentation schemes approach. Douglas Walton's aim is to determine the natural language arguments used in various fields and make as a list of them and propose a classification for argumentation schemes. Douglas Walton, presents a model for the argumentation schemes. This model also emphasized the structure suitable for use in computer systems. Determination, analysis and evaluation of arguments are important topics for the arguments applying to computer systems. In this article, we discuss one of these systems, Thomas Gordon’s project, the Carneades Argumentation System. The Carneades Argumentation System is a system which can handle Douglas Walton's argumentation schemes. With the Carneades Argumentation System, it is possible to visualize arguments as an argument map. The visualization of an argumentation provides a concrete basis for philosophical discussions. It makes it easy for the user to determine the scheme of the current argument when applying the argument formats to mapping and evaluation systems such as Carneades Argumentation Systems. Determining the argument scheme allows the argument to be handled within a particular model. The aim of this article is to discuss the argumentation schemes which is one of the topics of study at the intersection of philosophical logic and computer sciences in which informal logic studies are developing today. (shrink)

This volume examines two main questions: What is linguistics about? And how do the results of linguistic theorizing bear on inquiry in related fields, particularly in psychology? The book develops views that depart from received wisdom in both philosophy and linguistics. With regard to questions concerning the subject matter, methodological goals, and ontological commitments of formal syntactic theorizing, it argues that the cognitive conception adopted by most linguists and philosophers is not the only acceptable view, and that the arguments in (...) its favor collapse under scrutiny. Nevertheless, as the book shows, a detailed examination of the relevant psycholinguistic results and computational models does support the claim that the theoretical constructs of formal linguistics are operative in real-time language comprehension. These constructs fall into two categories: mental phrase markers and mental syntactic principles. Both are indeed psychologically real, but in importantly different ways. The book concludes by drawing attention to the importance of the often-elided distinction between personal and subpersonal psychological states and processes, as well as the logical character of dispositional and occurrent states. By clarifying these concepts, particularly by reference to up-and-running psychological and computational models, the book yields a richer and more satisfying perspective on the psychological reality of language. (shrink)

Most words in natural languages are polysemous; that is, they have related but different meanings in different contexts. This one‐to‐many mapping of form to meaning presents a challenge to understanding how word meanings are learned, represented, and processed. Previous work has focused on solutions in which multiple static semantic representations are linked to a single word form, which fails to capture important generalizations about how polysemous words are used; in particular, the graded nature of polysemous senses, and the flexibility (...) and regularity of polysemy use. We provide a novel view of how polysemous words are represented and processed, focusing on how meaning is modulated by context. Our theory is implemented within a recurrent neural network that learns distributional information through exposure to a large and representative corpus of English. Clusters of meaning emerge from how the model processes individual word forms. In keeping with distributional theories of semantics, we suggest word meanings are generalized from contexts of different word tokens, with polysemy emerging as multiple clusters of contextually modulated meanings. We validate our results against a human‐annotated corpus of polysemy focusing on the gradedness, flexibility, and regularity of polysemous sense individuation, as well as behavioral findings of offline sense relatedness ratings and online sentence processing. The results provide novel insights into how polysemy emerges from contextual processing of word meaning from both a theoretical and computational point of view. (shrink)

A central tenet of cognitive linguistics is that adults’ knowledge of language consists of a structured inventory of constructions, including various two-argument constructions such as the active, the passive and “fronting” constructions. But how do speakers choose which construction to use for a particular utterance, given constraints such as discourse/information structure and the semantic fit between verb and construction? The goal of the present study was to build a computational model of this phenomenon for two-argument constructions (...) in Mandarin. First, we conducted a grammaticality judgment study with 60 native speakers which demonstrated that, across 57 verbs, semantic affectedness – as determined by further 16 native speakers – predicted each verb’s relative acceptability in the bei-passive and ba-active constructions, but not the Notional Passive and SVO Active constructions. Second, in order to simulate acquisition of these competing constraints, we built a computational model that learns to map from corpus-derived input to an output representation corresponding to these four constructions. The model was able to predict judgments of the relative acceptability of the test verbs in the ba-active and bei-passive constructions obtained in Study 1, with model-human correlations in the region of r = 0.5 and r = 0.3, respectively. Surprisingly, these correlations increased when lexical verb identity was removed; perhaps because this information leads to over-fitting of the training set. These findings suggest the intriguing possibility that acquiring constructions involves forgetting as a mechanism for abstracting across certain fine-grained lexical details and idiosyncrasies. (shrink)

José Luis Bermúdez introduces the philosophy of psychology as an interdisciplinary exploration of the nature and mechanisms of cognition. _Philosophy of Psychology_ charts out four influential 'pictures of the mind' and uses them to explore central topics in the philosophical foundations of psychology, including the relation between different levels of studying the mind/brain; the nature and scope of psychological explanation; the architecture of cognition; and the relation between thought and language. Chapters cover all the core concepts, including: models (...) of psychological explanation the nature of commonsense psychology arguments for the autonomy of psychology functionalist approaches to cognition computational models of the mind neural network modeling rationality and mental causation perception, action and cognition the language of thought and the architecture of cognition. _Philosophy of Psychology: A Contemporary Introduction_ is a very clear and well-structured textbook from one of the leaders in the field. (shrink)

This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot (...) understand natural language are discussed, and a prototype natural-language-understanding system is presented as an illustration. (shrink)

The question whether natural language can be captured in a formal system has been argued at length, and both a positive and a negative answer has been defended. The paper investigates the main lines of argument for both, and argues that the stalemate that appears to have been reached is an indication that the question itself rests on a wrong conception of the relation between natural languages and formal languages, and hence of the methodological status of (...) formal modelling of natural language. (shrink)

The present paper intends to draw the conception of language implied in the technique of word embeddings that supported the recent development of deep neural network models in computational linguistics. After a preliminary presentation of the basic functioning of elementary artificial neural networks, we introduce the motivations and capabilities of word embeddings through one of its pioneering models, word2vec. To assess the remarkable results of the latter, we inspect the nature of its underlying mechanisms, which have (...) been characterized as the implicit factorization of a word-context matrix. We then discuss the ordinary association of the “distributional hypothesis” with a “use theory of meaning,” often justifying the theoretical basis of word embeddings, and contrast them to the theory of meaning stemming from those mechanisms through the lens of matrix models (such as vector space models and distributional semantic models). Finally, we trace back the principles of their possible consistency through Harris’s original distributionalism up to the structuralist conception of language of Saussure and Hjelmslev. Other than giving access to the technical literature and state of the art in the field of natural language processing to non-specialist readers, the paper seeks to reveal the conceptual and philosophical stakes involved in the recent application of new neural network techniques to the computational treatment of language. (shrink)

We consider the notion of everyday language. We claim that everyday language is semantically bounded by the properties expressible in the existential fragment of second–order logic. Two arguments for this thesis are formulated. Firstly, we show that so–called Barwise's test of negation normality works properly only when assuming our main thesis. Secondly, we discuss the argument from practical computability for finite universes. Everyday language sentences are directly or indirectly verifiable. We show that in both cases they (...) are bounded by second–order existential properties. Moreover, there are known examples of everyday language sentences which are the most difficult in this class (NPTIME–complete). (shrink)

According to usage‐based approaches to language acquisition, linguistic knowledge is represented in the form of constructions—form‐meaning pairings—at multiple levels of abstraction and complexity. The emergence of syntactic knowledge is assumed to be a result of the gradual abstraction of lexically specific and item‐based linguistic knowledge. In this article, we explore how the gradual emergence of a network consisting of constructions at varying degrees of complexity can be modeled computationally. Linguistic knowledge is learned by observing natural language utterances (...) in an ambiguous context. To determine meanings of constructions starting from ambiguous contexts, we rely on the principle of cross‐situational learning. While this mechanism has been implemented in several computational models, these models typically focus on learning mappings between words and referents. In contrast, in our model, we show how cross‐situational learning can be applied consistently to learn correspondences between form and meaning beyond such simple correspondences. (shrink)