John, that's an interesting concept. (01)
I use layered symbol tables, with indexes maintained in both arrival order
and sorted order. By putting the arrival id into tables for row-column
intersections, any kind of object can be identified by that id when the cell
gets retrieved. I also use a graph as a derivative of those components that
models node ids and arc ids as the same arrival ids. In that case, storing
the definition of each node and arc constitutes the representation of logic
at a very efficient level, but it also lets me get immediately back to the
lexical (or other object level) interface easily and quickly for interactive
discovery purposes. (02)
The Kolmogorov part starts with the more conceptual level, though it seems
to be taught more as a bit bucket squeezing exercise. (03)
The "chunking" of generalizations into ids of template cases, with only the
diff cases to be stored, is one clearly iterative approach; you can compress
that way and in addition you can compress the templates and the diff cases. (04)
When you consider multiple models within a KC compression system, and give
the system the ability to choose among the models, chunking might actually
be faster than linear in space, but slower than linear in time. (05)
-Rich (06)
Sincerely,
Rich Cooper
EnglishLogicKernel.com
Rich AT EnglishLogicKernel DOT com
9 4 9 \ 5 2 5 - 5 7 1 2
-----Original Message-----
From: ontolog-forum-bounces@xxxxxxxxxxxxxxxx
[mailto:ontolog-forum-bounces@xxxxxxxxxxxxxxxx] On Behalf Of John Bottoms
Sent: Friday, April 02, 2010 2:12 PM
To: [ontolog-forum]
Subject: Re: [ontolog-forum] Kolmogorov Inductive Inference (07)
Rich, (08)
Soft-switch technology used in communicaton abstracts a well-
known graph and identifies only those edges (arcs) that are
important for a given exchange. This is how the Internet protocol
MPLS gains speed. It forwards a list of arc numbers as the message
is processed in the graph. A node then pulls off the next arc
number and forwards the message on that arc. (09)
It's sorta like running through the doors in a house and just
remembering which ones you need to go through in sequence. It
speeds traversing the graph because there is known knowledge
about the graph and someone has worked out the transveral
sequence. Other protocols such as OSPF or BGP have to do the
heavy liftng of processing the grapg. You could abstract the
graph for that instance into just those nodes that are traversed. (010)
-John Bottoms
FirstStar Networks
Concord, MA
T: 978-505-9878 (011)
Rich Cooper wrote: (012)
> Sincerely,
>
> Rich Cooper
>
> EnglishLogicKernel.com
>
> Rich AT EnglishLogicKernel DOT com
>
> 9 4 9 \ 5 2 5 - 5 7 1 2
>
>
>
> Hi John,
>
>
>
> John Bottoms wrote:
>
> Rich,
>
>
>
> SGML consists of a grammar for the expression of grammars.
>
> During the early days of the CALS initiative there was
>
> discussion of tokenized version of a new DTD tag set. It was
>
> called Binary SGML or BSGML. It didn't get much traction but
>
> it allowed the reduction in size of the tags. One probably
>
> doesn't want to mess with the data that the tags envelop. That
>
> would fall under something like Markov models or some codebook
>
> approach.
>
>
>
> You can find scraps of it on forums such as this:
>
> http://lists.xml.org/archives/xml-dev/200504/msg00303.html
>
>
>
> -John Bottoms
>
> FirstStar Networks
>
> Concord, MA 01742
>
> T: 978-505-9878
>
>
>
> RGC:> Thanks John, that's an interesting tidbit of history I wasn't
> aware of. The same thread took me to a discussion of "xml binary",
> which seems to have been a movement with small following, but clearly
> useful for embedded appliances. Trading xml event messages seems to
> have made the inter-enterprise data sharing work rather well, even among
> different character sets and human languages. The only application area
> that occurs to me for xml binary seems to be for embedded intranets with
> ultra fast response times (are there any such applications in public
> use?).
>
>
>
> But I think the main compression value for xml binary and sgml
> metalanguages is mostly in its linear compressive ability. The
> Kolmogorov Complexity work centrally focuses on compressions that are
> more than linear, i.e., ability to substitute an arbitrarily complex
> (linguistic?) model for a common phrase as used in the data. The KC
> invariance theorem in my earlier post, in which one language (i.e. one
> model of behavior in the data) MUST differ in size from another language
> model ONLY by a constant factor, is a VERY illuminating result.
>
>
>
> For example, it explains how the stack of symbolic frames we project
> into conversations among familiars can be modeled and represented in
> layers. The notion of object-oriented context corresponds nicely to
> each frame in the stack. The same notion might help formulate methods
> for developing compression models.
>
>
>
> Musingly,
>
> -Rich
>
>
>
> Rich Cooper wrote:
>
>
>
>> Hi Ontologizers,
>
>>
>
>> I've been comparing and contrasting Popper's works against Kolmogorov
>
>> complexity ideas. This is sure to be of interest to linguistically
>
>> inclined ontologizers:
>
>>
>
>>
>
>> This is a snippet from a tutorial on Kolmogorov Complexity which I found
>
>> on the web somewhere and am reading next to Popper.
>
>>
>
>> It seems to me that this compression-based model of data applies very
>
>> well to linguistics ontologies, since language is compressed in so very
>
>> many ways. Curiously, I haven't found any psychological studies
>
>> relating this to language behaviors, or to any kind of ontological
>
>> behaviors. Does anyone know of such materials? What are the jargon
>
>> keywords needed to research that material by googling? Who are the most
>
>> fruitfully publishing authors?
>
>>
>
>> Suggestions appreciated,
>
>>
>
>> -Rich
>
>>
>
>> Sincerely,
>
>>
>
>> Rich Cooper
>
>> EnglishLogicKernel.com
>
>> Rich AT EnglishLogicKernel DOT com
>
>> 9 4 9 \ 5 2 5 - 5 7 1 2
>
>
> ------------------------------------------------------------------------
>
>
> _________________________________________________________________
> Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
> Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
> Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
> Shared Files: http://ontolog.cim3.net/file/
> Community Wiki: http://ontolog.cim3.net/wiki/
> To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
> To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx
> (013)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (014)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (015)
|