semantic networks cannot learn any new information unless they have a methodology for replication of valid paths through graph space. adjudicating valid paths means being in possession of a meaningful path code with the following unique constraint--its meaning is found within the last spatial cycle only... it is a new word in the lexicon and exists as an insertion in the graph exactly at the point where words are stored in graph theory... adama... so, valid paths are stored in the lexicon as inner gravity or iner(t) gravity and compared with the path taken to find the node which stores the code... these two pieces of information are where i am now..
(i think it's quite silly for a computer to come up with an arc named "isa" when it is implicit in its index... what shapiro et all study is the glyph of semantic networks, not the codes of them...
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment