How do we construct ad hoc concepts, especially those characterised by emergent properties? A reasonable hypothesis, suggested both in psychology and in pragmatics , is that some sort of inferential processing must be involved. I argue that this inferential processing can be accounted for in associative terms. My argument is based on the notion of inference as associative pattern completion based on schemata, with schemata being conceived in turn as patterns of concepts and their relationships. The possible role of conscious (...) attention in inferential processes of this sort is also addressed. (shrink)

Work on analogy has been done from a number of disciplinary perspectives throughout the history of Western thought. This work is a multidisciplinary guide to theorizing about analogy. It contains 1,406 references, primarily to journal articles and monographs, and primarily to English language material. classical through to contemporary sources are included. The work is classified into eight different sections (with a number of subsections). A brief introduction to each section is provided. Keywords and key expressions of importance to research on (...) analogy are discussed in the introductory material. Electronic resources for conducting research on analogy are listed as well. (shrink)

Which notion of computation (if any) is essential for explaining cognition? Five answers to this question are discussed in the paper. (1) The classicist answer: symbolic (digital) computation is required for explaining cognition; (2) The broad digital computationalist answer: digital computation broadly construed is required for explaining cognition; (3) The connectionist answer: sub-symbolic computation is required for explaining cognition; (4) The computational neuroscientist answer: neural computation (that, strictly, is neither digital nor analogue) is required for explaining cognition; (5) The extreme (...) dynamicist answer: computation is not required for explaining cognition. The first four answers are only accurate to a first approximation. But the “devil” is in the details. The last answer cashes in on the parenthetical “if any” in the question above. The classicist argues that cognition is symbolic computation. But digital computationalism need not be equated with classicism. Indeed, computationalism can, in principle, range from digital (and analogue) computationalism through (the weaker thesis of) generic computationalism to (the even weaker thesis of) digital (or analogue) pancomputationalism. Connectionism, which has traditionally been criticised by classicists for being non-computational, can be plausibly construed as being either analogue or digital computationalism (depending on the type of connectionist networks used). Computational neuroscience invokes the notion of neural computation that may (possibly) be interpreted as a sui generis type of computation. The extreme dynamicist argues that the time has come for a post-computational cognitive science. This paper is an attempt to shed some light on this debate by examining various conceptions and misconceptions of (particularly digital) computation. (shrink)

Lexical ambiguity can be syntactic if it involves more than one grammatical category for a single word, or semantic if more than one meaning can be associated with a word. In this article we discuss the application of a Bayesian‐network model in the resolution of lexical ambiguities of both types. The network we propose comprises a parsing subnetwork, which can be constructed automatically for any context‐free grammar, and a subnetwork for semantic analysis, which, in the spirit of Fillmore's (1968) case (...) grammars, seeks to fulfill the required cases of all candidates for verb of the sentence. Solving for the highest joint probability of the variables conditioned upon the evidences to the network yields the most likely candidate with its meaning, along with its cases and respective meanings. This is achieved by fixing the values of all evidence nodes concurrently, and then performing a stochastic simulation in which the remaining nodes are updated probabilistically with a high degree of parallelism. The process of disambiguation is directed neither by the syntax nor the semantics, but rather by the interrelation between the two subnetworks. The use of a Bayesian‐network model allows us to express this interrelation between the two subnetworks and among their constituents in a rather direct and rigorous way that, in connection with the convergence properties of the stochastic simulation, reveals a very robust model. (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 natural language 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)

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.