In this paper we start from the assumption that in a metaphor, or an analogy, some terms belonging to one domain (source domain) are used to refer to objects other than their conventional referents belonging to a possibly different domain (target domain). We describe a formalism, which is based on the First Order Predicate Calculus, for representing the knowledge structure associated with a domain and then develop a theory of Constrained Semantic Transference [CST] which allows the terms and the structural (...) relationships of the source domain to be transferred coherently across to the target domain. We show how metaphors and analogies can be characterized in CST in such a way that many of their cognitive properties con be explained.We then propose a theory of Approximate Semantic Transference [AST] which is a computational version of CST and is derived from it by replacing the coherency requirement with approximate coherency. We show how AST can be used as a basis for designing models of cognitive processes involved in comprehending metaphors and analogies. (shrink)

In this paper, we give a possible characterization of the distributivity on bi-approximation semantics. To this end, we introduce new notions of special elements on polarities and show that the distributivity is first-order definable on bi-approximation semantics. In addition, we investigate the dual representation of those structures and compare them with bi-approximation semantics for intuitionistic logic. We also discuss that two different methods to validate the distributivity—by the splitters and by the adjointness—can be explicated with the help (...) of the axiom of choice as well. (shrink)

We show that the feasible interpolation property is robust for some proof systems but not for others.

First, I show that the semantic thesis of scientific realism may be relaxed significantly—to allow that some scientific discourse is not truth-valued—without making any concessions concerning the epistemic or methodological theses that lie at realism’s core. Second, I illustrate how relaxing the semantic thesis allows realists to avoid positing abstract entities and to fend off objections to the “no miracles” argument from positions such as cognitive instrumentalism. Third, I argue that the semantic thesis of scientific realism should be relaxed because (...) it is possible for scientific statements to be partially true, and hence approximately true, without being false. (shrink)

Rough sets are used in numerous knowledge representation contexts and are then empowered with varied ontologies. These may be intrinsically associated with ideas of rationality under certain conditions. In recent papers, specific granular generalisations of graded and variable precision rough sets are investigated by the present author from the perspective of rationality of approximations (and the associated semantics of rationality in approximate reasoning). The studies are extended to ideal-based approximations (sometimes referred to as subsethood-based approximations). It is additionally (...) shown that co-granular or point-wise approximations defined by σ-ideals/filters (for an arbitrary relation σ) fit easily into the entire scheme. Concepts of the rationality of objects (vague or crisp) and their types are introduced and are shown to be applicable to most general rough sets by the present author. Surprising results on these are proved on these by her in this part of the research paper. The present paper is the first of a three part study on the topic. (shrink)

This paper focuses on the interpretation of the Italian approximative adverb quasi 'almost' by primarily looking at cases in which it modifies temporal connectives, a domain which, to our knowledge, has been largely unexplored thus far. Consideration of this domain supports the need for a scalar account of the semantics of quasi (close in spirit to Hitzeman's semantic analysis of almost, in: Canakis et al. (eds) Papers from the 28th regional meeting of the Chicago Linguistic Society, 1992). When paired (...) with suitable analyses of temporal connectives, such an account can provide a simple explanation of the patterns of implication that are observed when quasi modifies locational (e. g. quando 'when'), directional (e. g. fino 'until' and da 'since'), and event-sequencing temporal connectives (e. g. prima 'before' and dopo ' after'). A challenging empirical phenomenon that is observed is a contrast between the modification of fino and da by quasi, on the one hand, and the modification of prima and dopo by the same adverb, on the other. While quasi fino and quasi da behave symmetrically, a puzzling asymmetry is observed between quasi prima and quasi dopo. To explain the asymmetry, we propose an analysis of prima and dopo on which the former has the meaning of the temporal comparative più presto 'earlier', while the latter is seen as an atomic predicate denoting temporal succession between events (Del Prete, Nat Lang Semantics 16: 157-203, 2008). We show that the same pattern of implication observed for quasi prima is attested when quasi modifies overt comparatives, and propose a pragmatic analysis of this pattern that uniformly applies to both cases, thus providing new evidence for the claim that prima is underlyingly a comparative. A major point of this paper is a discussion of the notion of scale which is relevant for the semantics of quasi', in particular, we show that the notion of Horn (entailment-based) scale is not well-suited for handling modification of temporal connectives, and that a more general notion of scale is required in order to provide a uniform analysis of quasi as a cross-categorial modifier. (shrink)

Inspired by the recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of the n-degree of introspection that is allowed, thus generating modaln-logics. The semantics for n-logics is presented, in which formulas are evaluated with respect to paths, and not possible worlds. A tableau-based proof system is presented, n-SST, and soundness and completeness is shown for the approximation of modal logics image and (...) image. (shrink)

This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database, based on a semantics inspired by rough sets. The implementation is based upon the use of a standard SQL database to store logical facts, augmented with several query interface layers implemented in JAVA through which extensional, intensional and local closed world nonmonotonic queries in the form of crisp or approximate logical formulas can be evaluated tractably. A graphical database design user interface (...) is also provided which simplifies the design of databases, the entering of data and the construction of queries. The theory and semantics for AKDBs is presented in addition to application examples and details concerning the database implementation. (shrink)

The term fuzzy logic is used in this paper to describe an imprecise logical system, FL, in which the truth-values are fuzzy subsets of the unit interval with linguistic labels such as true, false, not true, very true, quite true, not very true and not very false, etc. The truth-value set, , of FL is assumed to be generated by a context-free grammar, with a semantic rule providing a means of computing the meaning of each linguistic truth-value in as a (...) fuzzy subset of [0, 1].Since is not closed under the operations of negation, conjunction, disjunction and implication, the result of an operation on truth-values in requires, in general, a linguistic approximation by a truth-value in . As a consequence, the truth tables and the rules of inference in fuzzy logic are (i) inexact and (ii) dependent on the meaning associated with the primary truth-value true as well as the modifiers very, quite, more or less, etc. (shrink)

We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov [2] and by Ben Yaacov, Doucha, Nies, and Tsankov [6], which are largely incompatible. With this we explicitly exhibit Scott sentences for the perturbation systems of the former paper, such as the Banach‐Mazur distance and the Lipschitz distance between metric spaces. Our formalism is simultaneously characterized syntactically by a mild generalization of perturbation systems and semantically by certain elementary classes of (...) two‐sorted structures that witness approximate isomorphism. As an application, we show that the theory of any ‐tree or ultrametric space of finite radius is stable, improving a result of Carlisle and Henson [8]. (shrink)

The importance of the notion of common knowledge in sustaining cooperative outcomes in strategic situations is well appreciated. However, the systematic analysis of the extent to which small departures from common knowledge affect equilibrium in games has only recently been attempted.We review the main themes in this literature, in particular, the notion of common p-belief. We outline both the analytical issues raised, and the potential applicability of such ideas to game theory, computer science and the philosophy of language.

We agree with Clarke and Beck that the approximate number system represents rational numbers, and we demonstrate our support by highlighting the case of the empty set – the non-symbolic manifestation of zero. It is particularly interesting because of its perceptual and semantic uniqueness, and its exploration reveals fundamental new insights about how numerical information is represented.

In A. Kumar, & M. Banerjee [(2012). Definable and rough sets in covering-based approximation spaces. In T. Li. (eds.), Rough sets and knowledge technology (pp. 488–495). Springer-Verlag], A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], authors proposed a pair of lower and upper approximation operators based on granules generated by quasiorders. This work is an extension of algebraic results presented therein. A characterisation has been presented for those (...) quasiorder-generated covering-based approximation spaces whose corresponding collections of definable and rough sets form Stone algebras. The notion of rough lattice was proposed in A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], A. Kumar [(2020). A Study of Algebras and Logics of Rough Sets Based on Classical and Generalized Approximation Spaces. In Transactions on Rough Sets XXII, LNCS (Vol. 12485, pp. 123–251). Springer]. Some special rough lattices are introduced in this work, viz. rough Stone algebra, ∼1-complemented and ∼2-complemented rough lattices. Representations of these algebras in terms of rough sets are obtained. Moreover, logics for these algebras are shown to be sound and complete with respect to rough set semantics. (shrink)

According to an influential view, the detection of action possibilities and the selection of a plan for action are two segregated steps throughout the processing of visual information. This classical approach is committed with the assumption that two independent types of processing underlie visual perception: the semantic one, which is at the service of the identification of visually presented objects, and the pragmatic one which serves the execution of actions directed to specific parts of the same objects. However, as our (...) knowledge of vision has improved over the years, this established view has turned out to be only an approximation. This paper sets out the details of a non-modularist approach to visual perception of action possibilities and explains how to resist the lure of cognitive segregation. (shrink)

This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics, introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with n (...) -ary additive or multiplicative operators, with negation operators modally interpreted as impossibility and unnecessity, as well as with implication connectives. Order-dual relational semantics shares with the generalized Kripke frames, or the bi-approximation semantics approach, the use of both a satisfaction and a co-satisfaction relation, but it also responds to the recently voiced concerns of Craig, Haviar and Conradie about the relative non-intuitiveness of the 2-sorted semantics of the aforementioned approaches. In this article, we provide a standard interpretation of modalities and natural interpretations of both negation and implication, despite the absence of distribution. Thereby, our results contribute in creating the necessary background for research in non-distributive logics with modalities variously interpreted as dynamic, temporal etc, by analogy to the classical case. (shrink)

It's uncontroversial that notions of idealization and approximation are central to understanding computer simulations and their rationale. What's not so clear is what exactly these notions come to. Two distinct forms of approximation will be distinguished and their features contrasted with those of idealizations. These distinctions will be refined and closely tied to computer simulations by means of Scott-Strachey denotational programming semantics. The use of this sort of semantics also provides a convenient format for argumentation in favor of (...) several theses I shall propose concerning the role computer implemented approximations and idealizations play in fixing what the acceptance of an underlying scientific theory is or should be. (shrink)

This paper describes the automated classification of legal norms in German statutes with regard to their semantic type. We propose a semantic type taxonomy for norms in the German civil law domain consisting of nine different types focusing on functional aspects, such as Duties, Prohibitions, Permissions, etc. We performed four iterations in classifying legal norms with a rule-based approach using a manually labeled dataset, i.e., tenancy law, of the German Civil Code ). During this experiment the \ score continuously improved (...) from 0.52 to 0.78. In contrast, a machine learning based approach for the classification was implemented. A performance of \ was reached. Traditionally, machine learning classifiers lack of transparency with regard to their decisions. We extended our approach using so-called local linear approximations, which is a novel technique to analyze and inspect a trained classifier’s behavior. We can show that there are significant similarities of manually crafted knowledge, i.e., rules and pattern definitions, and the trained decision structures of machine learning approaches. (shrink)

In this paper, we study natural language constructions which were first examined by Barwise: The richer the country, the more powerful some of its officials. Guided by Barwise’s observations, we suggest that conceivable interpretations of such constructions express the existence of various similarities between partial orders such as homomorphism or embedding. Semantically, we interpret the constructions as polyadic generalized quantifiers restricted to finite models. We extend the results obtained by Barwise by showing that similarity quantifiers are not expressible in elementary (...) logic over finite models. We also investigate whether the proposed readings are sound from the cognitive perspective. We prove that almost all similarity quantifiers are intractable. This leads us to first-order variants, which only approximate the strong readings, but are cognitively more plausible. Driven by the question of ambiguity, we recall Barwise’s argumentation in favour of strong readings, enriching it with some arguments of our own. Given that Barwise-like sentences are indeed ambiguous, we use a generalized Strong Meaning Hypothesis to derive predictions for their verification. Finally, we propose a hypothesis according to which conflicting pressures of communication and cognition might give rise to an ambiguous construction, provided that different semantic variants of the construction withstand different pressures involved in its usage. (shrink)

There are several conceptions of truth, such as the classical correspondence conception, the coherence conception and the pragmatic conception. The classical correspondence conception, or Aristotelian conception, received a mathematical treatment in the hands of Tarski (cf. Tarski [1935] and [1944]), which was the starting point of a great progress in logic and in mathematics. In effect, Tarski's semantic ideas, especially his semantic characterization of truth, have exerted a major influence on various disciplines, besides logic and mathematics; for instance, linguistics, the (...) philosophy of science, and the theory of knowledge. The importance of the Tarskian investigations derives, among other things, from the fact that they constitute a mathematical, formal mark to serve as a reference for the philosophical (informal) conceptions of truth. Today the philosopher knows that the classical conception can be developed and that it is free from paradoxes and other difficulties, if certain precautions are taken. We believe that is not an exaggeration if we assert that Tarski's theory should be considered as one of the greatest accomplishments of logic and mathematics of our time, an accomplishment which is also of extraordinary relevance to philosophy, as we have already remarked. In this paper we show that the pragmatic conception of truth, at least in one of its possible interpretations, has also a mathematical formulation, similar in spirit to that given by Tarski to the classical correspondence conception. (shrink)

