Goto

Collaborating Authors

 Natural Language


A program for parsing sentences and making inferences about kinship relations

Classics

In A. C. Hoggatt and F. E. Balderston (Eds.), Symposium on simulation models: Methodology and applications to the behavioral sciences. Cincinnati: South-Western Publishing, 111-138.


Inferential Memory as the Basis of Machines Which Understand Natural Language

Classics

Article based on Ph.D. dissertation at Carnegie Tech. "... the problem of meaning is of major importance in the study of the nature of intelligence, and that a useful definition of meaning must include not only denotation but connotation and implication as well. To handle these important questions it is necessary to study cognitive organizations which are more complex than those upon which most psychological theories are based. A central question is the storage of large numbers of interrelated propositions in a manner which efficiently uses memory capacity." In E.A. Feigenbaum & J. Feldman (Eds.) Computers and Thought, pp. 217-233. McGraw-Hill, 1963.


Computers and Thought

Classics

E.A. Feigenbaum and J. Feldman (Eds.). Computers and Thought. McGraw-Hill, 1963. This collection includes twenty classic papers by such pioneers as A. M. Turing and Marvin Minsky who were behind the pivotal advances in artificially simulating human thought processes with computers. All Parts are available as downloadable pdf files; most individual chapters are also available separately. COMPUTING MACHINERY AND INTELLIGENCE. A. M. Turing. CHESS-PLAYING PROGRAMS AND THE PROBLEM OF COMPLEXITY. Allen Newell, J.C. Shaw and H.A. Simon. SOME STUDIES IN MACHINE LEARNING USING THE GAME OF CHECKERS. A. L. Samuel. EMPIRICAL EXPLORATIONS WITH THE LOGIC THEORY MACHINE: A CASE STUDY IN HEURISTICS. Allen Newell J.C. Shaw and H.A. Simon. REALIZATION OF A GEOMETRY-THEOREM PROVING MACHINE. H. Gelernter. EMPIRICAL EXPLORATIONS OF THE GEOMETRY-THEOREM PROVING MACHINE. H. Gelernter, J.R. Hansen, and D. W. Loveland. SUMMARY OF A HEURISTIC LINE BALANCING PROCEDURE. Fred M. Tonge. A HEURISTIC PROGRAM THAT SOLVES SYMBOLIC INTEGRATION PROBLEMS IN FRESHMAN CALCULUS. James R. Slagle. BASEBALL: AN AUTOMATIC QUESTION ANSWERER. Green, Bert F. Jr., Alice K. Wolf, Carol Chomsky, and Kenneth Laughery. INFERENTIAL MEMORY AS THE BASIS OF MACHINES WHICH UNDERSTAND NATURAL LANGUAGE. Robert K. Lindsay. PATTERN RECOGNITION BY MACHINE. Oliver G. Selfridge and Ulric Neisser. A PATTERN-RECOGNITION PROGRAM THAT GENERATES, EVALUATES, AND ADJUSTS ITS OWN OPERATORS. Leonard Uhr and Charles Vossler. GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT. Allen Newell and H.A. Simon. THE SIMULATION OF VERBAL LEARNING BEHAVIOR. Edward A. Feigenbaum. PROGRAMMING A MODEL OF HUMAN CONCEPT FORMULATION. Earl B. Hunt and Carl I. Hovland. SIMULATION OF BEHAVIOR IN THE BINARY CHOICE EXPERIMENT Julian Feldman. A MODEL OF THE TRUST INVESTMENT PROCESS. Geoffrey P. E. Clarkson. A COMPUTER MODEL OF ELEMENTARY SOCIAL BEHAVIOR. John T. Gullahorn and Jeanne E. Gullahorn. TOWARD INTELLIGENT MACHINES. Paul Armer. STEPS TOWARD ARTIFICIAL INTELLIGENCE. Marvin Minsky. A SELECTED DESCRIPTOR-INDEXED BIBLIOGRAPHY TO THE LITERATURE ON ARTIFICIAL INTELLIGENCE. Marvin Minsky.


Semantic Message Detection for Machine Translation, Using an Interlingua

Classics

In my view, the present "critical situation" in M.T., is not due to the fact that genuine Mechanical Translation is inherently impossible, as Bar-Hillel thinks, but to the fact that the mechanizable techniques at present being used to analyse language are not powerful enough to detect the message, or argument, of any particular text. Other papers from this conference online. See Table of Contents with links to online papers from the Proc. 1961 International Conference on Machine Translation of Languages and Applied Language Analysis (http://www.mt-archive.info/NPL-1961-TOC.htm). Proc. 1961 International Conference on Machine Translation of Languages and Applied Language Analysis, pp. 438-475, London: Her Majesty's Stationery Office, 1962.


A selected descriptor indexed bibliography to the literature on artificial intelligence

Classics

This listing is intended as an introduction to the literature on Artificial Intelligence, €”i.e., to the literature dealing with the problem of making machines behave intelligently. We have divided this area into categories and cross-indexed the references accordingly. Large bibliographies without some classification facility are next to useless. This particular field is still young, but there are already many instances in which workers have wasted much time in rediscovering (for better or for worse) schemes already reported. In the last year or two this problem has become worse, and in such a situation just about any information is better than none. This bibliography is intended to serve just that purpose-to present some information about this literature. The selection was confined mainly to publications directly concerned with construction of artificial problem-solving systems. Many peripheral areas are omitted completely or represented only by a few citations.IRE Trans. on Human Factors in Electronics, HFE-2, pages 39-55


BASEBALL: An Automatic Question Answerer

Classics

Men typically communicate with computers in a variety of artificial,stylized, unambiguous languages that are better adapted to the machinethan to the man. For convenience and speed, many future computercenteredsystems will require men to communicate with computers innatural language. The business executive, the military commander, and thescientist need to ask questions of the computer in ordinary English, andto have the computer answer the questions directly. Baseball is a first steptoward this goal.Proc. Western Joint Computer Conference 19:555-570.


IPL-V: Information Processing Language V Manual

Classics

The complete rules for coding in Information Processing Language-V (IPL-V), and the documentation of extensions incorporated since publication of the Information Processing Language-V Manual. A summary of extensions and the minor modifications to the language is contained in the final section. An index, a list of the basic IPL-V processes, and a full-scale copy of the coding sheet appear at the end of the Memorandum.See also: Google Books.Prentice·Hall, Englewood Cliffs, NJ.