EFTA02715754.pdf

DataSet-11 4 pages 1,109 words document
👁 1 💬 0
📄 Extracted Text (1,109 words)
From: on behalf of Ben Goertzel Sent: Monday, September 7, 2015 12:17 AM To: Jeffrey E. Cc: Joscha Bach Subject: Re: Hi, I agree w/ Joscha's caution about discrimination tasks: They can be often be solved rather well, but in devious ways, by statistical supervised learning algorithms. Suppose you pose a linguistic discrimination task of some sort -- and a supervised learning algorithm, trained on a mass of data, can solve it with 97% accuracy. The algorithm's pattern of errors may indicate to YOU, intuitively, that it doesn't really understand what's going on. But then, it may be that the average person solves the task with only 95% accuracy, though with a different pattern of errors that indicates intuitively they have a different kind of understanding... I like the idea of a language learning challenge, but posing it properly seems tricky. As soon as something becomes a "challenge", one has to worry about protecting against various subterfuges (deception, once again!). Suppose one poses a challenge to learn a language from an un-annotated corpus of texts. OK, but then some nefarious clever person can try to solve this using an algorithm whose parameters were all carefully tuned via analysis of an annotated corpus in that same language. And these parameters may be quite complex structures. The winning approach would then not be able to work on another language for which there was no large annotated corpus (no Penn Treebank analogue, etc.). It seems that challenges are easier to formulate for engineering breakthroughs than science breakthroughs... Here is one idea, off the top of my head.... Perhaps at least it can stimulate thoughts .... This is not about language learning, though, it's about recognizing and generating coherent, meaningful language.. 1) Show human subjects some videos of game characters carrying out certain sequences of behaviors in a video-game environment 2) For each behavior-sequence B, ask the human subjects to generate some textual instructions, that would enable the reader to emulate behavior-sequence B (even if the reader had not seen the videos) 3a) Ask the AI to figure out which textual instructions would actually work, for each behavior-sequence B 3b) Ask the AI to actually generate textual instructions, based on behavior-sequences (then the judgment is whether people, when following, the Al's instructions, actually carry out the appropriate sort of behavior sequence) EFTA_R1_02148511 EFTA02715754 Note that 3a and 3b both measure "coherence" in a concrete and obviously meaningful way... I remember seeing some NL generation challenge vaguely like this a few years ago, but don't have the link handy. Ruiting will probably be able to find the reference if it's of interest... For language learning, the only good way I can think of to make a challenge would be to use languages for which there are no annotated corpora. So, the challenge would be to take some unannotated text (or speech) from an arbitrary human language (could be an Australian aboriginal language, or an African language, etc.), and then figure out how to generate grammatical and coherent utterances in that language. This is pretty hard obviously. If someone chose to "cheat" by building annotated corpora or rule-bases for every obscure language in the world, at least they would be doing the world a big service along the way ;-D Interesting thought-direction, anyhow... ! -- Ben On Mon, Sep 7, 2015 at 4:23 AM, jeffrey E. <[email protected]> wrote: > I dont want statistical modeling you and ben for years have stated you > wanted to put an avatar, and hope it can do things a 2 year old can do. > the challenge is learning a language. different that moving blocks in a > video game. > On Sun, Sep 6, 2015 at 2:38 PM, Joscha Bach <[email protected]> wrote: » This challenge idea is excellent; I really love it! >» first draft. of the Chomsky Challenge. . Produce a non- living >» system that can be put into an environment for a while and --- 1. be >» able to discriminate language from noise.. prize . a 1 dollar bill >» signed by Noam and 100k. » What is the system allowed to have when it starts? We would need to » define the environment, for instance text based or audio, or » movies/youtube. Once the contestants know the environment, they can » use standard machine learning methods to discern entropy in the » signal, and separate language-like noise from non language-like » noise. Google does this pretty well, and automatically (but not perfectly) sub-title videos in a number of languages. » I imagine you want to go beyond that? >> >» . 2. be able to discriminate coherent sentences from non ( we 2 EFTA_R1_02148512 EFTA02715755 >» provide 10 test sentences ). » I suspect that this is harder, Noam might point out that a lot of » grammatically well-formed sentences used in politics are not coherent » ;-) >» prize a 10 dollar signed Chomsky bill, and 500k. 3. a >» language learning module. » Build a system that is able to learn a new language without » hand-coding, and translate sentences from this language into English and back? Excellent! >» 20 dollar bill signed and 1 million, 4. a sense making module that can >» understand meaning inference. . etc. the non recommendation >» recommendation. . ie the student has a nice family. etc. a 100 dollar >» signed bill and 10 million dollars. ? --- >» >» lets also do a minsky challenge and if you want martin a NOVAK >» challenge. >> » Yes! Let us ask Marvin and Martin about the biggest unsolved problems » in their field. > -- > please note > The information contained in this communication is confidential, may > be attorney-client privileged, may constitute inside information, and > is intended only for the use of the addressee. It is the property of > JEE Unauthorized use, disclosure or copying of this communication or > any part thereof is strictly prohibited and may be unlawful. If you > have received this communication in error, please notify us > immediately by return e-mail or by e-mail to [email protected], > and destroy this communication and all copies thereof, including all > attachments. copyright -all rights reserved Ben Goertzel, PhD http://goertzel.org "The reasonable man adapts himself to the world: the unreasonable one persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable man." -- George Bernard Shaw <?xml version="1.0" encoding="UTF- 8"?> <!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/Propertylist-1.0.dtd"> <plist version="1.0"> <dict> <key>date-last-viewed</key> <integer>0</integer> <key>date-received</key> 3 EFTA_R1_02148513 EFTA02715756 <Integer>1441585000</integer> <key>flags</key> <integer>8590195717</integer> <key>gmail-label-ids</key> <array> <integer>7</integer> <integer>27</integer> </array> <key>remote-id</key> <string>540244</string> </dict> </plist> 4 EFTA_R1_02148514 EFTA02715757
ℹ️ Document Details
SHA-256
8161d7458425a09d9cd13c56d2d05aa8cc26d5e857d04a08bec14704cdd00a5a
Bates Number
EFTA02715754
Dataset
DataSet-11
Type
document
Pages
4

Community Rating

Sign in to rate this document

📋 What Is This?

Loading…
Sign in to add a description

💬 Comments 0

Sign in to join the discussion
Loading comments…
Link copied!