Steve said: Do you mean some sort of extreme extension to Backus Naur Form? I suggest giving some examples, without worrying too much about the language details. ----- I wasn't really thinking of the form but just that it would directly input a relation into the program. For example the relation of dependency. I
On Mon, Oct 14, 2013 at 6:24 AM, Steve Richfield <[email protected]>wrote: > Jim, > > Do you mean some sort of extreme extension to Backus Naur Form? > > I suggest giving some examples, without worrying too much about the > language details. > > Steve > ===================== > > > On Sun, Oct 13, 2013 at 4:45 PM, Jim Bromer <[email protected]> wrote: > >> The idea of a linguistic reference marker language seems kind of >> interesting. Someone in these groups have pointed out that there are >> artificial languages in which anaphoric-like references may be >> defined, and anyone could do that by denoting those kinds of >> connective relations by using some meta-notation. However, my idea of >> the artificial reference marker language does go a step further in >> that it would allow for definitions of linguistic markers by type and >> other possible abstractions that could be defined with other levels of >> referential relations. This definition with types does sound like a >> programming language but I believe I can take it a step higher in that >> it can be used to create run time dilemmas some of which should be >> resolvable while the program is running so long as the basis of the >> defined relations are not too poorly constructed. This could feasibly >> turn out to be a highly controllable testing program that has a rich >> potential of expression and which could detail some of the problems >> that need to be solved in this field. >> >> Right now I am thinking about a system which would simultaneously run >> the reference marker language as a meta-language or a paralanguage to >> a text-based natural language. By keeping the language simple the >> test might be run by creating the needed linguistic markers (like >> anaphoric-like connectors) as they are needed. So months or years of >> learning might be avoided to prepare for a test run. And abstractions >> or generalizations might be denoted by groups of examples or by >> categorical denotations. >> >> There have been many attempts to use formal linguistics in AI and they >> have not generated overwhelming evidence that the method is the best >> route to AGI. However, my theory is that most professional linguistic >> AI models are overly reliant on generalizations that are too broad and >> are too simple. I believe that true intelligence must be supplied >> with a rich set of possibilities and that old AI linguistic models >> have not provided the programs with those possibilities. But, a rich >> set of generalizations probably would overwhelm an AGI program with >> too much complexity. By using the linguistic reference marker >> language some of that complexity could be studied in a controlled >> environment using relatively simple examples. >> >> For example, (an abstract example), if there are many possible >> reference marker systems (that were previously 'learned' or defined) >> then the program would have to choose which of them would be >> appropriate for a particular context. These possibilities would not >> all be competitive selections, and in most all cases many possible >> reference relational systems would have to be used to understand the >> sentence properly. So then, part of the problem is that the program >> would need to know when it had interpreted the sentence well and that >> it should stop looking for other possible referential relations for >> the sentence. At this point I have no idea how I would program a >> computer to decide something like this. But, by using this >> specialized test facility, I could gain a lot of experience by relying >> on my intuition to decide when the program had come up with an >> interpretation that was good enough at that time. >> >> Another simple abstract example that I have in mind is that I could >> try to use natural language to point something out (about the >> referential relations) and if that did not work then I could use the >> artificial referential marker language that was running concurrently >> with the natural language exchanges to present it to the computer >> program. Then later I could see if I could use similar terms (from the >> natural language) to direct the computer to become aware of some >> referential relation in the subject discussion without needing further >> detailing using the referential marker language. >> >> While none of this is totally new to me it is clear that I am starting >> to think more definitely about some of these kinds of problems just >> because I am thinking about developing the referential marker >> language. So it seems like an interesting idea that should be useful >> to me. I will probably try to develop it and try it out. >> >> Some people think that this has little to do with AGI. Well similar >> techniques could be used to designate the referential relations >> between visual and other sensory data so that shows that the method is >> general enough. >> >> Jim Bromer >> >> >> ------------------------------------------- >> AGI >> Archives: https://www.listbox.com/member/archive/303/=now >> RSS Feed: >> https://www.listbox.com/member/archive/rss/303/10443978-6f4c28ac >> Modify Your Subscription: https://www.listbox.com/member/?&; >> Powered by Listbox: http://www.listbox.com >> > > > > -- > Full employment can be had with the stoke of a pen. Simply institute a six > hour workday. That will easily create enough new jobs to bring back full > employment. > > *AGI* | Archives <https://www.listbox.com/member/archive/303/=now> > <https://www.listbox.com/member/archive/rss/303/24379807-f5817f28> | > Modify<https://www.listbox.com/member/?&;>Your Subscription > <http://www.listbox.com> > ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