What are the pillars on which the success of modern science rest? Although philosophers have much discussed what is behind science’s success, this paper argues that much of the discussion is misdirected. The extant literature rightly regards the semantic and inferential tools of formal logic and probability theory as pillars of scientific rationality, in the sense that they reveal the justificatory structure of important aspects of scientific practice. As key elements of our rational reconstruction toolbox, they make a fundamental contribution (...) to our understanding of the success of science.At the same time, any science, however exact, is dominated by approximation, error, and uncertainty, a fact that makes one wonder how science can be so successful. This paper articulates and illustrates general themes—e.g., that truth-preserving arguments often fail to preserve approximate truth—that highlight the need for additional semantic resources. Thus, our proposal is that persistent failures to unravel the reasons behind the success of science in the face of pervasive error and uncertainty should be attributed to an insufficiently rich way of rationally reconstructing scientific and mathematical knowledge. What is missing? This paper claims that there is a third formal method of reasoning that constitutes a distinct pillar on which rests the success of science, namely, perturbation theory. The paper outlines how the representational and inferential tools of perturbation theory differ from those of logic and probability theory, and how they enable us to understand the apparently elusive aspects of the success of science.However, compared to its peers, perturbative reasoning has not received the attention it deserves. As the paper explains, this partly results from the circumstances in which perturbation theory is taught, and partly from the fact that perturbation theory first appears to be a vaguely related collection of methods offering no systematic semantic insight. In an attempt to show that this first impression is wrong, this paper presents its contribution to the semantic dimension of scientific representation and inference in terms of what I call “semantic layering.”. (shrink)

Aggregating snippets from the semantic memories of many individuals may not yield a good map of an individual’s semantic memory. The authors analyze the structure of semantic networks that they sampled from individuals through a new snowball sampling paradigm during approximately 6 weeks of 1-hr daily sessions. The semantic networks of individuals have a small-world structure with short distances between words and high clustering. The distribution of links follows a power law truncated by an exponential cutoff, meaning that most words (...) are poorly connected and a minority of words has a high, although bounded, number of connections. Existing aggregate networks mirror the individual link distributions, and so they are not scale-free, as has been previously assumed; still, there are properties of individual structure that the aggregate networks do not reflect. A simulation of the new sampling process suggests that it can uncover the true structure of an individual’s semantic memory. (shrink)

Davidson approaches the notions of meaning and interpretation with the aim of characterizing semantic competence in the syntactically characterized natural language. The objective is to provide a truth-theory for a language, generating T-sentences expressed in the semantic metalanguage, so that each sentence of the object language receives an appropriate interpretation. Proceeding within the constraints of referential semantics, I will argue for the viability of reconstructing the notion of linguistic meaning within the Tarskian theory of reference. However, the view proposed (...) here involves a revision of Davidson’s con-ception of the object of semantic investigation. Taking (idealized) language-theories as the proper object of semantic characterization, provides solutions to outstanding problems in Davidson’s views, better approximates the practice in standard model-theoretic semantics, and incorporates the elements of semantic competence sought for in tradi¬tional theories of lexical analysis. Sources of evidence beyond those emphasized by Davidson will be invoked in order to allow for the selection of interpre¬tive T-sentences. In the final section, possible Quinean objections will be considered. (shrink)

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways (...) can be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (shrink)

In this paper, I shall provide a novel response to the argument from context-sensitivity against truth-conditional semantics. It is often argued that the contextual influences on truth-conditions outstrip the resources of standard truth-conditional accounts, and so truth-conditional semantics rests on a mistake. The argument assumes that truth-conditional semantics is legitimate if and only if natural language sentences have truth-conditions. I shall argue that this assumption is mistaken. Truth-conditional analyses should be viewed as idealised approximations of the complexities (...) of natural language meaning. From this perspective, disparity between the scientific model and its real-world target is to be expected. I elaborate on what such an approach to semantics would look like. (shrink)

