skip to content

Touretzky, David S.

Overview
Works: 83 works in 196 publications in 2 languages and 1,641 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor
Classifications: QA76.73.L23, 001.6424
Publication Timeline
Key
Publications about David S Touretzky
Publications by David S Touretzky
Most widely held works by David S Touretzky
LISP : a gentle introduction to symbolic computation by David S Touretzky( Book )
19 editions published between 1983 and 1988 in English and Japanese and held by 508 libraries worldwide
Introduction: getting acquainted. Functions and data. Lists. EVAL notation. Conditionals. Global variables and side effects. List data structures. Applicative operators. Recursion. Elementary input/output. Iteration. Property lists. Recommended further reading. Dialects of Lisp. Extensions to Lisp. Index
The mathematics of inheritance systems by David S Touretzky( Book )
18 editions published between 1984 and 1988 in English and Undetermined and held by 302 libraries worldwide
Common LISP : a gentle introduction to symbolic computation by David S Touretzky( Book )
22 editions published between 1989 and 2014 in English and held by 274 libraries worldwide
Highly accessible treatment covers cons cell structures, evaluation rules, programs as data, recursive and applicable programming styles. Nearly 400 illustrations, answers to exercises, "toolkit" sections, and a variety of complete programs. 1990 edition. -- Provided by publisher
Connectionist models : proceedings of the 1990 summer school by David S Touretzky( Book )
9 editions published between 1990 and 1991 in English and Undetermined and held by 133 libraries worldwide
Connectionist approaches to language learning by David Touretzky( Book )
6 editions published in 1991 in English and held by 61 libraries worldwide
Proceedings of the 1988 Connectionist Models Summer School by 1988, Pittsburgh, Pa.) Connectionist Models Summer School (2( Book )
8 editions published between 1988 and 1991 in English and held by 18 libraries worldwide
A connectionist implementation of cognitive phonology by Deirdre Wheeler( Book )
4 editions published in 1989 in English and Undetermined and held by 8 libraries worldwide
Abstract: "This paper reports on an initial implementation of Lakoff's theory of cognitive phonology in a connectionist network. Standard generative phonological theories require serial application of rules, which results in derivations with numerous intermediate states. This is incompatible with the connectionist goals of psychological and biological plausibility, and may also hinder learnability. Lakoff's theory of cognitive phonology offers a solution to some of these problems by providing an alternative way to think about derivations and ordered rules, and by eliminating the need for right-to-left iterative rule application. On the other hand, Lakoff's proposal presents certain computational difficulties due to its appeal to Harmony Theory. We present a reformulation of cognitive phonology using a novel clustering mechanism that completely eliminates iteration and permits an efficient feed-forward implementation."
Controlling search dynamics by manipulating energy landscapes by David S Touretzky( Book )
4 editions published in 1989 in English and Undetermined and held by 8 libraries worldwide
Abstract: "Touretzky and Hinton's DCPS (Distributed Connectionist Production System) is a neural network with complex dynamical properties. Visualization of the energy landscapes of some of its component modules leads to a better intuitive understanding of the model. Three visualization techniques are used in this paper. Analysis of the way energy landscapes change as modules interact during an annealing search suggests ways in which the search dynamics can be controlled, thereby improving the model's performance on difficult match cases."
Connectionism and compositional semantics by David S Touretzky( Book )
3 editions published in 1989 in English and Undetermined and held by 8 libraries worldwide
Abstract: "Quite a few interesting experiments have been done applying neural networks to natural language tasks. Without detracting from the value of these early investigations, this paper argues that current neural network architectures are too weak to solve anything but toy language problems. Their downfall is the need for 'dynamic inference, ' in which several pieces of information not previously seen together are dynamically combined to derive the meaning of a novel input. The first half of the paper defines a hierarchy of classes of connectionist models, from categorizers and associative memories to pattern transformers and dynamic inferencers. Some well-known connectionist models that deal with natural language are shown to be either categorizers or pattern transformers. The second half examines in detail a particular natural language problem: prepositional phrase attachment. Attaching a PP to an NP changes its meaning, thereby influencing other attachments. So PP attachment requires compositional semantics, and compositionality in non-toy domains requires dynamic inference
Visualizing evaluation in applicative languages by David S Touretzky( Book )
5 editions published in 1989 in English and Undetermined and held by 8 libraries worldwide
In support of this, we have made available a set of LAT[subscript E]X macros to allow others to produce evaltrace diagrams similar to the ones that appear here."
BoltzCONS : dynamic symbol structures in a connectionist network by David S Touretzky( Book )
3 editions published between 1989 and 1990 in English and Undetermined and held by 7 libraries worldwide
Unlike certain other neural net models, BoltzCONS represents objects as a collection of superimposed activity patterns rather than as a set of weights. It can therefore create new stuctured objects dynamically, without reliance on iterative training procedures, without rehearsal of previously learned patterns, and without resorting to grandmother cells."
A distributed connectionist production system by David S Touretzky( Book )
4 editions published between 1986 and 1987 in English and Undetermined and held by 7 libraries worldwide
DCPS is a connectionist production system interpreter that uses distributed representations. As a connectionist model it consists of many simple, richly interconnected neuron like computing units that cooperate to solve problems in parallel. One motivation for constructing DCPS was to demonstrate that connectionist models are capable of representing and using explicit rules. A second motivation was to show how coarse coding or distributed representations can be used to construct a working memory that requires far fewer units than the number of different facts that can potentially be stored. The simulation we present is intended as a detailed demonstration of the feasibility of certain ideas and should not be viewed as a full implementation of production systems. Our current model only has a few of the many interesting emergent properties that we eventually hope to demonstrate: it is damage resistant, it performs matching and variable binding by massively parallel constraint satisfaction, and the capacity of its working memory is dependent on the similarity of the items being stored
Rules and Maps III : further progress in connectionist phonology by David S Touretzky( Book )
2 editions published in 1990 in English and held by 7 libraries worldwide
Abstract: "This report contains three papers from an ongoing research project on connectionist phonology. The first introduces syllabification into our m̀any maps' processing model. The second shows how syllabification and a previously described clustering mechanism can be used jointly to implement the stress assignment rules of a number of languages. The third paper describes a preliminary version of a phonological rule-learning program whose rule syntax is determined by the architecture of our model."
Rules and maps in connectionist symbol processing by David S Touretzky( Book )
3 editions published in 1989 in English and Undetermined and held by 7 libraries worldwide
Rules and maps II : recent progress in connectionist symbol processing by David S Touretzky( Book )
2 editions published in 1990 in English and held by 7 libraries worldwide
Abstract: "This report contains three papers on symbol processing in connectionist networks. The first two, 'A Computational Basis for Phonology' and 'Rationale for Many Maps' Phonology Machine, ' present the latest results of our ongoing project to develop a connectionist explanation for the regularities and peculiarities of human phonological behavior. The third paper, 'Rule Representations in a Connectionist Chunker, ' introduces a new rule chunking architecture based on competitive learning, and compares its performance with that of a backpropagation-based chunker. Earlier work in these areas was described in report CMU-CS-89-158."
Inheritance theory and networks with roles by Richmond H Thomason( Book )
3 editions published in 1990 in English and held by 7 libraries worldwide
Restricted networks of this sort are less expressive than first order logic; like all inheritance systems, they constitute a sort of weak logic founded on path-based reasoning, On the other hand, their rules of inference and resulting proofs are substantially more complex than what one finds in simple IS-A hierarchies; the latter use purely linear proof sequences. We show that query answering in networks with roles corresponds to parsing a fragment ofthe network with a context-free grammar whose nonterminals are inference rules and whose terminals are links. Proofs in these systems, although still path-based, take the form of trees rather than chains."
Four capacity models for coarse-coded symbol memories by Ronald Rosenfeld( Book )
5 editions published in 1987 in English and Undetermined and held by 6 libraries worldwide
Abstract: "Coarse-coded symbol memories have appeared in several neural network symbol processing models. In order to determine how these models would scale, one must first have some understanding of the mathematics of coarse-coded representations. We define the general structure of coarse-coded symbol memories, and discuss their strengths and weaknesses. Memory schemes can be characterized by their memory size, symbol-set size and capacity. We derive mathematical relationships between these parameters for various memory schemes, using both analysis and numerical methods. Finally, we compare the predicted capacity of one of the schemes with actual measurements of the coarse-coded working memory of DCPS, Touretzky and Hinton's distributed connectionist production system."
A skeptical theory of inheritance in nonmonotonic semantic networks by John Francis Horty( Book )
2 editions published in 1987 in Undetermined and English and held by 6 libraries worldwide
Connectionist models and linguistic theory : investigations of stress systems in language by Prahlad Gupta( Book )
1 edition published in 1993 in English and held by 6 libraries worldwide
We show, however, that our high-level pseudo-linguistic account bears no causal relation to processing in the perceptron, and provides little insight into the nature of this processing. Because of the persuasive similarities between the nature of our theory and linguistic theorizing, we suggest that linguistic theory may be in much the same position. Contrary to the usual assumption, it may not provide useful guidance in attempts to identify processing mechanisms underlying human language."
Proceedings of the 1993 Connectionist Models Summer School by Michael C Mozer( Book )
3 editions published between 1994 and 2014 in English and held by 2 libraries worldwide
The result of the 1993 Connectionist Models Summer School, the papers in this volume exemplify the tremendous breadth and depth of research underway in the field of neural networks. Although the slant of the summer school has always leaned toward cognitive science and artificial intelligence, the diverse scientific backgrounds and research interests of accepted students and invited faculty reflect the broad spectrum of areas contributing to neural networks, including artificial intelligence, cognitive science, computer science, engineering, mathematics, neuroscience, and physics. Providing an
 
moreShow More Titles
fewerShow Fewer Titles
Alternative Names
David S. Touretzky American computer scientist
David S. Touretzky Amerikaans hoogleraar
David S. Touretzky amerikanischer Informatiker
トーレッキー, ダヴィッド・S
Languages
English (111)
Japanese (3)
Covers
Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.