Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Gazdar, C. Mellish (1989)
Natural Language Processing in PROLOG
J. Pearl (1988)
Probabilistic reasoning in intelligent systems
E. Gold (1967)
Language Identification in the LimitInf. Control., 10
J. Wolff (1977)
The discovery of segments in natural languageBritish Journal of Psychology, 68
M. Ginsberg (1994)
AI and nonmonotonic reasoning
R. M. Young, R. L. Lewis (1999)
Models of Working Memory: Mechanisms of Active Maintenance and Executive Control
G. Zipf (1949)
Human behavior and the principle of least effort
L. R. Rabiner (1989)
A Tutorial on Hidden Markov Models and Selected Applications in Speech RecognitionProceedings of the IEEE, 77
Oldfield Rc (1954)
MEMORY MECHANISMS AND THE THEORY OF SCHEMATA1The British journal of psychology. General section, 45
Allen Newell (1992)
Précis of Unified theories of cognitionBehavioral and Brain Sciences, 15
J. Laird, A. Newell, P. Rosenbloom (1987)
SOAR: An Architecture for General IntelligenceArtif. Intell., 33
John Anderson, C. Lebiere (1998)
The Atomic Components of Thought
D. Sankoff, J. Kruskal (1983)
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
C. Wallace, D. Boulton (1968)
An Information Measure for ClassificationComput. J., 11
H. Barlow (1969)
Trigger Features, Adaptation and Economy of Impulses
J. Wolff (1988)
Learning Syntax and Meanings Through Optimization and Distributional Analysis
20 Owing to over-exposure in the literature, Tweety is suffering from nervous exhaustion and will, accordingly, be replaced in the following example by a loaf of bread! References
R. Young, Richard Lewis (1999)
Models of Working Memory: The Soar Cognitive Architecture and Human Working Memory
(1967)
Sensory Inhibition
J. Rissanen (1978)
Modelling by the Shortest Data DescriptionAutomatica-J IFAC, 14
P. Langley, Sean Stromsten (2000)
Learning Context-Free Grammars with a Simplicity Bias
R. Solomonoff (1997)
The Discovery of Algorithmic ProbabilityJ. Comput. Syst. Sci., 55
R. J. Solomonoff (1964)
A Formal Theory of Inductive Inference. Parts I and IIInformation and Control, 7
S. Watanabe (1972)
Frontiers of Pattern Recognition
J. Wolff (2003)
Syntax, Parsing and Production of Natural Language in a Framework of Information Compression by Multiple Alignment, Unification and SearchJ. Univers. Comput. Sci., 6
R. J. Solomonoff (1986)
Uncertainty in Artificial Intelligence
J. Wolff (2003)
Probabilistic Reasoning as Information Compression by Multiple Alignment, Unification and Search: An Introduction and OverviewJ. Univers. Comput. Sci., 5
Satosi Watanabe (1972)
PATTERN RECOGNITION AS INFORMATION COMPRESSION
N. Chater (1996)
Reconciling simplicity and likelihood principles in perceptual organization.Psychological review, 103 3
M. Redington, N. Chater (1998)
Connectionist and Statistical Approaches to Language Acquisition: A Distributional Perspective.Language and Cognitive Processes, 13
3 Unify each of the new alignments so that it can be treated as a single sequence of symbols. The structure of the alignment is preserved to facilitate printing
Alexander Bochman (1988)
Nonmonotonic Reasoning
Gerry Wolff (1990)
Simplicity and Power - Some Unifying Ideas in ComputingComput. J., 33
J. Wolff (1980)
Language acquisition and the discovery of phrase structure.Language and speech, 23 Pt 3
J. Rissanen (1978)
Modeling By Shortest Data Description*Autom., 14
J. G. Wolff (1988)
Categories and Processes in Language Acquisition
J. Wolff (1993)
Computing, Cognition and Information CompressionAI Commun., 6
Allan Collins, M. Quillian (1969)
Retrieval time from semantic memory
L. Barsalou (1992)
Cognitive Psychology: An Overview for Cognitive Scientists
4 Each newly unified alignment is kept in a temporary store until the end of this iteration
Edinburgh (b) Figure 16: Multiple alignments representing chains of inference: (a) A whodunnit chain of inference. (b) Finding a route between London and Edinburgh
T. Cover, Joy Thomas (2005)
Elements of Information Theory
R. Solomonoff (1985)
The Application of Algorithmic Probability to Problems in Artificial Intelligence
R. Solomonoff (1964)
A Formal Theory of Inductive Inference. Part IIInf. Control., 7
M. Li, P. Vitányi (1997)
An Introduction to Kolmogorov Complexity and Its Applications
J. Wolff (1975)
AN ALGORITHM FOR THE SEGMENTATION OF AN ARTIFICIAL LANGUAGE ANALOGUEBritish Journal of Psychology, 66
M. Minsky (1967)
Computation: Finite and Infinite Machines
M. Redington, N. Chater, S. Finch (1998)
Distributional Information: A Powerful Cue for Acquiring Syntactic CategoriesCogn. Sci., 22
A. Newell (1990)
Unified Theories of Cognition
J. Wolff (2003)
Neural Mechanisms for Information Compression byMultiple Alignment, Unification and SearchSocial Science Research Network
N. Chater (1999)
The Search for Simplicity: A Fundamental Cognitive Principle?Quarterly Journal of Experimental Psychology, 52
M. L. Ginsberg (1994)
Handbook of Logic in Artificial Intelligence and Logic Programming, Non-monotonic Reasoning and Uncertain Reasoning
P. Langley, S. Stromsten (2000)
Proceedings of the Eleventh European Conference on Machine Learning
K. Leibovic (1969)
Information Processing in The Nervous SystemScience, 164 3878
Assign the pattern in New as the first and only member of a list of ’driving’ patterns
Fernando Pereira, D. Warren (1980)
Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition NetworksArtif. Intell., 13
J. Wolff (2003)
Unsupervised Learning in a Framework of Information Compression by Multiple Alignment, Unification and SearchArXiv, cs.AI/0302015
F. Attneave (1954)
Some informational aspects of visual perception.Psychological review, 61 3
J. Wolff (1982)
Language acquisition, data compression and generalizationLanguage & Communication, 2
R. Oldfield (1954)
Memory mechanisms and the theory of schemata.The British journal of medical psychology, 45 1
J. Wolff (2003)
Computing as Information Compression by Multiple Alignment, Unification and SearchArXiv, cs.AI/0307013
J. Wolff (2003)
Mathematics and Logic as Information Compression by Multiple Alignment Unification and SearchArXiv, math.GM/0308153
Gerard Wolff (1994)
A scaleable technique for best-match retrieval of sequential information using metrics-guided searchJournal of Information Science, 20
W. Garner (1974)
The Processing of Information and StructureAmerican Journal of Psychology, 87
J. Pearl (1991)
Probabilistic reasoning in intelligent systems - networks of plausible inference
Add the newly-formed unified alignments to a cumulative list of alignments formed by the program
Empty the list of driving patterns and then select a few of the best of the newly-formed unified alignments and add them to the list of driving patterns, ready for the next iteration of COMPRESS()
The best alignment found by SP61 with facts to be explained in New (on the left) and patterns for relevant facts and associations in Old
The organisation of the compress() function in the SP61 model
M. Wood (1990)
Natural language processing in PrologScience of Computer Programming, 14
This article presents an overview ofthe idea that information compression bymultiple alignment, unification and search(ICMAUS) may serve as a unifying principle incomputing (including mathematics and logic) andin such aspects of human cognition as theanalysis and production of natural language,fuzzy pattern recognition and best-matchinformation retrieval, concept hierarchies withinheritance of attributes, probabilisticreasoning, and unsupervised inductive learning.The ICMAUS concepts are described together withan outline of the SP61 software model in whichthe ICMAUS concepts are currently realised. Arange of examples is presented, illustratedwith output from the SP61 model.
Artificial Intelligence Review – Springer Journals
Published: Oct 6, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.