Mark, The paper said:
"Conceptually we begin by enumerating all tree fragments that occur in the training data 1,...,n." Those are the dimensions, all of the parse tree fragments in the training data. And as I pointed out in an email I just sent to Richard, although usually only a small set of them are involved in any one match between two parse trees, they can all be used over set of many such matches. So the full dimensionality is actually there, it is just that only a particular subset of them are being used at any one time. And when the system is waiting for the next tree to match it is potentially capability of matching it against any of its dimensions. Ed Porter -----Original Message----- From: Mark Waser [mailto:[EMAIL PROTECTED] Sent: Wednesday, December 05, 2007 3:07 PM To: agi@v2.listbox.com Subject: Re: Hacker intelligence level [WAS Re: [agi] Funding AGI research] ED PORTER=====> The 500K dimensions were mentioned several times in a lecture Collins gave at MIT about his parse. This was probably 5 years ago so I am not 100% sure the number was 500K, but I am about 90% sure that was the number used, and 100% sure the number was well over 100K. OK. I'll bite. So what do *you* believe that these dimensions are? Words? Word pairs? Entire sentences? Different trees? ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?&; ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=72646193-0bde77
<<attachment: winmail.dat>>
