2 |
Semantic Structural Decomposition for Neural Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
SemEval-2019 Task 1: Cross-lingual Semantic Parsing with UCCA ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Universal Dependency Parsing with a General Transition-Based DAG Parser ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
SemEval 2019 Shared Task: Cross-lingual Semantic Parsing with UCCA - Call for Participation ...
|
|
|
|
BASE
|
|
Show details
|
|
8 |
Simple and Effective Text Simplification Using Semantic and Neural Methods ...
|
|
|
|
BASE
|
|
Show details
|
|
10 |
BLEU is Not Suitable for the Evaluation of Text Simplification ...
|
|
|
|
BASE
|
|
Show details
|
|
11 |
A Transition-Based Directed Acyclic Graph Parser for UCCA ...
|
|
|
|
BASE
|
|
Show details
|
|
12 |
Automatic Selection of Context Configurations for Improved Class-Specific Word Representations ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
Automatic Selection of Context Configurations for Improved Class-Specific Word Representations
|
|
Rappoport, Ari; Reichart, Roi; Korhonen, Anna-Leena. - : Association for Computational Linguistics, 2017. : https://arxiv.org/pdf/1608.05528.pdf, 2017. : Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017), 2017
|
|
BASE
|
|
Show details
|
|
14 |
Automatic Selection of Context Configurations for Improved Class-Specific Word Representations ...
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Don’t Let Me Be #Misunderstood: Linguistically Motivated Algorithm for Predicting the Popularity of Textual Memes
|
|
|
|
In: Proceedings of the International AAAI Conference on Web and Social Media; Vol. 9 No. 1 (2015): Ninth International AAAI Conference on Web and Social Media ; 2334-0770 ; 2162-3449 (2015)
|
|
Abstract:
Prediction of the popularity of online textual snippets gained much attention in recent years. In this paper we investigate some of the factors that contribute to popularity of specific phrases such as Twitter hashtags. We define a new prediction task and propose a linguistically motivated algorithm for accurate prediction of hashtag popularity. Our prediction algorithm successfully models the interplay between various constraints such as the length restriction, typing effort and ease of comprehension. Controlling for network structure and social aspects we get a glimpse into the processes that shape the way we produce language and coin new words. In order to learn the interactions between the constraints we cast the problem as a ranking task. We adapt Gradient Boosted Trees for learning ranking functions in order to predict the hashtags/neologisms to be accepted. Our results outperform several baseline algorithms including SVM-rank, while maintaining higher interpretability, thus our model's prediction power can be used for better crafting of future hashtags.
|
|
Keyword:
cognitive; constraints; domain; gradient boosted trees; hashtags; memes; ranking; twitter
|
|
URL: https://ojs.aaai.org/index.php/ICWSM/article/view/14603
|
|
BASE
|
|
Hide details
|
|
|
|