The semantic rules governing naturallanguage quantifiers (e.g. "all," "some," "most") neither coincide with nor resemble the semantic rules governing the analogues of those expressions that occur in the artificial languages used by semanticists. Some semanticists, e.g. Peter Strawson, have put forth data-consistent hypotheses as to the identities of the semantic rules governing some natural-language quantifiers. But, despite their obvious merits, those hypotheses have been universally rejected. In this paper, it is shown that those hypotheses are (...) indeed correct. Moreover, data-consistent hypotheses are put forth as to the identities of the semantic rules governing the words "most" and "many," the semantic rules governing which semanticists have thus far been unable to identify. The points made in this paper are anticipated in a paper, published in the same issue of the Journal of Pragmatics, by Andrzej Boguslawski. (shrink)
The Monist’s call for papers for this issue ended: “if formalism is true, then it must be possible in principle to mechanize meaning in a conscious thinking and language-using machine; if intentionalism is true, no such project is intelligible”. We use the Grelling-Nelson paradox to show that naturallanguage is indefinitely extensible, which has two important consequences: it cannot be formalized and model theoretic semantics, standard for formal languages, is not suitable for it. We also point out (...) that object-object mapping theories of semantics, the usual account for the possibility of non intentional semantics, doesn’t seem able to account for the indefinitely extensible productivity of naturallanguage. (shrink)
Hauser defends the proposition that our languages of thought are public languages. One group of arguments points to the coincidence of clearly productive (novel, unbounded) cognitive competence with overt possession of recursive symbol systems. Another group relies on phenomenological experience. A third group cites practical and methodological considerations: Occam's razor and the "streetlight principle" (other things being equal, look under the lamp) that motivate looking for instantiations of outer languages in thought first.
Uses connectionism (neural networks) to extract the "gist" of a story in order to represent a context going forward for the disambiguation of incoming words as a text is processed.
This chapter outlines a new argument for the view that language has a cognitive role. I suggest that humans exhibit two distinct kinds of belief state, one passively formed, the other actively formed. I argue that actively formed beliefs (_virtual beliefs_, as I call them) can be identified with _premising policies_, and that forming them typically involves certain linguistic operations. I conclude that naturallanguage has at least a limited cognitive role in the formation and manipulation of (...) virtual beliefs. (shrink)
The paper sets out to offer an alternative to the function/argument approach to the most essential aspects of naturallanguage meanings. That is, we question the assumption that semantic completeness (of, e.g., propositions) or incompleteness (of, e.g., predicates) exactly replicate the corresponding grammatical concepts (of, e.g., sentences and verbs, respectively). We argue that even if one gives up this assumption, it is still possible to keep the compositionality of the semantic interpretation of simple predicate/argument structures. In our opinion, (...) compositionality presupposes that we are able to compare arbitrary meanings in term of information content. This is why our proposal relies on an ‘intrinsically’ type free algebraic semantic theory. The basic entities in our models are neither individuals, nor eventualities, nor their properties, but ‘pieces of evidence’ for believing in the ‘truth’ or ‘existence’ or ‘identity’ of any kind of phenomenon. Our formal language contains a single binary non-associative constructor used for creating structured complex terms representing arbitrary phenomena. We give a finite Hilbert-style axiomatisation and a decision algorithm for the entailment problem of the suggested system. (shrink)
Situation semantics was developed as an alternative to possible worlds semantics. In situation semantics, linguistic expressions are evaluated with respect to partial, rather than complete, worlds. There is no consensus about what situations are, just as there is no consensus about what possible worlds or events are. According to some, situations are structured entities consisting of relations and individuals standing in those relations. According to others, situations are particulars. In spite of unresolved foundational issues, the partiality provided by situation semantics (...) has led to some genuinely new approaches to a variety of phenomena in naturallanguage semantics. In the way of illustration, this article includes relatively detailed overviews of a few selected areas where situation semantics has been successful: implicit quantifier domain restrictions, donkey pronouns, and exhaustive interpretations. It moreover addresses the question of how Davidsonian event semantics can be embedded in a semantics based on situations. Other areas where a situation semantics perspective has led to progress include attitude ascriptions, questions, tense, aspect, nominalizations, implicit arguments, point of view, counterfactual conditionals, and discourse relations. (shrink)
Abstract A common view is that naturallanguage treats numbers as abstract objects, with expressions like the number of planets , eight , as well as the number eight acting as referential terms referring to numbers. In this paper I will argue that this view about reference to numbers in naturallanguage is fundamentally mistaken. A more thorough look at naturallanguage reveals a very different view of the ontological status of natural numbers. (...) On this view, numbers are not primarily treated abstract objects, but rather ‘aspects’ of pluralities of ordinary objects, namely number tropes, a view that in fact appears to have been the Aristotelian view of numbers. Naturallanguage moreover provides support for another view of the ontological status of numbers, on which natural numbers do not act as entities, but rather have the status of plural properties, the meaning of numerals when acting like adjectives. This view matches contemporary approaches in the philosophy of mathematics of what Dummett called the Adjectival Strategy, the view on which number terms in arithmetical sentences are not terms referring to numbers, but rather make contributions to generalizations about ordinary (and possible) objects. It is only with complex expressions somewhat at the periphery of language such as the number eight that reference to pure numbers is permitted. Content Type Journal Article Pages 1-38 DOI 10.1007/s11098-011-9779-1 Authors Friederike Moltmann, IHPST (Paris1/ENS/CNRS), Paris, France Journal Philosophical Studies Online ISSN 1573-0883 Print ISSN 0031-8116. (shrink)
In game-theoretical semantics, perfectlyclassical rules yield a strong negation thatviolates tertium non datur when informationalindependence is allowed. Contradictorynegation can be introduced only by a metalogicalstipulation, not by game rules. Accordingly, it mayoccur (without further stipulations) onlysentence-initially. The resulting logic (extendedindependence-friendly logic) explains several regularitiesin natural languages, e.g., why contradictory negation is abarrier to anaphase. In naturallanguage, contradictory negationsometimes occurs nevertheless witin the scope of aquantifier. Such sentences require a secondary interpretationresembling the so-called substitutionalinterpretation of quantifiers.This interpretation (...) is sometimes impossible,and it means a step beyond thenormal first-order semantics, not an alternative to it. (shrink)
Natural languages are vehicles of information, arguably the most important, certainly the most ubiquitous that humans possess. Our everyday interactions with the world, with each other and with ourselves depend on them. And even where in the specialised contexts of science we use dedicated formalisms to convey information, their use is embedded in naturallanguage.1..
Philosophers have defended various views about abstract objects by appealing to metaphysical considerations, considerations regarding mathematics or science, and, not infrequently, intuitions about naturallanguage. This book pursues the question of how and whether naturallanguage allows for reference to abstract objects in a fully systematic way. By making full use of contemporary linguistic semantics, it presents a much greater range of linguistic generalizations than has previously been taken into consideration in philosophical discussions, and it argues (...) for an ontological picture is very different from that generally taken for granted by philosophers and semanticists alike. Reference to abstract objects such as properties, numbers, propositions, and degrees is considerably more marginal than generally held. (shrink)
The paper presents a proof-theoretic semantics (PTS) for a fragment of naturallanguage, 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)
In this paper, I present a decision procedure for evaluating arguments expressed in naturallanguage. I think that other instructors of informal logic and critical thinking might find this decision procedure to be a useful addition to their teaching resources.
In the dissertation we study the complexity of generalized quantifiers in naturallanguage. 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 naturallanguage 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 naturallanguage. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in naturallanguage. 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 naturallanguage. 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 essay considers what it means to understand naturallanguage and whether a computer running an artificial-intelligence program designed to understand naturallanguage does in fact do so. It is argued that a certain kind of semantics is needed to understand naturallanguage, 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 naturallanguage are discussed, and a prototype natural-language-understanding system is presented as an illustration. (shrink)
We study the computational complexity of polyadic quantifiers in naturallanguage. 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 naturallanguage multi-quantifier expressions. Next, we focus on a linguistic case study. We use 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)
This is a review of From Discourse to Logic: Introduction to Model-theoretic Semantics of NaturalLanguage, Formal Logic and Discourse Representation Theory, by Hans Kamp and Uwe Reyle, published by Kluwer Academic Publishers in 1993.
An -ever free relative is felicitous only when the speaker doesn’t know, or doesn’t care about, the identity of the entity denoted. In this paper we investigate what it means to identify an entity by examining the non-identification condition on -ever free relatives. Following Dayal (In A. Lawson (Ed.), Proceedings of SALT VII, 1997 ), we analyze -ever free relatives as definites with a modal dimension. We show that the variation in the identity of the entity across the possible worlds (...) in the modal dimension cannot be captured in a model where transworld identity is expressed using a single trivial principle of identity, and present an analysis within a model where transworld identity is relativized to noun meanings, which has been proposed in the philosophical literature for other reasons (Geach 1968 ; Gupta, The logic of common nouns: an investigation in quantified modal logic, 1980 ). The analysis thus shows that naturallanguage semantics is sensitive to relative identity in the sense of Geach and Gupta; furthermore, it sets the stage for a new typology of referring expressions based on which expression types contribute principles of transworld identity. (shrink)
Recent work in naturallanguage semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ xn and q1x 1⋯ (...) qnx nRx 1⋯ xn are logically equivalent for arbitrary generalized quantifiers Qi, qi. GPT generalizes, perhaps in an unexpectedly strong form, the Linear Prefix Theorem (appropriately modified) of Keisler & Walkoe (1973). (shrink)
We present Property Theory with Curry Typing (PTCT), an intensional first-order logic for naturallanguage semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types.1 We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like most. We use the type system and our treatment of generalized quantifiers in naturallanguage to construct a type-theoretic approach to pronominal anaphora that avoids some of the difficulties that undermine (...) previous type-theoretic analyses of this phenomenon. (shrink)
The present paper is an attempt at the investigation of the nature of polarity contrast in natural languages. Truth conditions for naturallanguage sentences are incomplete unless they include a proper definition of the conditions under which they are false. It is argued that the tertium non datur principle of classical bivalent logical systems is empirically invalid for natural languages: falsity cannot be equated with non-truth. Lacking a direct intuition about the conditions under which a sentence (...) is false, we need an independent foundation of the concept of falsity. The solution I offer is a definition of falsity in terms of the truth of a syntactic negation of the sentence. A definition of syntactic negation is proposed for English (Section 1). The considerations are applied to the analysis of definites in non-generic sentences and the analysis of generic indefinites. These two domains are investigated in breadth and some depth and the analyses compared and connected. During the discussion of non-generic predications with definite arguments and their respective negations (Section 2), a theory of predication is developed, basic to which is the distinction between integrative and summative predication. Summative predication, e.g., distributive plural, leads to contrary, all-or-no-thing, polarity contrasts due to the fundamental Presupposition of Indivisibility. Further-more, levels of predication are distinguished that are built up by various processes of constructing macropredications from lexical predicates. Given this analysis, particular (i.e., non-generic) quantification (Section 3) can be reanalyzed as an integrative, first-order form of predication that fills the truth-value gaps created by summative predication. The account comprises both nominal and adverbial quantification and relates quantification to the simpler types of predication discussed in Section 2. (shrink)
This contribution investigates the role ofcontext in natural-language communication bydifferentiating between linguistic andsociocultural contexts. It is firmly anchoredto a dialogue framework and based on arelational conception of context as astructured and interactionally organisedphenomenon. However, context is not onlyexamined from this bottom-up or microperspective, but also from a top-down or macroviewpoint as pre- and co-supposed socioculturalcontext. Here, context is not solely seen as aninteractionally organised phenomenon, butrather as a sociocultural apparatus whichstrongly influences the interpretation of microsituations.The section, micro building (...) blocks andlocal meaning, argues for a sociopragmaticapproach to natural-language communication thusaccommodating both speech act theory andconversation analysis. It examines the questionof how linguistic and sociocultural contextsare accommodated by the micro building blocksof speech act and turn, and speaker and hearer.The results obtained are systematised in thesection, micro meets macro, and adaptedto the requirements of the dialogue act ofa plus/minus-validity claimbased on thecontextualisation of Jürgen Habermas''sconception of ratification of validityclaimadopted from this theory ofcommunicative action(1987). The definition ofa plus/minus-validity claim is furthersupplemented by the Gricean CooperativePrinciple, the ethnomethodological premise ofaccountability of social action, theconversation-analytic notion of sequentialorganisation and the interpersonal concepts offace and participation format. Validity claimsare discussed from both bottom-up and top-downperspectives stressing the dynamics of contextwith regard to both process and product, andselection and construction. (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 naturallanguage 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)
This paper is a contribution to the reconstruction of Tarski’s semantic background in the light of the ideas of his master, Stanislaw Lesniewski. Although in his 1933 monograph Tarski credits Lesniewski with crucial negative results on the semantics of naturallanguage, the conceptual relationship between the two logicians has never been investigated in a thorough manner. This paper shows that it was not Tarski, but Lesniewski who first avowed the impossibility of giving a satisfactory theory of truth for (...) ordinary language, and the necessity of sanitation of the latter for scientific purposes. In an early article (1913) Lesniewski gave an interesting solution to the Liar Paradox, which, although different from Tarski’s in detail, is nevertheless important to Tarski’s semantic background. To illustrate this I give an analysis of Lesniewski’s solution and of some related aspects of Lesniewski’s later thought. (shrink)
To address complications involving ambiguity, presupposition and implicature, three processes underlying naturallanguage interpretation are isolated: translation, entailment and attunement. A meta-language integrating these processes is outlined, elaborating on a proof-theoretic approach to presupposition.
A formal, computational, semantically clean representation of naturallanguage is presented. This representation captures the fact that logical inferences in naturallanguage crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases.The representation parallels naturallanguage in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and (...) negation in naturallanguage by computable operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. (shrink)
Taking as its starting point significant similarities between a formal language model—Grammar Systems—and a grammatical theory—Autolexical Syntax—in this paper we suggest the application of the former to the topic of the latter. To show the applicability of Grammar Systems Theory to grammatical description, we introduce a formal-language-theoretic framework for the architecture of naturallanguage grammar: Linguistic Grammar Systems. We prove the adequacy of this model by highlighting its features (modularity, parallelism, interaction) and by showing the similarity (...) between this framework and accepted and well-known grammatical models (e.g. Autolexical Syntax). (shrink)
We develop a framework for naturallanguage semantics which handles intensionality via metalogical constructions and deals with degree truth values in an integrated way. We take an axiomatic set theory, ZF, as the foundation for semantic representations, but we make ZF a metalanguage for part of itself by embedding a language ℒ within ZF which is basically a copy of the part of ZF consisting of set expressions. This metalogical set-up is used for handling propositional attitude verbs (...) (limited to believe in this paper). We define a truth function τ which determines the truth value τ(p, T) of an ℒ-proposition p with respect to a theory T. Theories are sets of ℒ-propositions with associated truth values, and can be viewed as a (much more well-defined) replacement for possible worlds. We develop a mechanism for defining belief worlds as theories. We simultaneously develop two different versions of our system - a Boolean version where the set Ω of truth values is {0, 1}, and a degree-truth version where Ω is the interval [0, 1] of real numbers. We use degrees of truth in handling a broad class of semantic predicates that we call base-focus predicates, which include generalized quantifiers as well as many adverb and adjective senses and certain discourse-level predicates. (shrink)
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties – here called CE quantifiers – one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further (...) identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and naturallanguage quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle. (shrink)
��Naturallanguage understanding involves the simul- taneous consideration of a large number of different sources of information. Traditional methods employed in language analysis have focused on developing powerful formalisms to represent syntactic or semantic structures along with rules for transforming language into these formalisms. However, they make use of only small subsets of knowledge. This article will describe how to use the whole range of information through a neurosymbolic architecture which is a hybridization of a symbolic (...) network and subsymbol vectors generated from a connectionist network. Besides initializing the symbolic network with prior knowledge, the subsymbol vectors are used to enhance the system’s capability in disambiguation and provide flexibility in sentence understand- ing. The model captures a diversity of information including word associations, syntactic restrictions, case-role expectations, semantic rules and context. It attains highly interactive processing by representing knowledge in an associative network on which actual semantic inferences are performed. An integrated use of previously analyzed sentences in understanding is another important feature of our model. The model dynamically se- lects one hypothesis among multiple hypotheses. This notion is supported by three simulations which show the degree of disambiguation relies both on the amount of linguistic rules and the semantic-associative information available to support the inference processes in naturallanguage understanding. Unlike many similar systems, our hybrid system is more sophisticated in tackling language disambiguation problems by using linguistic clues from disparate sources as well as modeling context effects into the sentence analysis. It is potentially more powerful than any systems relying on one processing paradigm. (shrink)
An Example for NaturalLanguage Understanding and the AI Problems it Raises I think this 1976 memorandum is of 1996 interest. The problems it raises haven't been solved or even substantially reformulated.
What is a variable and in which sense can we say that naturallanguage contains variables? Inspecting the Oxford Advanced Learner’s Dictionary we learn that a variable is a ‘variable thing or quantity’. The American Heritage Dictionary of the English Language tells us that a variable is (1) ‘something that varies or is prone to variation’; (2) within astronomy, ‘a variable star’; and (3) within mathematics, ‘a quantity capable of assuming any of a set of values’ or (...) ‘a symbol representing such a quantity’. Penguin’s Dictionary of Mathematics states that a variable is (1) ‘a mathematical entity that can stand for any of the members of a set’ and (2) ‘an expression in logic that can stand for any element of a set (called the domain) over which it is said to range’. The Oxford Dictionary of Philosophy gives no explicit definition, but explicates a variable informally as something which can replace a word in a sentence and which can then be seen as ‘pointing’ at different members of a domain. From this mini-recherché two senses of ‘variable’ seem to emerge a narrower sense, in which a variable is something which inhabits the realms of logics and mathematics, and a wider sense in which a variable is simply anything that varies. It seems also clear that this latter concept of variable is wide to the point of not being a concept at all (for surely any thing can be seen as somehow varying, i.e. changing, evolving, or displaying varying aspects etc.), and therefore the only concept we really have is the narrower one. This means that we should see variables as primarily a matter of logical and mathematical calculi. Does this mean that it makes no real sense to speak about variables in connection with naturallanguage? Of course not: naturallanguage is in various respects similar to formal calculi; and formal calculi are employed, in various ways, to regiment, analyze or explicate it. It might therefore be both possible and reasonable to transfer the concept from the latter to the former.. (shrink)
Natural languages are vehicles of information, arguably the most important, certainly the most ubiquitous that humans possess. Our everyday interactions with the world, with each other and with ourselves depend on them. And even where in the specialised contexts of science we use dedicated formalisms to convey information, their use is embedded in naturallanguage. This omnipresence of naturallanguage is due in large part to its flexibility, which is almost always a virtue, sometimes a (...) vice. Natural languages are able to carry information in a wide variety of ways, about a seemingly unlimited range of topics, which makes them both efficient and versatile, and hence useful in almost every circumstance. But sometimes, when pinpoint precision is what counts, this versatility can get in the.. (shrink)
In this paper we introduce a theoretical framework and a logical application for analyzing the semantics and pragmatics of contrastive conjunctions in naturallanguage. It is shown how expressions like although, nevertheless, yet and but are semantically definable as connectives using an operator for implication in naturallanguage and how similar pragmatic principles affect the behaviour of both contrastive conjunctions and indicative conditionals. Following previous proposals, conditions on contrast in a conjunction are analyzed as presuppositions of (...) the conjunction. Further linguistic evidence leads to a distinction between restrictive and non-restrictive connectives of contrast, and consequently between direct and indirect contrast, which are given a precise definition. (shrink)
I will argue (contra Carruthers) that accepting naturallanguage as the format of many of our thoughts should entail accepting a version of Whorfian relativism and that, rather than something to be avoided, evidence from bilingual cognition suggests that incorporating this idea into future research would yield further insights into the cognitive functions of naturallanguage.
In this paper a logical interpretation of semantic nets and graph grammars is proposed for modelling naturallanguage understanding and creating language understanding computer systems. An example of parsing a Finnish question by graph grammars and inferring the answer to it by a semantic net representation is provided.
Machine learning and statistical methods have yielded impressive results in a wide variety of naturallanguage processing tasks. These advances have generally been regarded as engineering achievements. In fact it is possible to argue that the success of machine learning methods is significant for our understanding of the cognitive basis of language acquisition and processing. Recent work in unsupervised grammar induction is particularly relevant to this issue. It suggests that knowledge of language can be achieved through (...) general learning procedures, and that a richly articulated language faculty is not required to explain its acquisition. (shrink)
This paper presents a novel approach to the unsupervised learning of syntactic analyses of naturallanguage text. Most previous work has focused on maximizing likelihood according to generative PCFG models. In contrast, we employ a simpler probabilistic model over trees based directly on constituent identity and linear context, and use an EM-like iterative procedure to induce structure. This method produces much higher quality analyses, giving the best published results on the ATIS dataset.
Functions of type n are characteristic functions on n-ary relations. In Beyond the Frege Boundary [6], Keenan established their importance for naturallanguage semantics, by showing that naturallanguage has many examples of irreducible type n functions, where he called a function of type n reducible if it can be represented as a composition of functions of type 1 . We will give a normal form theorem for functions of type n , and use this to (...) show that naturallanguage has many examples of irreducible type n functions in a much stronger sense, where we take a function to be reducible if it can be represented as a composition of functions of lower types. (shrink)
We describe a knowledge representation and inference formalism, based on an intensional propositional semantic network, in which variables are structures terms consisting of quantifier, type, and other information. This has three important consequences for naturallanguage processing. First, this leads to an extended, more natural formalism whose use and representations are consistent with the use of variables in naturallanguage in two ways: the structure of representations mirrors the structure of the language and allows (...) re-use phenomena such as pronouns and ellipsis. Second, the formalism allows the specification of description subsumption as a partial ordering on related concepts (variable nodes in a semantic network) that relates more general concepts to more specific instances of that concept, as is done in language. Finally, this structured variable representation simplifies the resolution of some representational difficulties with certain classes of naturallanguage sentences, namely, donkey sentences and sentences involving branching quantifiers. The implementation of this formalism is called ANALOG (A NAtural LOGIC) and its utility for naturallanguage processing tasks is illustrated. (shrink)
Good communication is vital in healthcare both among healthcare professionals and be tween healthcare professionals and their patients And well written documents describing and or explaining the information in structured databases may be easier to comprehend more edifying and even more convincing than the structured data even when presented in tabu lar or graphic form Documents may be automatically generated from structured data using techniques from the eld of naturallanguage generation These techniques are concerned with how the (...) content organisation and language used in a document can be dynamically selected depending on the audience and context They have been used to generate health education ma terials explanations and critiques in decision support systems and medical reports and progress notes.. (shrink)
We present a novel generative model for naturallanguage tree structures in which semantic (lexical dependency) and syntactic (PCFG) structures are scored with separate models. This factorization provides conceptual simplicity, straightforward opportunities for separately improving the component models, and a level of performance comparable to similar, non-factored models. Most importantly, unlike other modern parsing models, the factored model admits an extremely effective A* parsing algorithm, which enables efficient, exact inference.
This article presents an architecture for naturallanguage 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)
��We describe a comprehensive framework for text un- derstanding, based on the representation of context. It is designed to serve as a representation of semantics for the full range of in- terpretive and inferential needs of general naturallanguage pro- cessing. Its most distinctive feature is its uniform representation of the various simple and independent linguistic sources that play a role in determining meaning: lexical associations, syntactic re- strictions, case-role expectations, and most importantly, contextual effects. Compositional syntactic structure (...) from a shallow parsing is represented in a neural net-based associative memory, where it then interacts through a Bayesian network with semantic associa- tions and the context or “gist” of the passage carried forward from preceding sentences. Experiments with more than 2000 sentences in different languages are included. (shrink)
A BSTRACT. We present Property Theory with Curry Typing (PTCT), an intensional first-order logic for naturallanguage semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types.1 We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like most. We use the type system and our treatment of generalized quantifiers in naturallanguage to construct a typetheoretic approach to pronominal anaphora that avoids some of the (...) difficulties that undermine previous type-theoretic analyses of this phenomenon. (shrink)
The alignment problem—establishing links between corresponding phrases in two related sentences—is as important in naturallanguage inference (NLI) as it is in machine translation (MT). But the tools and techniques of MT alignment do not readily transfer to NLI, where one cannot assume semantic equivalence, and for which large volumes of bitext are lacking. We present a new NLI aligner, the MANLI system, designed to address these challenges. It uses a phrase-based alignment representation, exploits external lexical resources, and (...) capitalizes on a new set of supervised training data. We compare the performance of MANLI to existing NLI and MT aligners on an NLI alignment task over the well-known Recognizing Textual Entailment data. We show that MANLI significantly outperforms existing aligners, achieving gains of 6.2% in F1 over a representative NLI aligner and 10.5% over GIZA++. (shrink)
This paper describes a novel pedagogical software program that can be seen as an online companion to one of the standard textbooks of formal naturallanguage semantics, Heim and Kratzer (1998). The Penn Lambda Calculator is a multifunctional application designed for use in standard graduate and undergraduate introductions to formal semantics: Teachers can use the application to demonstrate complex semantic derivations in the classroom and modify them interactively, and students can use it to work on problem sets provided (...) by the teacher. The program supports demonstrations and exercises in two main areas: (1) performing beta reduction in the simply typed lambda calculus; (2) application of the bottom-up algorithm for computing the compositional semantics of naturallanguage syntax trees. The program is able to represent the full range of phenomena covered in the Heim and Kratzer textbook by function application, predicate modification, and lambda abstraction. This includes phenomena such as intersective adjectives, relative clauses and quantifier raising. In the student use case, emphasis has been placed on providing “live” feedback for incorrect answers. Heuristics are used to detect the most frequent student errors and to return specific, interactive suggestions. (shrink)
This dissertation is based on the compositional model theoretic approach to naturallanguage semantics that was initiated by Montague (1970) and developed by subsequent work. In this general approach, coordination and negation are treated following Keenan & Faltz (1978, 1985) using boolean algebras. As in Barwise & Cooper (1981) noun phrases uniformly denote objects in the boolean domain of generalized quanti®ers. These foundational assumptions, although elegant and minimalistic, are challenged by various phenomena of coordination, plurality and scope. The (...) dissertation solves these problems by developing a ¯exible process of meaning composition, as ®rst proposed by Partee & Rooth (1983). Flexible interpretation involves semantic operations without any phonological counterpart, which participate in the interpretation process and change meanings of overt expressions. The dissertation introduces a novel ¯exible system where a small number of operations describe the behaviour of complex phenomena such as `non-boolean' and, the scope of inde®nites and the semantics of collectivity with quanti®cational NPs. The proposed theory is based on a distinction between two features of meanings in naturallanguage. (shrink)
The aim of this project was to explore the possibility of constructing a psychologic inference engine that might enhance introspective self-awareness by delivering inferences about a user based on what he said in interactive dialogues about his closest opposite-sex relation. To implement this aim, we developed a computer program (guru) with the capacity to simulate human conversation in colloquial naturallanguage. The psychologic inferences offered represent the authors' simulations of their commonsense psychology responses to expected user-input expressions. The (...) heuristics of the naturallanguage processor and its relation to output responses are described in enough detail for the operations of the implementation to be understood. Evaluation of this new cognitive agent presents, we hope, puzzles for artificial intelligence and cognitive science. (shrink)
We present Property Theory with Curry Typing (PTCT), an intensional first-order logic for naturallanguage semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types.1 We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like most. We use the type system and our treatment of generalized quantifiers in naturallanguage to construct a type-theoretic approach to pronominal anaphora that avoids some of the difficulties that (...) undermine previous type-theoretic analyses of this phenomenon. (shrink)
We present a novel generative model for naturallanguage tree structures in which semantic (lexical dependency) and syntactic (PCFG) structures are scored with separate models. This factorization provides conceptual simplicity, straightforward opportunities for separately improving the component models, and a level of performance comparable to similar, non-factored models. Most importantly, unlike other modern parsing models, the factored model admits an extremely effective A* parsing algorithm, which enables efficient, exact inference.
This paper presents two projects concerned with the application of naturallanguage processing technology for improving communication between Public Administration and citizens. The first project, GIST,is concerned with automatic multilingual generation of instructional texts for form-filling. The second project, TAMIC, aims at providing an interface for interactive access to information, centered on naturallanguage processing and supposed to be used by the clerk but with the active participation of the citizen.
In this paper we introduce a theoretical framework and a logical application for analyzing the semantics and pragmatics of contrastive conjunctions in naturallanguage. It is shown how expressions like "although", "nevertheless", "yet" and "but" are semantically definable as connectives using an operator for implication in naturallanguage, and how similar pragmatic principles affect the behaviour of both contrastive conjunctions and indicative conditionals. Following previous proposals, conditions on contrast in a conjunction are analyzed as presuppositions of (...) the conjunction. Further linguistic evidence leads to a distinction between restrictive and non-restrictive connectives of contrast, and consequently between direct and indirect contrast, which are given a precise definition. (shrink)
How can computers distinguish the coherent from the unintelligible, recognize new information in a sentence, or draw inferences from a naturallanguage passage? Computational semantics is an exciting new field that seeks answers to these questions, and this volume is the first textbook wholly devoted to this growing subdiscipline. The book explains the underlying theoretical issues and fundamental techniques for computing semantic representations for fragments of naturallanguage. This volume will be an essential text for computer (...) scientists, linguists, and anyone interested in the development of computational semantics. (shrink)
Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance naturallanguage semantics. In this contribution we will compare these two logics by investigating their application in a compositional analysis of (...) the de dicto - de re ambiguity in naturallanguage. It will be argued that Independence Friendly logic is suitable, whereas Dependence Logic is not. (shrink)
This paper presents a novel approach to the unsupervised learning of syntactic analyses of naturallanguage text. Most previous work has focused on maximizing likelihood according to generative PCFG models. In contrast, we employ a simpler probabilistic model over trees based directly on constituent identity and linear context, and use an EM-like iterative procedure to induce structure. This method produces much higher quality analyses, giving the best published results on the ATIS dataset.
We propose an approach to naturallanguage inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full semantic interpretation. We greatly extend past work in natural logic, which has focused solely on semantic containment and monotonicity, to incorporate both semantic exclusion and implicativity. Our system decomposes an inference problem into a sequence of atomic edits linking premise to hypothesis; predicts a lexical entailment relation for each edit (...) using a statistical classifier; propagates these relations upward through a syntax tree according to semantic properties of intermediate nodes; and composes the resulting entailment relations across the edit sequence. We evaluate our system on the FraCaS test suite, and achieve a 27% reduction in error from previous work. We also show that hybridizing an existing RTE system with our natural logic system yields significant gains on the RTE3 test suite. (shrink)
The most conceptually drastic change in naturallanguage syntactic theory in recent years is the introduction of economy conditions (ECs). Although there is not a unified formal notion of economy, the intuition is that natural languages are governed by a general “less is more” principle. Those who take this seriously, and regard it not just as principle guiding the researcher but as something to be implemented directly in grammars, are often led to comparative economy conditions (comparative ECs), (...) which select from a set of structures the most economical among them according to some criterion. Such conditions are associated with the Minimalist Program (MP), but they are found also in Optimality Theory (OT) and Lexical-Functional Grammar (LFG).1 The following is a sample of the prominent works mentioning ‘economy’. (shrink)
REFERENCES Barwise, J. & R. Cooper (1981) — 'Generalized Quantifiers and NaturalLanguage', Linguistics and Philosophy 4:2159-219. Van Benthem, J. (1983a) — ' Five Easy Pieces', in Ter Meulen (ed.), 1-17. Van Benthem, J. (1983b) ...
A certain orthodoxy has it that understanding is essentially computational: that information about what a sentence means is something that may be generated by means of a derivational process from information about the significance of the sentences constituent parts and of the ways in which they are put together. And that it is therefore fruitful to study formal theories acceptable as compositional theories of meaning for natural languages: theories that deliver for each sentence of their object-language a theorem (...) acceptable as statement of its meaning and derivable from axioms characterizing subsentential expressions and operations forming that sentence. This paper is to show that there is something deeply wrong with these ideas, namely that they are based on a certain confusion about ascriptions of semantic knowledge. The paper is to make this point by considering a semantic theorist who has explicit knowledge of a theory of truth for L. And by showing that all the theorist needs to have knowledge of to understand the sentences of L are these axioms -- that the derivation of T-theorems is epistemically redundant. And that this doesnt change when we turn from explicit to what has been called tacit knowledge. (shrink)
A lengthy debate in the philosophy of the cognitive sciences has turned on whether the phenomenon known as ‘systematicity’ of language and thought shows that connectionist explanatory aspirations are misguided. We investigate the issue of just which phenomenon ‘systematicity’ is supposed to be. The much-rehearsed examples always suggest that being systematic has something to do with ways in which some parts of expressions in natural languages (and, more conjecturally, some parts of thoughts) can be substituted for others without (...) altering well-formedness. We show that under one construal this yields a grossly weak claim that is not just compatible with a narrow version of associationist psychology but essentially coincides with a formalization of its descriptive power. Under another construal we get a claim (apparently unintended) that requires natural languages to fall within the context-free class, a claim that most linguists regard as too strong. Looking more closely at this proposed reconstruction of systematicity leads us to endorse, with further illustrations, the suggestion of Johnson (2004) that systematicity as a matter of substitutability of co-categorial constituents for one another does not appearto hold of natural languages at all. The appeal of the ill-delineated notion of systematicity may lie in the fact that within certain subclasses of lexical items mutual intersubstitutability does seem to hold, and theexplanation for that lies in a limitation on human memory: we simply cannot learn separate privileges of syntactic distribution for all of the huge number of words and phrases that we know. (shrink)
The present paper is intended to analyse from a theoretical point of view the relationships between naturallanguage and idiolects in the context of communication by means of the Davidson–Dummett controversy on the nature of language. I will explore from a pragmatic point of view the reliability of an alternative position inspired by the recent literalism/contextualism debate in philosophy of language in order to overcome some limitations of Dummett’s and Davidson’s perspectives on language, idiolects and (...) communication. (shrink)
One of the most important abilities we have as humans is the ability to think about number. In this chapter, we examine the question of whether there is an essential connection between language and number. We provide a careful examination of two prominent theories according to which concepts of the positive integers are dependent on language. The first of these claims that language creates the positive integers on the basis of an innate capacity to represent real numbers. (...) The second claims that language’s function is to integrate contents from modules that humans share with other animals. We argue that neither model is successful. (shrink)
Roger Schank's research in AI takes seriously the ideas that understanding naturallanguage involves mapping its expressions into an internal representation scheme and that these internal representations have a syntax appropriate for computational operations. It therefore falls within the computational approach to the study of mind. This paper discusses certain aspects of Schank's approach in order to assess its potential adequacy as a (partial) model of cognition. This version of the Language of Thought hypothesis encounters some of (...) the same difficulties that arise for Fodor's account. (shrink)
The origins of these essays -- Introduction -- Presupposition -- A projection problem for speaker presupposition -- Language and linguistic competence -- Linguistics and psychology -- Semantics and psychology -- Semantics and semantic competence -- The necessity argument -- Truth, meaning, and understanding -- Truth and meaning in perspective -- Semantics and pragmatics -- Naming and asserting -- The gap between meaning and assertion : why what we literally say often differs from what our words literally mean -- Drawing (...) the line between meaning and implicaturem and relating both to assertion -- Descriptions -- Incomplete definite descriptions -- Donnellan's referential/attributive distinction -- Why incomplete descriptions don't refute Russell's theory of descriptions -- Meaning and use : lessons for legal interpretation -- Interpreting legal texts : what is and what is not special about the law. (shrink)
Since antiquity two different negations in natural languages have been noted: predicate negation (not honest) and predicate term negation (dishonest). The extensive literature offers no models. We propose category-theoretic models with two distinct negation operators, neither of them in general Boolean. We study combinations of the two (not dishonest) and sentential counterparts of each. We emphasize the relevance of our work for the theory of cognition.
Paul M. Pietroski, University of Maryland I had heard it said that Chomsky’s conception of language is at odds with the truth-conditional program in semantics. Some of my friends said it so often that the point—or at least a point—finally sunk in.
A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.
A new comprehensive framework for narrative understanding has been developed. Its centerpiece is a new situational logic calledEpisodic Logic (EL), a knowledge and semantic representation well-adapted to the interpretive and inferential needs of general NLU. The most distinctive features of EL is its naturallanguage-like expressiveness. It allows for generalized quantifiers, lambda abstraction, sentence and predicate modifiers, sentence and predicate reification, intensional predicates (corresponding to wanting, believing, making, etc.), unreliable generalizations, and perhaps most importantly, explicit situational variables ( (...) class='Hi'>denoting episodes, events, states of affairs, etc.) linked to arbitrary formulas that describe them. These allow episodes to be explicitly related in terms of part-whole, temporal and causal relations. Episodic logical form is easily computed from surface syntax and lends itself to effective inference. (shrink)
By a fragment of a naturallanguage we mean a subset of thatlanguage equipped with semantics which translate its sentences intosome formal system such as first-order logic. The familiar conceptsof satisfiability and entailment can be defined for anysuch fragment in a natural way. The question therefore arises, for anygiven fragment of a naturallanguage, as to the computational complexityof determining satisfiability and entailment within that fragment. Wepresent a series of fragments of English for which the (...) satisfiabilityproblem is polynomial, NP-complete, EXPTIME-complete,NEXPTIME-complete and undecidable. Thus, this paper represents a casestudy in how to approach the problem of determining the logicalcomplexity of various naturallanguage constructions. In addition, wedraw some general conclusions about the relationship between naturallanguage and formal logic. (shrink)
This paper seeks to contribute to the sociology of nations, a literature that is only starting to carve out its place in the social sciences. The paper offers a reconceptualization of “nations” as “national cultures”, employing an evolutionary perspective and a systemic framework in which “nations” are understood as cultural systems of a special kind. National cultures are intimately tied to natural languages, and the acquisition of a national culture occurs as part and parcel of the acquisition of a (...)naturallanguage. Acquiring a naturallanguage is a prerequisite for learning other cultural systems (artefactual languages as well as other natural languages). National cultures function as metacultures. They are also the reference cultures for modern states and their citizens, a political dimension of nations that is of paramount importance, though it will only be touched on in this paper. National cultures should be considered as the most fundamental type of cultural system today. (shrink)
In a recent paper Johan van Benthem reviews earlier work done by himself and colleagues on ‘natural logic’. His paper makes a number of challenging comments on the relationships between traditional logic, modern logic and natural logic. I respond to his challenge, by drawing what I think are the most significant lines dividing traditional logic from modern. The leading difference is in the way logic is expected to be used for checking arguments. For traditionals the checking is local, (...) i.e. separately for each inference step. Between inference steps, several kinds of paraphrasing are allowed. Today we formalise globally: we choose a symbolisation that works for the entire argument, and thus we eliminate intuitive steps and changes of viewpoint during the argument. Frege and Peano recast the logical rules so as to make this possible. I comment also on the traditional assumption that logical processing takes place at the top syntactic level, and I question Johan’s view that natural logic is ‘natural’. (shrink)
I advocate a theory of syntactic semantics as a way of understanding how computers can think (and how the Chinese-Room-Argument objection to the Turing Test can be overcome): (1) Semantics, considered as the study of relations between symbols and meanings, can be turned into syntax â a study of relations among symbols (including meanings) â and hence syntax (i.e., symbol manipulation) can suffice for the semantical enterprise (contra Searle). (2) Semantics, considered as the process of understanding one domain (by modeling (...) it) in terms of another, can be viewed recursively: The base case of semantic understanding âunderstanding a domain in terms of itself â is syntactic understanding. (3) An internal (or narrow ), first-person point of view makes an external (or wide ), third-person point of view otiose for purposes of understanding cognition. (shrink)
In Book II of the _Essay_, at the beginning of his discussion of language in Chapter II ("Of the Signification of Words"), John Locke writes that we humans have a variety of thoughts which might profit others, but that unfortunately these thoughts lie invisible and hidden from others. And so we use language to communicate these thoughts. As a result, "words, in their primary or immediate signification,stand for nothing but _the ideas in the mind of him that uses (...) them_. (shrink)
Mental Spaces is the classic introduction to the study of mental spaces and conceptual projection, as revealed through the structure and use of language. It examines in detail the dynamic construction of connected domains as discourse unfolds. The discovery of mental space organization has modified our conception of language and thought: powerful and uniform accounts of superficially disparate phenomena have become available in the areas of reference, presupposition projection, counterfactual and analogical reasoning, metaphor and metonymy, and time and (...) aspect in discourse. The present work lays the foundation for this research. It uncovers simple and general principles that lie behind the awesome complexity of everyday logic. (shrink)
The first of its kind to thoroughly cover language technology at all levels and with all modern technologies this book takes an empirical approach to the ...
It is common wisdom in intellectual history that eighteenth-century science of man evolved under the aegis of Newton. It is also frequently suggested that David Hume, one of the most influential practitioners of this kind of inquiry, aspired to be the Newton of the moral sciences. Usually this goes hand in hand with a more or less explicit reading of Hume’s theory of human nature as written in an idiom of particulate inert matter and active forces acting on it, i.e. (...) essentially that of Newton’s Principia. Hume’s outlook on the mental world is thus frequently described in terms of conceptual atoms whose association is compared to interparticulate attractions analogous with Newtonian forces in general, and gravity in particular. In the present paper I argue that Hume’s theory can indeed be understood in Newton’s wake, but not in the context of the Principa’s reception but that of the Opticks, which exerted a more significant influence on natural inquiry in eighteenth-century Scotland. I intend to show that Hume speaks a language and represents an outlook on human matters convergent with “philosophical chemistry” in Scotland at that time, and particularly to his later friend and physician William Cullen. (shrink)
Are rules processes or similarity processes the default for acquisition of grammatical knowledge during natural second language acquisition? Whereas Pothos argues similarity processes are the default in the many areas he reviews, including artificial grammar learning and first language development, I suggest, citing evidence, that in second language acquisition of grammatical morphology “rules processes” may be the default.
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)
The paper presents Property Theory with Curry Typing (PTCT) where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that implement the theory. Some extensions to the type theory are discussed, including type polymorphism, which provides a useful analysis of conjunctive (...) terms. Such terms can be given a single polymorphic type that expresses the fact that they can conjoin phrases of any one type, yielding an expression of the same type. (shrink)
The paper presents Property Theory with Curry Typing (PTCT) where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that implement the theory. Some extensions to the type theory are discussed, including type polymorphism, which provides a useful analysis of (...) conjunctive terms. Such terms can be given a single polymorphic type that expresses the fact that they can conjoin phrases of any one type, yielding an expression of the same type. (shrink)
The present paper is meant to summarise and enlighten the theoretical implications of the twin theories of text comprehension and of text compression. Compatibility and non-exclusiveness of particle-like analysis of language and wave-like analysis of intentionality are also demonstrated within the newly established quantum linguistics framework. The informative state of language is viewed as being relatively stable; once activated and subject to motion, therefore reaching a communicative state, different phenomena occur, which may be observed, analysed and visualised through (...) CPP-TRS observational devices. Relativity theory may therefore be organised in terms of quanta with continuity and no contradiction. (shrink)
The Query is reasonable (First Order) Predicate Logic (PL:) is a ”Universal Grammar" for the languages of Elementary Arithmetic, Euclidean Geometry, Set Theory, Boolean Algebra, .... It defines their expressions, their semantic interpretations, and texts, called proofs, that syntactically characterize the boolean semantic entailment relation: P entails Q iff Q is true whenever P is.
