”What do these two words h

”What do these two words have in common?”

An easy question for people.

A hard one for a computer.

Well, two isn’t hard, three is very hard, four is very very hard – if you want to figure out how all of the words interrelate with each other.

That is – until you program it.

Even when you do, you start to get ‘OUT OF MEMORY” errors very quickly. Easy for human, hard for computer.

This will make sense to maybe two or three of your out there – apologies to everyone else. I accidentally discovered *Triples* – the thing used for RDF in XML… the *thing I’ve been avoiding learning about* for many many many years now.

I’ve been trying to figure out a useful way to encode multiple dimensions of data, and it’s very difficult to do. I’ve always used Excel because it allows for a nearly finite variety of storing and manipulating ‘bits of knowledge’, whether its numbers or words – it doesn’t care what you throw at it.

Well, as I have always done, #excel vlookups, unique tables, sorting, remove blanks, etc etc – I can do it in my sleep.

But as i starting finding the answers I was seeking, I thought, ”There *has* to be a way to store this in a regular ol’ database somewhere.”

So I searched in Graphing theory, network graphs, six degrees of separation, neural networking, Traffic Flow patterns – they’re all completely The Same…

And there I saw it.

RDF.

*Subject* *Predicate* *Object*

See the golden line? go to the right of the gray? The subject is *touch* the predicate is something like, ”Is the same as” or ”has the same meaning as” (it’s not written down) and the object is *apprehend*.

That’s it. It’s been right in the thing I was avoiding all this time because I thought it was so darned complex.

But I’ve been doing far more complicated things in Excel for a decade.

The stuff on the left? The ”Memory store?”

That would be the start of a Network Graph… Or higher dimension connections, really. The stuff that starts blowing up computer memory if you don’t do it right. I don’t know which type of graph – I’m just learning about them for the very first time because they’ll serve what I need.

The search mechanism will be a breadth First Search, or perhaps a Depth First search – ways to traverse a maze when you’re lost.

this will all be extremely extremely simple when I’m all done. This is the complicated crap I have to go through to get to the simple, unknown answers.

I just can’t believe there isn’t an existing program to easily have me plug in a bunch of lists and tell me what they all have in common and how they all relate to one another.

But, while it’s easy as pie for humans to do, computers get into ”Out of Memory Errors” very quickly with this stuff, which is why few have dared attempt it. And those that do, are either researchers or making lots and lots of money off of it.

Alas I’m in the researcher category. For the moment. And I’m loving every minute of it.

Apologies to all my regular viewers. This is the kind of stuff I don’t usually talk about so it is probably coming out all garbady-gooky.

Leave a comment

Your email address will not be published. Required fields are marked *


7 − five =

Leave a Reply