Articles
Total Articles: 38870
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39548
AbstractModeling script knowledge can be useful for a wide range of NLP tasks. Current statistical script learning approaches embed the events, such that their relationships are indicated by their similarity in the embedding. While intuitive, these approaches fall short of representing nuanced relations, needed for downstream tasks. In this paper, …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39549
AbstractIn this paper, we propose a method for why-question answering (why-QA) that uses an adversarial learning framework. Existing why-QA methods retrieve “answer passages” that usually consist of several sentences. These multi-sentence passages contain not only the reason sought by a why-question and its connection to the why-question, but also redundant …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39550
AbstractThe non-indexed parts of the Internet (the Darknet) have become a haven for both legal and illegal anonymous activity. Given the magnitude of these networks, scalably monitoring their activity necessarily relies on automated tools, and notably on NLP tools. However, little is known about what characteristics texts communicated through the …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39551
AbstractWhen a speaker, Mary, asks “Do you know that Florence is packed with visitors?”, we take her to believe that Florence is packed with visitors, but not if she asks “Do you think that Florence is packed with visitors?”. Inferring speaker commitment (aka event factuality) is crucial for information extraction …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39552
AbstractIt has been shown that implicit connectives can be exploited to improve the performance of the models for implicit discourse relation recognition (IDRR). An important property of the implicit connectives is that they can be accurately mapped into the discourse relations conveying their functions. In this work, we explore this …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39553
AbstractMulti-hop reading comprehension (RC) questions are challenging because they require reading and reasoning over multiple paragraphs. We argue that it can be difficult to construct large multi-hop RC datasets. For example, even highly compositional questions can be answered with a single hop if they target specific entity types, or the …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39554
AbstractWe propose an efficient neural framework for sentence-level discourse analysis in accordance with Rhetorical Structure Theory (RST). Our framework comprises a discourse segmenter to identify the elementary discourse units (EDU) in a text, and a discourse parser that constructs a discourse tree in a top-down fashion. Both the segmenter and …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39555
AbstractThe common practice in coreference resolution is to identify and evaluate the maximum span of mentions. The use of maximum spans tangles coreference evaluation with the challenges of mention boundary detection like prepositional phrase attachment. To address this problem, minimum spans are manually annotated in smaller corpora. However, this additional …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39556
AbstractWe introduce the Scratchpad Mechanism, a novel addition to the sequence-to-sequence (seq2seq) neural network architecture and demonstrate its effectiveness in improving the overall fluency of seq2seq models for natural language generation tasks. By enabling the decoder at each time step to write to all of the encoder output layers, Scratchpad …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39557
AbstractText infilling aims at filling in the missing part of a sentence or paragraph, which has been applied to a variety of real-world natural language generation scenarios. Given a well-trained sequential generative model, it is challenging for its unidirectional decoder to generate missing symbols conditioned on the past and future …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39558
AbstractDirect comparison on point estimation of the precision (P), recall (R), and F1 measure of two natural language processing (NLP) models on a common test corpus is unreasonable and results in less replicable conclusions due to a lack of a statistical test. However, the existing t-tests in cross-validation (CV) for …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39559
AbstractLearning representations such that the source and target distributions appear as similar as possible has benefited transfer learning tasks across several applications. Generally it requires labeled data from the source and only unlabeled data from the target to learn such representations. While these representations act like a bridge to transfer …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39560
AbstractLanguage usage can change across periods of time, but document classifiers models are usually trained and tested on corpora spanning multiple years without considering temporal variations. This paper describes two complementary ways to adapt classifiers to shifts across time. First, we show that diachronic word embeddings, which were originally developed …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39561
AbstractExisting approaches for learning word embedding often assume there are sufficient occurrences for each word in the corpus, such that the representation of words can be accurately estimated from their contexts. However, in real-world scenarios, out-of-vocabulary (a.k.a. OOV) words that do not appear in training corpus emerge frequently. How to …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39562
AbstractHeuristic-based active learning (AL) methods are limited when the data distribution of the underlying learning problems vary. Recent data-driven AL policy learning methods are also restricted to learn from closely related domains. We introduce a new sample-efficient method that learns the AL policy directly on the target domain of interest …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39563
AbstractBilingual Lexicon Induction (BLI) is the task of translating words from corpora in two languages. Recent advances in BLI work by aligning the two word embedding spaces. Following that, a key step is to retrieve the nearest neighbor (NN) in the target space given the source word. However, a phenomenon …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39564
AbstractAccurate entity linkers have been produced for domains and languages where annotated data (i.e., texts linked to a knowledge base) is available. However, little progress has been made for the settings where no or very limited amounts of labeled data are present (e.g., legal or most scientific domains). In this …...
Self-Attentive, Multi-Context One-Class Classification for Unsupervised Anomaly Detection on Text
39565nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39565
AbstractThere exist few text-specific methods for unsupervised anomaly detection, and for those that do exist, none utilize pre-trained models for distributed vector representations of words. In this paper we introduce a new anomaly detection method—Context Vector Data Description (CVDD)—which builds upon word embedding models to learn multiple sentence representations that …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39566
AbstractEncoder-decoder models for unsupervised sentence representation learning using the distributional hypothesis effectively constrain the learnt representation of a sentence to only that needed to reproduce the next sentence. While the decoder is important to constrain the representation, these models tend to discard the decoder after training since only the encoder …...
nan
Publication: TIPSTER (2019)
DOI: nan
Paper ID: 39567
AbstractRecognizing coreferring events and entities across multiple texts is crucial for many NLP applications. Despite the task’s importance, research focus was given mostly to within-document entity coreference, with rather little attention to the other variants. We propose a neural architecture for cross-document coreference resolution. Inspired by Lee et al. (2012), …...