Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!stede From: stede@cs.purdue.EDU (Manfred Stede) Newsgroups: comp.ai Subject: Re: Some Sequence Prediction Work (actually, synthesis of regexprs) Message-ID: <8828@medusa.cs.purdue.edu> Date: 4 Dec 89 15:56:42 GMT References: <11883@phoenix.Princeton.EDU> <5234@bgsuvax.UUCP> <7200@pt.cs.cmu.edu> Organization: Department of Computer Science, Purdue University Lines: 15 In article <7200@pt.cs.cmu.edu>, valdes@b.gp.cs.cmu.edu (Raul Valdes-Perez) writes: > Simon & Kotovsky wrote a program in an attempt to reproduce human > ability and shortcomings in sequence-extrapolation tasks. The > justification of this research was: people arrive at answers on > such tasks, despite the logical impossibility of a unique answer; > how can one explain this empirical phenomenon? Read the paper to > know how well they did. There was a paper at Edinburgh University that extended the Simon & Kotovsky work and gave a program in a Pascal-like language which was able to solve a considerable number of sequence extrapolation patterns. I read it about four years ago and remember only the title "Completion of Patterned Letter Sequen- ces" but not the author. Maybe somebody from EU knows. Manfred Stede, stede@cs.purdue.edu Brought to you by Super Global Mega Corp .com