Wait Signals Predict Sarcasm in Online Debates
نویسندگان
چکیده
منابع مشابه
Dominance Signals in Debates
The paper analyzes the signals of dominance in different modalities displayed during TV talk shows and debates. Dominance is defined, according to a model in terms of goals and beliefs, as a person’s having more power than others. A scheme is presented for the annotation of signals of dominance in political debates: based on the analysis of videotaped data, a typology is proposed of strategies ...
متن کاملRecognizing Stances in Online Debates
This paper presents an unsupervised opinion analysis method for debate-side classification, i.e., recognizing which stance a person is taking in an online debate. In order to handle the complexities of this genre, we mine the web to learn associations that are indicative of opinion stances in debates. We combine this knowledge with discourse information, and formulate the debate side classifica...
متن کاملAutomatic Summarization of Online Debates
Debate summarization is one of the novel and challenging research areas in automatic text summarization which has been largely unexplored. In this paper, we develop a debate summarization pipeline to summarize key topics which are discussed or argued in the two opposing sides of online debates. We view that the generation of debate summaries can be achieved by clustering, cluster labeling, and ...
متن کاملUnshared task: (Dis)agreement in online debates
Topic-independent expressions for conveying agreement and disagreement were annotated in a corpus of web forum debates, in order to evaluate a classifier trained to detect these two categories. Among the 175 expressions annotated in the evaluation set, 163 were unique, which shows that there is large variation in expressions used. This variation might be one of the reasons why the task of autom...
متن کاملOnline Train Disposition: To Wait or Not to Wait?
We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers’ waiting time. We present deterministic polynomial-time optimal algorithms and matching lower bounds for several problem versions. In addition, all lower bounds also apply to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dialogue & Discourse
سال: 2019
ISSN: 2152-9620
DOI: 10.5087/dad.2019.203