in reply to RE: RE: More About Memory -- case study
in thread More About Memory -- case study

<cite> When going backwards, I did a section, went back to my closest pointer, went forward until I found my last backwards, keeping as much as I could in a small short term memory space (say an array of 5 to 7 elements). </cite> Yes, this is because you know the proximity of some of the letter. The node for 's' might look like: 
s => {
  next => 't',
  near => 'r',
}

[download]


$_="goto+F.print+chop;\n=yhpaj";F1:eval

Replies are listed 'Best First'.
Memory case study in play
by Blue (Hermit) on Oct 20, 2000 at 17:39 UTC
    I agree. I'd put it a little more like:

    s => {
  next => 't'
  nearPrev => 'qr'
  nearNext => 't'
}

    [download]
    With the size of the nearPrev and nearNext dependant on the letters. M would be in the whole "lmnop" cluster.

    For numbers, I would also have a "prev" which is undefined for letters.

    Now, I've found all of this facinating (really!), but how can use something like this? We've talked about associations for numbers, letters, and words.

    One interesting project would be a Perl program that plays word association, and learns from playing with others. Instead of just a "next", it would be most interesting to me if it had a "context" it tried to stay in (usually) also.

    Well, I've got a weekend in front of me...

    =Blue
    ...you might be eaten by a grue...

[reply]
[d/l]

In Section Meditations