![]() |
If this is your first visit, be sure to check out the FAQ by clicking the link above. You may have to register before you can post: click the register link above to proceed. To start viewing messages, select the forum that you want to visit from the selection below. |
|
|
Thread Tools | Display Modes |
|
#1
|
|||
|
|||
![]()
It was neat to watch (we held a pizza event for Tuesday's show).
Here's a some random observations an outsider to the domain of CS might not immediately make: 1) While the answering part was somewhat impressive, the "playing Jeopardy" part was unfair, I thought. Although Watson did have to actuate a mechanical button, it was fed a text version of the question (yes, I know, the answer) as soon as the question screen was revealed. That's cheating, in my book. Watson should have had to read the screen and/or listen to Alex. Instead it got a pre-processed version of the question immediately. Presumably it could also cycle its button much faster than a human could, too. As far as I can tell Watson did not even have any audio input, so my guess is that as soon as it decided it should answer it just started pushing the button, regardless of whether Alex was still talking or not. That removes part of the game. 2) As expected, it did VERY well on questions that were essentially single noun answers, or proper names. Simple fact lookup, even in correlating a few different keywords in a question, isn't really AI, it's just a massive and fast computer (Watson is room-sized). Big Iron, as they say. Roughly 10 seconds to make word associations and find a probable answer. Not bad. 3) It did very poorly on questions which needed a whole phrase for an answer (e.g., "What is he is missing a leg?" as opposed to "What is leg?", Watson's actual answer). The best it could do it seemed were perhaps two word answers (the rhyming category, "Obama's Llamas" as an example). 4) The interesting part is that no human could manually create the fact and word associations that are its database, so this had to be automated and tailored to the task. The developers themselves were surprised at some answers, so this shows how "machine learning" can give surprising results when one cannot conceptualize the entire dataset over which learning happens. In any case, sorta like crazy uncle Benny, Watson would be fun at a party but still a long way from passing a Turing test: http://en.wikipedia.org/wiki/Turing_test Jon. |
#2
|
|||
|
|||
![]()
On Feb 17, 5:25*pm, Jonathan Cook wrote:
Watson would be fun at a party but still a long way from passing a Turing test: http://en.wikipedia.org/wiki/Turing_test I don't really have an opinion on either of the above contentions, but I find it curious that so many people still think of a machine passing a Turing test as some sort of holy grail. If you read the Wikipedia article to which you provided the link, you will see that it has already been done.....many times. In fact, it has been done thousands (probably millions) of times every day for the last couple of decades at least. Turing's question was mildly interesting.....sixty years ago.....only because it looked at that time as if the challenge would be a long- standing one. It wasn't. Oddly, very few people have noticed that.....or at least commented on it publicly.....and gotten any attention. And, of course, Turing very deliberately and self-consciously side- stepped the real question.....the truly interesting one. Nobody talks about that much. Meanwhile, Turning tests still command a lot of attention from people who should know better. It's a pity. They could be thinking about many more interesting things. For example, rather than speculating on whether a machine could ever pass as a human being (even under a rigid set of rules explicity aiding the fraud).....which is to say, a machine that could pass a Turing test.....it might prove more challenging to try to find a human being who could not fail such a test. g. who judges the judges? |
#3
|
|||
|
|||
![]()
On Feb 18, 10:57*am, Giles wrote:
On Feb 17, 5:25*pm, Jonathan Cook wrote: Watson would be fun at a party but still a long way from passing a Turing test: http://en.wikipedia.org/wiki/Turing_test I don't really have an opinion on either of the above contentions, but I find it curious that so many people still think of a machine passing a Turing test as some sort of holy grail. * Hell, I know *people* who could not pass the Turing test. And I've encountered answering machines that held their own for a few seconds, too. --riverman |
Thread Tools | |
Display Modes | |
|
|