Paper Group NANR 133
UWaterloo at SemEval-2017 Task 8: Detecting Stance towards Rumours with Topic Independent Features. Uma Ferramenta para Identificar Desvios de Linguagem na L'\ingua Portuguesa (A tool to identify the linguistic deviations in the Portuguese Language)[In Portuguese]. Estudo explorat'orio de categorias gramaticais com potencial de indicadores para a …
UWaterloo at SemEval-2017 Task 8: Detecting Stance towards Rumours with Topic Independent Features
| Title | UWaterloo at SemEval-2017 Task 8: Detecting Stance towards Rumours with Topic Independent Features |
| Authors | Hareesh Bahuleyan, Olga Vechtomova |
| Abstract | This paper describes our system for subtask-A: SDQC for RumourEval, task-8 of SemEval 2017. Identifying rumours, especially for breaking news events as they unfold, is a challenging task due to the absence of sufficient information about the exact rumour stories circulating on social media. Determining the stance of Twitter users towards rumourous messages could provide an indirect way of identifying potential rumours. The proposed approach makes use of topic independent features from two categories, namely cue features and message specific features to fit a gradient boosting classifier. With an accuracy of 0.78, our system achieved the second best performance on subtask-A of RumourEval. |
| Tasks | Rumour Detection, Stance Detection |
| Published | 2017-08-01 |
| URL | https://www.aclweb.org/anthology/S17-2080/ |
| https://www.aclweb.org/anthology/S17-2080 | |
| PWC | https://paperswithcode.com/paper/uwaterloo-at-semeval-2017-task-8-detecting |
| Repo | |
| Framework | |
Uma Ferramenta para Identificar Desvios de Linguagem na L'\ingua Portuguesa (A tool to identify the linguistic deviations in the Portuguese Language)[In Portuguese]
| Title | Uma Ferramenta para Identificar Desvios de Linguagem na L'\ingua Portuguesa (A tool to identify the linguistic deviations in the Portuguese Language)[In Portuguese] |
| Authors | Jonathan Nau, Aluizio Haendchen Filho, Guilherme Passero, Vinicius Cavaco |
| Abstract | |
| Tasks | |
| Published | 2017-10-01 |
| URL | https://www.aclweb.org/anthology/W17-6601/ |
| https://www.aclweb.org/anthology/W17-6601 | |
| PWC | https://paperswithcode.com/paper/uma-ferramenta-para-identificar-desvios-de |
| Repo | |
| Framework | |
Estudo explorat'orio de categorias gramaticais com potencial de indicadores para a An'alise de Sentimentos (An Exploratory study of grammatical categories as potential indicators for Sentiment Analysis)[In Portuguese]
| Title | Estudo explorat'orio de categorias gramaticais com potencial de indicadores para a An'alise de Sentimentos (An Exploratory study of grammatical categories as potential indicators for Sentiment Analysis)[In Portuguese] |
| Authors | J{'u}lia Rodrigues, Adriana Pagano, Emerson Paraiso |
| Abstract | |
| Tasks | Sentiment Analysis |
| Published | 2017-10-01 |
| URL | https://www.aclweb.org/anthology/W17-6602/ |
| https://www.aclweb.org/anthology/W17-6602 | |
| PWC | https://paperswithcode.com/paper/estudo-explorata3rio-de-categorias |
| Repo | |
| Framework | |
UCSC-NLP at SemEval-2017 Task 4: Sense n-grams for Sentiment Analysis in Twitter
| Title | UCSC-NLP at SemEval-2017 Task 4: Sense n-grams for Sentiment Analysis in Twitter |
| Authors | Jos{'e} Abreu, Iv{'a}n Castro, Claudia Mart{'\i}nez, Sebasti{'a}n Oliva, Yoan Guti{'e}rrez |
| Abstract | This paper describes the system submitted to SemEval-2017 Task 4-A Sentiment Analysis in Twitter developed by the UCSC-NLP team. We studied how relationships between sense n-grams and sentiment polarities can contribute to this task, i.e. co-occurrences of WordNet senses in the tweet, and the polarity. Furthermore, we evaluated the effect of discarding a large set of features based on char-grams reported in preceding works. Based on these elements, we developed a SVM system, which exploring SentiWordNet as a polarity lexicon. It achieves an $F_1=0.624$of average. Among 39 submissions to this task, we ranked 10th. |
| Tasks | Sentiment Analysis |
| Published | 2017-08-01 |
| URL | https://www.aclweb.org/anthology/S17-2136/ |
| https://www.aclweb.org/anthology/S17-2136 | |
| PWC | https://paperswithcode.com/paper/ucsc-nlp-at-semeval-2017-task-4-sense-n-grams |
| Repo | |
| Framework | |
Proceedings of the Third Workshop on Discourse in Machine Translation
| Title | Proceedings of the Third Workshop on Discourse in Machine Translation |
| Authors | |
| Abstract | |
| Tasks | Machine Translation |
| Published | 2017-09-01 |
| URL | https://www.aclweb.org/anthology/W17-4800/ |
| https://www.aclweb.org/anthology/W17-4800 | |
| PWC | https://paperswithcode.com/paper/proceedings-of-the-third-workshop-on-1 |
| Repo | |
| Framework | |
Three-phase training to address data sparsity in Neural Machine Translation
| Title | Three-phase training to address data sparsity in Neural Machine Translation |
| Authors | Ruchit Agrawal, Mihir Shekhar, Dipti Sharma |
| Abstract | |
| Tasks | Machine Translation |
| Published | 2017-12-01 |
| URL | https://www.aclweb.org/anthology/W17-7503/ |
| https://www.aclweb.org/anthology/W17-7503 | |
| PWC | https://paperswithcode.com/paper/three-phase-training-to-address-data-sparsity |
| Repo | |
| Framework | |
A Simulated Annealing Based Inexact Oracle for Wasserstein Loss Minimization
| Title | A Simulated Annealing Based Inexact Oracle for Wasserstein Loss Minimization |
| Authors | Jianbo Ye, James Z. Wang, Jia Li |
| Abstract | Learning under a Wasserstein loss, a.k.a. Wasserstein loss minimization (WLM), is an emerging research topic for gaining insights from a large set of structured objects. Despite being conceptually simple, WLM problems are computationally challenging because they involve minimizing over functions of quantities (i.e. Wasserstein distances) that themselves require numerical algorithms to compute. In this paper, we introduce a stochastic approach based on simulated annealing for solving WLMs. Particularly, we have developed a Gibbs sampler to approximate effectively and efficiently the partial gradients of a sequence of Wasserstein losses. Our new approach has the advantages of numerical stability and readiness for warm starts. These characteristics are valuable for WLM problems that often require multiple levels of iterations in which the oracle for computing the value and gradient of a loss function is embedded. We applied the method to optimal transport with Coulomb cost and the Wasserstein non-negative matrix factorization problem, and made comparisons with the existing method of entropy regularization. |
| Tasks | |
| Published | 2017-08-01 |
| URL | https://icml.cc/Conferences/2017/Schedule?showEvent=585 |
| http://proceedings.mlr.press/v70/ye17b/ye17b.pdf | |
| PWC | https://paperswithcode.com/paper/a-simulated-annealing-based-inexact-oracle |
| Repo | |
| Framework | |
CVTE at IJCNLP-2017 Task 1: Character Checking System for Chinese Grammatical Error Diagnosis Task
| Title | CVTE at IJCNLP-2017 Task 1: Character Checking System for Chinese Grammatical Error Diagnosis Task |
| Authors | Xian Li, Peng Wang, Suixue Wang, Guanyu Jiang, Tianyuan You |
| Abstract | Grammatical error diagnosis is an important task in natural language processing. This paper introduces CVTE Character Checking System in the NLP-TEA-4 shared task for CGED 2017, we use Bi-LSTM to generate the probability of every character, then take two kinds of strategies to decide whether a character is correct or not. This system is probably more suitable to deal with the error type of bad word selection, which is one of four types of errors, and the rest are words re-dundancy, words missing and words disorder. Finally the second strategy achieves better F1 score than the first one at all of detection level, identification level, position level. |
| Tasks | |
| Published | 2017-12-01 |
| URL | https://www.aclweb.org/anthology/I17-4012/ |
| https://www.aclweb.org/anthology/I17-4012 | |
| PWC | https://paperswithcode.com/paper/cvte-at-ijcnlp-2017-task-1-character-checking |
| Repo | |
| Framework | |
Treatment of Markup in Statistical Machine Translation
| Title | Treatment of Markup in Statistical Machine Translation |
| Authors | Mathias M{"u}ller |
| Abstract | We present work on handling XML markup in Statistical Machine Translation (SMT). The methods we propose can be used to effectively preserve markup (for instance inline formatting or structure) and to place markup correctly in a machine-translated segment. We evaluate our approaches with parallel data that naturally contains markup or where markup was inserted to create synthetic examples. In our experiments, hybrid reinsertion has proven the most accurate method to handle markup, while alignment masking and alignment reinsertion should be regarded as viable alternatives. We provide implementations of all the methods described and they are freely available as an open-source framework. |
| Tasks | Machine Translation, Tokenization |
| Published | 2017-09-01 |
| URL | https://www.aclweb.org/anthology/W17-4804/ |
| https://www.aclweb.org/anthology/W17-4804 | |
| PWC | https://paperswithcode.com/paper/treatment-of-markup-in-statistical-machine |
| Repo | |
| Framework | |
What to Write? A topic recommender for journalists
| Title | What to Write? A topic recommender for journalists |
| Authors | Aless Cucchiarelli, ro, Christian Morbidoni, Giovanni Stilo, Paola Velardi |
| Abstract | In this paper we present a recommender system, What To Write and Why, capable of suggesting to a journalist, for a given event, the aspects still uncovered in news articles on which the readers focus their interest. The basic idea is to characterize an event according to the echo it receives in online news sources and associate it with the corresponding readers{'} communicative and informative patterns, detected through the analysis of Twitter and Wikipedia, respectively. Our methodology temporally aligns the results of this analysis and recommends the concepts that emerge as topics of interest from Twitter andWikipedia, either not covered or poorly covered in the published news articles. |
| Tasks | Recommendation Systems |
| Published | 2017-09-01 |
| URL | https://www.aclweb.org/anthology/W17-4204/ |
| https://www.aclweb.org/anthology/W17-4204 | |
| PWC | https://paperswithcode.com/paper/what-to-write-a-topic-recommender-for |
| Repo | |
| Framework | |
On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm
| Title | On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm |
| Authors | Masaaki Imaizumi, Takanori Maehara, Kohei Hayashi |
| Abstract | Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of statistical theory and of scalable algorithms. In this paper, we address the limitations. First, we introduce a convex relaxation of the TT decomposition problem and derive its error bound for the tensor completion task. Next, we develop a randomized optimization method, in which the time complexity is as efficient as the space complexity is. In experiments, we numerically confirm the derived bounds and empirically demonstrate the performance of our method with a real higher-order tensor. |
| Tasks | |
| Published | 2017-12-01 |
| URL | http://papers.nips.cc/paper/6982-on-tensor-train-rank-minimization-statistical-efficiency-and-scalable-algorithm |
| http://papers.nips.cc/paper/6982-on-tensor-train-rank-minimization-statistical-efficiency-and-scalable-algorithm.pdf | |
| PWC | https://paperswithcode.com/paper/on-tensor-train-rank-minimization-statistical-1 |
| Repo | |
| Framework | |
LIMSI-COT at SemEval-2017 Task 12: Neural Architecture for Temporal Information Extraction from Clinical Narratives
| Title | LIMSI-COT at SemEval-2017 Task 12: Neural Architecture for Temporal Information Extraction from Clinical Narratives |
| Authors | Julien Tourille, Olivier Ferret, Xavier Tannier, Aur{'e}lie N{'e}v{'e}ol |
| Abstract | In this paper we present our participation to SemEval 2017 Task 12. We used a neural network based approach for entity and temporal relation extraction, and experimented with two domain adaptation strategies. We achieved competitive performance for both tasks. |
| Tasks | Domain Adaptation, Entity Extraction, Relation Extraction, Temporal Information Extraction |
| Published | 2017-08-01 |
| URL | https://www.aclweb.org/anthology/S17-2098/ |
| https://www.aclweb.org/anthology/S17-2098 | |
| PWC | https://paperswithcode.com/paper/limsi-cot-at-semeval-2017-task-12-neural |
| Repo | |
| Framework | |
Descri\cc~ao e modelagem de constru\cc~oes interrogativas QU- em Portugu^es Brasileiro para o desenvolvimento de um chatbot (Description and modeling of interrogative constructs QU- in Brazilian Portuguese for the development of a chatbot)[In Portuguese]
| Title | Descri\cc~ao e modelagem de constru\cc~oes interrogativas QU- em Portugu^es Brasileiro para o desenvolvimento de um chatbot (Description and modeling of interrogative constructs QU- in Brazilian Portuguese for the development of a chatbot)[In Portuguese] |
| Authors | Nat{'a}lia Duarte Mar{\c{c}}{~a}o, Tiago Timponi Torrent, Ely Edison Silva Matos |
| Abstract | |
| Tasks | Chatbot |
| Published | 2017-10-01 |
| URL | https://www.aclweb.org/anthology/W17-6624/ |
| https://www.aclweb.org/anthology/W17-6624 | |
| PWC | https://paperswithcode.com/paper/descriaao-e-modelagem-de-construaaes |
| Repo | |
| Framework | |
Sparse convolutional coding for neuronal assembly detection
| Title | Sparse convolutional coding for neuronal assembly detection |
| Authors | Sven Peter, Elke Kirschbaum, Martin Both, Lee Campbell, Brandon Harvey, Conor Heins, Daniel Durstewitz, Ferran Diego, Fred A. Hamprecht |
| Abstract | Cell assemblies, originally proposed by Donald Hebb (1949), are subsets of neurons firing in a temporally coordinated way that gives rise to repeated motifs supposed to underly neural representations and information processing. Although Hebb’s original proposal dates back many decades, the detection of assemblies and their role in coding is still an open and current research topic, partly because simultaneous recordings from large populations of neurons became feasible only relatively recently. Most current and easy-to-apply computational techniques focus on the identification of strictly synchronously spiking neurons. In this paper we propose a new algorithm, based on sparse convolutional coding, for detecting recurrent motifs of arbitrary structure up to a given length. Testing of our algorithm on synthetically generated datasets shows that it outperforms established methods and accurately identifies the temporal structure of embedded assemblies, even when these contain overlapping neurons or when strong background noise is present. Moreover, exploratory analysis of experimental datasets from hippocampal slices and cortical neuron cultures have provided promising results. |
| Tasks | |
| Published | 2017-12-01 |
| URL | http://papers.nips.cc/paper/6958-sparse-convolutional-coding-for-neuronal-assembly-detection |
| http://papers.nips.cc/paper/6958-sparse-convolutional-coding-for-neuronal-assembly-detection.pdf | |
| PWC | https://paperswithcode.com/paper/sparse-convolutional-coding-for-neuronal |
| Repo | |
| Framework | |
Universal Dependencies for Dargwa Mehweb
| Title | Universal Dependencies for Dargwa Mehweb |
| Authors | Alex Kozhukhar, ra |
| Abstract | |
| Tasks | |
| Published | 2017-09-01 |
| URL | https://www.aclweb.org/anthology/W17-6512/ |
| https://www.aclweb.org/anthology/W17-6512 | |
| PWC | https://paperswithcode.com/paper/universal-dependencies-for-dargwa-mehweb |
| Repo | |
| Framework | |
