View source for DmitryDavidov et al. CoNLL

From Cohen Courses

← DmitryDavidov et al. CoNLL

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

== Citation == Semi-supervised recognition of sarcastic sentences in twitter and amazon, Dmitry Davidov, Oren Tsur and Ari Rappoport, CoNLL 2010 == Online version == [http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CC8QFjAA&url=http%3A%2F%2Faclweb.org%2Fanthology-new%2FW%2FW10%2FW10-29.pdf&ei=W2VoUOu7O9SF0QHjp4DADQ&usg=AFQjCNFrDjfOmEUFv-MY_ypfhm85_Jt2Kg&sig2=3y5O-TuFumdZNiWVxA3F3Q Semi-supervised recognition of sarcastic sentences in twitter and amazon] == Summary == It's '''not a self-contained''' paper, it '''depends on another paper''' heavily. It's '''not a creative work''', and I strongly suggest '''not to recommend''' to future students. This paper address the [[problem::Sarcasm Detection]] problem in Twitter and Amazon review posts. They propose to use some [[UsesMethod::semi-supervised learning]] methods to automatically generate patterns, and feed those patterns to some machine learning algorithm to detect sarcasm. However, from this paper, I have no idea how they used the unlabeled text, and they didn't provide any explanation about the classification algorithm they used, i.e. [[UsesMethod::k-Nearest Neighbor]]. They experimented on 2 dataset: [[UsesDataset::Twitter Dataset for Sarcasm|Twitter Dataset]] and [[UsesDataset::Amazon Dataset for Sarcasm|Amazon Dataset]] == Evaluation == In this paper, it proposed several feature extraction methods and a data enrichment method. In the evaluation part, it mainly compared the performance between those methods. Moreover, the authors used two settings to test the robustness, one is traditional in-domain cross validation and the other is cross domain test. It reported promising results on both settings. == Discussion == First of all, I have to say it's '''not a self-contained''' paper, it '''depends on another paper''' heavily and it's '''not a creative work'''. This paper didn't change much from the [[Tsur_et_al_ICWSM_10|AAAI 2010 paper]]. The only thing that this paper did is changed some small setting of previous paper: the algorithm follows [[Tsur_et_al_ICWSM_10|AAAI 2010 paper]], the feature follows the ACL 2006 paper [http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CCYQFjAA&url=http%3A%2F%2Fleibniz.cs.huji.ac.il%2Ftr%2F884.pdf&ei=f4doUN7hOq-O0QGYv4CQCg&usg=AFQjCNHmMVwq0zPYDEhpaScToMm5iVNO0A&sig2=jp-5-01q-OzlAY3AbIhntQ] The weak points of the paper includes: 1. It haven't any significant change to previous methods 2. It depended on another paper so heavy that the algorithm is not complete without that paper. 3. It didn't consider any baseline algorithms. For example, they can compare their method to other semi-supervised methods or related sarcasm detection methods. Strong point: 1. It's among some first attempt to solve this problem using semi-supervised learning method. == Related papers == * Paper:Icwsm - a great catchy name: Semi-supervised recognition of sarcastic sentences in product reviews:[http://www.aaai.org/ocs/index.php/ICWSM/ICWSM10/paper/download/1495/1851] * Paper:Efficient unsupervised discovery o word categories using symmetric patterns and high frequency words:[http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CCYQFjAA&url=http%3A%2F%2Fleibniz.cs.huji.ac.il%2Ftr%2F884.pdf&ei=f4doUN7hOq-O0QGYv4CQCg&usg=AFQjCNHmMVwq0zPYDEhpaScToMm5iVNO0A&sig2=jp-5-01q-OzlAY3AbIhntQ] * Paper:Automatic satire detection: Are you having a laugh?:[http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CCYQFjAA&url=http%3A%2F%2Fwww.aclweb.org%2Fanthology-new%2FP%2FP09%2FP09-2041.pdf&ei=J4hoUKLwDqjq0gHmooHAAw&usg=AFQjCNFcfaQBaoIczy8ACgzt3Mwkl71IvQ&sig2=9BVbppWWro_T8PoED1GBPg] == Study plan == As a typical incremental work, the original works includes: * Paper:Icwsm - a great catchy name: Semi-supervised recognition of sarcastic sentences in product reviews:[http://www.aaai.org/ocs/index.php/ICWSM/ICWSM10/paper/download/1495/1851] * Paper:Efficient unsupervised discovery o word categories using symmetric patterns and high frequency words:[http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CCYQFjAA&url=http%3A%2F%2Fleibniz.cs.huji.ac.il%2Ftr%2F884.pdf&ei=f4doUN7hOq-O0QGYv4CQCg&usg=AFQjCNHmMVwq0zPYDEhpaScToMm5iVNO0A&sig2=jp-5-01q-OzlAY3AbIhntQ] And the classification algorithm used: * Article: k-Nearest Neighbor:[[UsesMethod::k-Nearest Neighbor]]

Return to DmitryDavidov et al. CoNLL.