The prospects for moral realism and ethical naturalism have been important parts of recent debates within metaethics. As a first approximation, moral realism is the claim that there are facts or truths about moral matters that are objective in the sense that they obtain independently of the moral beliefs or attitudes of appraisers. Ethical naturalism is the claim that moral properties of people, actions, and institutions are natural, rather than occult or supernatural, features of the world. Though these metaethical debates (...) remain unsettled, several people, myself included, have tried to defend the plausibility of both moral realism and ethical naturalism. I, among others, have appealed to recent work in the philosophy of language—in particular, to so-called theories of “direct reference” —to defend ethical naturalism against a variety of semantic worries, including G. E. Moore's “open question argument.” In response to these arguments, critics have expressed doubts about the compatibility of moral realism and direct reference. In this essay, I explain these doubts, and then sketch the beginnings of an answer—but understanding both the doubts and my answer requires some intellectual background. (shrink)

The central concern of this article is whether the semantic approach has the resources to appropriately capture the core tenets of structural realism. Chakravartty (2001) has argued that a realist notion of correspondence cannot be accommodated without introducing a linguistic component, which undermines the approach itself. We suggest that this worry can be addressed by an appropriate understanding of the role of language in this context. The real challenge, however, is how to incorporate the core notion of `explanatory approximate (...) truth' in such a way that the emphasis on structure is retained. (shrink)

While the use of so-called idealizations in science has been widely recognized for many years, the philosophical problems that arise from this use have received relatively little attention. Even a cursory reading of the philosophical literature devoted to these problems reveals that the following questions remain unanswered: In general, what, if any, are the distinguishing characteristics of idealizations? More specifically, do idealizations have any distinguishing syntactic or semantic characteristics? In addition to these questions there exist the following pragmatic questions, questions (...) relating to the ways in which idealizations are used in science: How are idealizations used in explanations?. Do these explanations have any peculiar characteristics—characteristics not shared by deductive-nomological explanations? If we assume that idealizations are false or “do not obtain,” how is it that they can have any explanatory power?. Further, there are questions of more general philosophic concern. How do the problems of idealizations relate to those of simplicity, for an idealization seems to be, in some sense, a type of simplification? How do the problems of ideal laws and theories relate to the general problems of scientific laws and theories? (shrink)

The meaning of 'most' can be described in many ways. We offer a framework for distinguishing semantic descriptions, interpreted as psychological hypotheses that go beyond claims about sentential truth conditions, and an experiment that tells against an attractive idea: 'most' is understood in terms of one-to-one correspondence. Adults evaluated 'Most of the dots are yellow', as true or false, on many trials in which yellow dots and blue dots were displayed for 200 ms. Displays manipulated the ease of using a (...) 'one-to-one with remainder' strategy, and a strategy of using the Approximate Number System to compare of (approximations of) cardinalities. Interpreting such data requires care in thinking about how meaning is related to verification. But the results suggest that 'most' is understood in terms of cardinality comparison, even when counting is impossible. (shrink)

This contribution aims at providing an argumentative method to account for epistemic modality and evidentiality. I claim that these two linguistic categories can work as semantic components of defeasible argumentative schemes based on classification processes. This kind of approximate reasoning is, in fact, frequently indicated by appearance verbs which signal that the inferred standpoint is conceived by the speaker as uncertain due to the deceiving nature of perceptual data. Drawing from an analysis at the semantic-argumentative interface, the way in (...) which prototype theory sheds light on the processes of meaning construction underlying defeasible arguments from definition is also shown. (shrink)

A number of prominent metaphysicians have recently defended a set of ideas which I will call ‘essentialist plenitude.’ Very roughly, and to a first approximation, essentialist plenitude says that wherever there is an object with properties P1, …, Pn there is in fact a plenitude of coincident objects that differ only in the distribution of essentiality and accidentality across P1, …, Pn (§1). The main purpose of this paper is to arouse the suspicion that essentialist plenitude may have far-reaching consequences (...) for the semantics of proper names. More specifically, I will argue that neither descriptivist nor causal theories of proper names work in a plenitude setting (§2). I will close by suggesting that our use of proper names may be thoroughly infected by semantic indecision about which among many coincident objects is referred to (§3). (shrink)

Three influential forms of realism are distinguished and interrelated: realism about the external world, construed as a metaphysical doctrine; scientific realism about non-observable entities postulated in science; and semantic realism as defined by Dummett. Metaphysical realism about everyday physical objects is contrasted with idealism and phenomenalism, and several potent arguments against these latter views are reviewed. -/- Three forms of scientific realism are then distinguished: (i) scientific theories and their existence postulates should be taken literally; (ii) the existence of unobservable (...) entities posited by our most successful scientific theories is justified scientifically; and (iii) our best current scientific theories are at least approximately true. It is argued that only some form of scientific realism can make proper sense of certain episodes in the history of science. -/- Finally, Dummett’s influential formulation of semantic issues about realism considered. Dummett argued that in some cases, the fundamental issue is not about the existence of entities, but rather about whether statements of some specified class (such as mathematics) have an objective truth value, independently of our means of knowing it. Dummett famously argued against such semantic realism and in favor of anti-realism. The relation of semantic realism to the metaphysical construal of realism and Dummett’s main argument against semantic realism is examined. (shrink)

Recent studies of semantic memory have investigated two theories of optimal search adopted from the animal foraging literature: Lévy flights and marginal value theorem. Each theory makes different simplifying assumptions and addresses different findings in search behaviors. In this study, an experiment is conducted to test whether clustering in semantic memory may play a role in evidence for both theories. Labeled magnets and a whiteboard were used to elicit spatial representations of semantic knowledge about animals. Category recall sequences from a (...) separate experiment were used to trace search paths over the spatial representations of animal knowledge. Results showed that spatial distances between animal names arranged on the whiteboard were correlated with inter-response intervals during category recall, and distributions of both dependent measures approximated inverse power laws associated with Lévy flights. In addition, IRIs were relatively shorter when paths first entered animal clusters, and longer when they exited clusters, which is consistent with marginal value theorem. In conclusion, area-restricted searches over clustered semantic spaces may account for two different patterns of results interpreted as supporting two different theories of optimal memory foraging. (shrink)

In this paper, I shall provide a novel response to the argument from context-sensitivity against truth-conditional semantics. It is often argued that the contextual influences on truth-conditions outstrip the resources of standard truth-conditional accounts, and so truth-conditional semantics rests on a mistake. The argument assumes that truth-conditional semantics is legitimate if and only if natural language sentences have truth-conditions. I shall argue that this assumption is mistaken. Truth-conditional analyses should be viewed as idealised approximations of the complexities (...) of natural language meaning. From this perspective, disparity between the scientific model and its real-world target is to be expected. I elaborate on what such an approach to semantics would look like. (shrink)

Computational modeling and eye-tracking were used to investigate how phonological and semantic information interact to influence the time course of spoken word recognition. We extended our recent models to account for new evidence that competition among phonological neighbors influences activation of semantically related concepts during spoken word recognition . The model made a novel prediction: Semantic input modulates the effect of phonological neighbors on target word processing, producing an approximately inverted-U-shaped pattern with a high phonological density advantage at an intermediate (...) level of semantic input—in contrast to the typical disadvantage for high phonological density words in spoken word recognition. This prediction was confirmed with a new analysis of the Apfelbaum et al. data and in a visual world paradigm experiment with preview duration serving as a manipulation of strength of semantic input. These results are consistent with our previous claim that strongly active neighbors produce net inhibitory effects and weakly active neighbors produce net facilitative effects. (shrink)

Computational models of meaning trained on naturally occurring text successfully model human performance on tasks involving simple similarity measures, but they characterize meaning in terms of undifferentiated bags of words or topical dimensions. This has led some to question their psychological plausibility (Murphy, 2002;Schunn, 1999). We present here a fully automatic method for extracting a structured and comprehensive set of concept descriptions directly from an English part‐of‐speech‐tagged corpus. Concepts are characterized by weighted properties, enriched with concept–property types that approximate (...) classical relations such as hypernymy and function. Our model outperforms comparable algorithms in cognitive tasks pertaining not only to concept‐internal structures (discovering properties of concepts, grouping properties by property type) but also to inter‐concept relations (clustering into superordinates), suggesting the empirical validity of the property‐based approach. (shrink)

Abstract: We propose a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this semantic view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this (...) theory provides a general framework within which we can understand the relation between vague terms and concepts and the corresponding crisp portions of reality. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. Central to our approach is the idea that judgments about reality involve in every case (1) a separation of reality into foreground and background of attention and (2) the feature of granularity. On this basis we attempt to show that even vague judgments made in naturally occurring contexts are not marked by truth-value indeterminacy. We distinguish, in addition to crisp granular partitions, also vague partitions, and reference partitions, and we explain the role of the latter in the context of judgments that involve vagueness. We conclude by showing how reference partitions provide an effective means by which judging subjects are able to temper the vagueness of their judgments by means of approximations. (shrink)

Computational models of meaning trained on naturally occurring text successfully model human performance on tasks involving simple similarity measures, but they characterize meaning in terms of undifferentiated bags of words or topical dimensions. This has led some to question their psychological plausibility (Murphy, 2002;Schunn, 1999). We present here a fully automatic method for extracting a structured and comprehensive set of concept descriptions directly from an English part‐of‐speech‐tagged corpus. Concepts are characterized by weighted properties, enriched with concept–property types that approximate (...) classical relations such as hypernymy and function. Our model outperforms comparable algorithms in cognitive tasks pertaining not only to concept‐internal structures (discovering properties of concepts, grouping properties by property type) but also to inter‐concept relations (clustering into superordinates), suggesting the empirical validity of the property‐based approach. (shrink)

This short paper about fuzzy set-based approximate reasoning first emphasizes the three main semantics for fuzzy sets: similarity, preference and uncertainty. The difference between truth-functional many-valued logics of vague or gradual propositions and non fully compositional calculi such as possibilistic logic or similarity logics is stressed. Then, potentials of fuzzy set-based reasoning methods are briefly outlined for various kinds of approximate reasoning: deductive reasoning about flexible constraints, reasoning under uncertainty and inconsistency, hypothetical reasoning, exception-tolerant plausible reasoning using (...) generic knowledge, interpolative reasoning, and abductive reasoning. Open problems are listed in the conclusion. (shrink)

Audio features such as inharmonicity, noisiness, and spectral roll-off have been identified as correlates of “noisy” sounds. However, such features are likely involved in the experience of multiple semantic timbre categories of varied meaning and valence. This paper examines the relationships of stimulus properties and audio features with the semantic timbre categories raspy/grainy/rough, harsh/noisy, and airy/breathy. Participants rated a random subset of 52 stimuli from a set of 156 approximately 2-s orchestral instrument sounds representing varied instrument families, registers, and both (...) traditional and extended playing techniques. Stimuli were rated on the three semantic categories of interest, as well as on perceived playing exertion and emotional valence. Correlational analyses demonstrated a strong negative relationship between positive valence and perceived physical exertion. Exploratory linear mixed models revealed significant effects of extended technique and pitch register on valence, the perception of physical exertion, raspy/grainy/rough, and harsh/noisy. Instrument family was significantly related to ratings of airy/breathy. With an updated version of the Timbre Toolbox, we used 44 summary audio features, extracted from the stimuli using spectral and harmonic representations, as input for various models built to predict mean semantic ratings for each sound on the three semantic categories, on perceived exertion, and on valence. Random Forest models predicting semantic ratings from audio features outperformed Partial Least-Squares Regression models, consistent with previous results suggesting that non-linear methods are advantageous in timbre semantic predictions using audio features. Relative Variable Importance measures from the models among the three semantic categories demonstrate that although these related semantic categories are associated in part with overlapping features, they can be differentiated through individual patterns of audio feature relationships. (shrink)

The category of coherent phase spaces introduced by the author is a refinement of the symplectic “category” of A. Weinstein. This category is *-autonomous and thus provides a denotational model for Multiplicative Linear Logic. Coherent phase spaces are symplectic manifolds equipped with a certain extra structure of “coherence”. They may be thought of as “infinitesimal” analogues of familiar coherent spaces of Linear Logic. The role of cliques is played by Lagrangian submanifolds of ambient spaces. Physically, a symplectic manifold is the (...) phase space of a classical dynamical system, and a Lagrangian submanifold is a phase of a short-wave oscillation. Typically, Lagrangian submanifolds represent such objects as short-wave approximations of wave functions in asymptotic quantization and wave fronts in geometrical optics. The coherent phase space semantics was motivated to a large extent by methods of geometric and asymptotic quantization and suggests some interesting intuitions on Linear Logic. In particular Lagrangian submanifold-cliques of types A and A can be interpreted as semiclassical limits of eigenstates of respectively position and momentum observables. These observables being canonically conjugate cannot be measured simultaneously, which corresponds to the idea that a formula A and its negation A cannot both simultaneously have proofs . We show that the coherent phase space semantics of Linear Logic enjoys several completeness properties in general much stronger than the usual full completeness with respect to the class of dinatural transformations. These properties of completeness in conjunction with a quite natural -physical meaning make the coherent phase space semantics an interesting object of investigation. (shrink)

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS (...) computational knowledge-representation system, the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

All humans can interpret sentences of their native language quickly and without effort. Working from the perspective of generative grammar, the contributors investigate three mental mechanisms, widely assumed to underlie this ability: compositional semantics, implicature computation and presupposition computation. This volume brings together experts from semantics and pragmatics to bring forward the study of interconnections between these three mechanisms. The contributions develop new insights into important empirical phenomena; for example, approximation, free choice, accommodation, and exhaustivity effects.

Sophisticated senator and legislative onion. Whether or not you have ever heard of these things, we all have some intuition that one of them makes much less sense than the other. In this paper, we introduce a large dataset of human judgments about novel adjective-noun phrases. We use these data to test an approach to semantic deviance based on phrase representations derived with compositional distributional semantic methods, that is, methods that derive word meanings from contextual information, and approximate phrase (...) meanings by combining word meanings. We present several simple measures extracted from distributional representations of words and phrases, and we show that they have a significant impact on predicting the acceptability of novel adjective-noun phrases even when a number of alternative measures classically employed in studies of compound processing and bigram plausibility are taken into account. Our results show that the extent to which an attributive adjective alters the distributional representation of the noun is the most significant factor in modeling the distinction between acceptable and deviant phrases. Our study extends current applications of compositional distributional semantic methods to linguistically and cognitively interesting problems, and it offers a new, quantitatively precise approach to the challenge of predicting when humans will find novel linguistic expressions acceptable and when they will not. (shrink)

The human conceptual system comprises simulated information of sensorimotor experience and linguistic distributional information of how words are used in language. Moreover, the linguistic shortcut hypothesis predicts that people will use computationally cheaper linguistic distributional information where it is sufficient to inform a task response. In a pre‐registered category production study, we asked participants to verbally name members of concrete and abstract categories and tested whether performance could be predicted by a novel measure of sensorimotor similarity (based on an 11‐dimensional (...) representation of sensorimotor strength) and linguistic proximity (based on word co‐occurrence derived from a large corpus). As predicted, both measures predicted the order and frequency of category production but, critically, linguistic proximity had an effect above and beyond sensorimotor similarity. A follow‐up study using typicality ratings as an additional predictor found that typicality was often the strongest predictor of category production variables, but it did not subsume sensorimotor and linguistic effects. Finally, we created a novel, fully grounded computational model of conceptual activation during category production, which best approximated typical human performance when conceptual activation was allowed to spread indirectly between concepts, and when candidate category members came from both sensorimotor and linguistic distributional representations. Critically, model performance was indistinguishable from typical human performance. Results support the linguistic shortcut hypothesis in semantic processing and provide strong evidence that both linguistic and grounded representations are inherent to the functioning of the conceptual system. All materials, data, and code are available at https://osf.io/vaq56/. (shrink)

A utility-based approach to the understanding of vague predicates (VPs) is proposed. It is argued that assignment of truth values to propositions containing VPs entails unjustifiable assumptions of consensus; two models of VP semantics are criticized on this basis: (1) the super-truth theory of Kit Fine (1975), which requires an unlikely consensus on base points; (2) the fuzzy logic of Lotfi Zadeh (1975), on fuzzy truth values of sentences. Pragmatism is held to provide a key: successful behavior justifies a (...) person's knowledge of the content of a VP. Instead of attempting to determine a consensus underlying successful communication, the utility of individual communications is held to rest on sufficient approximation of meanings between people. 3 Figures, 17 References. Adapted from the source document. (shrink)