3 ms·
I’m not convinced. Good computer chess play is based on a deterministic tree walking algorithm, something that’s been clearly in computers’ wheelhouse since fo
by umanwizard 9y ago
I’m not convinced.
Good computer chess play is based on a deterministic tree walking algorithm, something that’s been clearly in computers’ wheelhouse since forever.
Good computer go play is based on neural pattern recognition, which is also (probably) what human sarcasm detection is based on.
- Declanomous 9y agoOn the other hand, go operates in a much more finite universe than conversation does. You have 2 pieces, and a number of places to put them. You have a goal. Conversation doesn't work like that, and takes a vast amount of information to understand whether someone is being sarcastic.
- brisance 9y agoSo you’re saying that the people cited in the article accomplished something more significant than the AlphaGo team…?
- TuringTest 9y agoProbably not, because the approach taken in the paper is identifying a small set of patterns that are present in sarcasm, not fully understanding the meaning and context of why the sentence is sarcastic. It's a useful tool with pragmatic applications in online discourse analysis, but not a solved problem.
- Declanomous 9y agoI'm just saying it's easier to make progress when your universe is easier to define.