Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37036

AbstractIn this paper, we attempt to answer the question of whether neural network models can learn numeracy, which is the ability to predict the magnitude of a numeral at some specific position in a text description. A large benchmark dataset, called Numeracy-600K, is provided for the novel task. We explore …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37037

AbstractThe PAN series of shared tasks is well known for its continuous and high quality research in the field of digital text forensics. Among others, PAN contributions include original corpora, tailored benchmarks, and standardized experimentation platforms. In this paper we review, theoretically and practically, the authorship verification task and conclude …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37038

AbstractIdentifying the relationship between two articles, e.g., whether two articles published from different sources describe the same breaking news, is critical to many document understanding tasks. Existing approaches for modeling and matching sentence pairs do not perform well in matching longer documents, which embody more complex interactions between the enclosed …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37039

AbstractFeature attribution methods, proposed recently, help users interpret the predictions of complex models. Our approach integrates feature attributions into the objective function to allow machine learning practitioners to incorporate priors in model building. To demonstrate the effectiveness our technique, we apply it to two tasks: (1) mitigating unintended bias in …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37040

AbstractAutomatic summarization is typically treated as a 1-to-1 mapping from document to summary. Documents such as news articles, however, are structured and often cover multiple topics or aspects; and readers may be interested in only some of them. We tackle the task of aspect-based summarization, where, given a document and …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37041

AbstractMulti-Label Hierarchical Text Classification (MLHTC) is the task of categorizing documents into one or more topics organized in an hierarchical taxonomy. MLHTC can be formulated by combining multiple binary classification problems with an independent classifier for each category. We propose a novel transfer learning based strategy, HTrans, where binary classifiers …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37042

AbstractWe introduce a novel semantic parsing task based on Discourse Representation Theory (DRT; Kamp and Reyle 1993). Our model operates over Discourse Representation Tree Structures which we formally define for sentences and documents. We present a general framework for parsing discourse structures of arbitrary length and granularity. We achieve this …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37043

AbstractSingle document summarization has enjoyed renewed interest in recent years thanks to the popularity of neural network models and the availability of large-scale datasets. In this paper we develop an unsupervised approach arguing that it is unrealistic to expect large-scale and high-quality training data to be available or created for …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37044

AbstractWe present a fully automated workflow for phylogenetic reconstruction on large datasets, consisting of two novel methods, one for fast detection of cognates and one for fast Bayesian phylogenetic inference. Our results show that the methods take less than a few minutes to process language families that have so far …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37045

AbstractGraphics Processing Units (GPUs) are commonly used to train and evaluate neural networks efficiently. While previous work in deep learning has focused on accelerating operations on dense matrices/tensors on GPUs, efforts have concentrated on operations involving sparse data structures. Operations using sparse structures are common in natural language models at …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37046

AbstractMultilingual individuals code switch between languages as a part of a complex communication process. However, most computational studies have examined only one or a handful of contextual factors predictive of switching. Here, we examine Naija-English code switching in a rich contextual environment to understand the social and topical factors eliciting …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37047

AbstractIn this work, we present novel approaches to exploit sentential context for neural machine translation (NMT). Specifically, we show that a shallow sentential context extracted from the top encoder layer only, can improve translation performance via contextualizing the encoding representations of individual words. Next, we introduce a deep sentential context, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37048

AbstractWhile neural machine translation (NMT) has achieved remarkable success, NMT systems are prone to make word omission errors. In this work, we propose a contrastive learning approach to reducing word omission errors in NMT. The basic idea is to enable the NMT model to assign a higher probability to a …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37049

AbstractConversational machine reading comprehension (CMRC) extends traditional single-turn machine reading comprehension (MRC) by multi-turn interactions, which requires machines to consider the history of conversation. Most of models simply combine previous questions for conversation understanding and only employ recurrent neural networks (RNN) for reasoning. To comprehend context profoundly and efficiently from …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37050

AbstractAlthough current evaluation of question-answering systems treats predictions in isolation, we need to consider the relationship between predictions to measure true understanding. A model should be penalized for answering “no” to “Is the rose red?” if it answers “red” to “What color is the rose?”. We propose a method to …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37051

AbstractSeveral deep learning models have been proposed for solving math word problems (MWPs) automatically. Although these models have the ability to capture features without manual efforts, their approaches to capturing features are not specifically designed for MWPs. To utilize the merits of deep learning models with simultaneous consideration of MWPs’ …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37052

AbstractRule-based models are attractive for various tasks because they inherently lead to interpretable and explainable decisions and can easily incorporate prior knowledge. However, such systems are difficult to apply to problems involving natural language, due to its large linguistic variability. In contrast, neural models can cope very well with ambiguity …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37053

AbstractText-based question answering (TBQA) has been studied extensively in recent years. Most existing approaches focus on finding the answer to a question within a single paragraph. However, many difficult questions require multiple supporting evidence from scattered text among two or more documents. In this paper, we propose Dynamically Fused Graph …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37054

AbstractRelation detection is a core step in many natural language process applications including knowledge base question answering. Previous efforts show that single-fact questions could be answered with high accuracy. However, one critical problem is that current approaches only get high accuracy for questions whose relations have been seen in the …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 37055

AbstractOpen book question answering is a type of natural language based QA (NLQA) where questions are expected to be answered with respect to a given set of open book facts, and common knowledge about a topic. Recently a challenge involving such QA, OpenBookQA, has been proposed. Unlike most other NLQA …...