Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22160

AbstractTraditional generative dialogue models generate responses solely from input queries. Such information is insufficient for generating a specific response since a certain query could be answered in multiple ways. Recently, researchers have attempted to fill the information gap by exploiting information retrieval techniques. For a given query, similar dialogues are …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22161

AbstractDefining action spaces for conversational agents and optimizing their decision-making process with reinforcement learning is an enduring challenge. Common practice has been to use handcrafted dialog acts, or the output vocabulary, e.g. in neural encoder decoders, as the action spaces. Both have their own limitations. This paper proposes a novel …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22162

AbstractRecently, the Transformer model that is based solely on attention mechanisms, has advanced the state-of-the-art on various machine translation tasks. However, recent studies reveal that the lack of recurrence modeling hinders its further improvement of translation capacity. In response to this problem, we propose to directly model recurrence for Transformer …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22163

AbstractGeneralization and reliability of multilingual translation often highly depend on the amount of available parallel data for each language pair of interest. In this paper, we focus on zero-shot generalization—a challenging setup that tests models on translation directions they have not been optimized for at training time. To solve the …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22164

AbstractThe overreliance on large parallel corpora significantly limits the applicability of machine translation systems to the majority of language pairs. Back-translation has been dominantly used in previous approaches for unsupervised neural machine translation, where pseudo sentence pairs are generated to train the models with a reconstruction loss. However, the pseudo …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22165

AbstractCurrent state-of-the-art NMT systems use large neural networks that are not only slow to train, but also often require many heuristics and optimization tricks, such as specialized learning rate schedules and large batch sizes. This is undesirable as it requires extensive hyperparameter tuning. In this paper, we propose a curriculum …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22166

AbstractSyntax has been demonstrated highly effective in neural machine translation (NMT). Previous NMT models integrate syntax by representing 1-best tree outputs from a well-trained parsing system, e.g., the representative Tree-RNN and Tree-Linearization methods, which may suffer from error propagation. In this work, we propose a novel method to integrate source-side …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22167

AbstractTraditional language models are unable to efficiently model entity names observed in text. All but the most popular named entities appear infrequently in text providing insufficient context. Recent efforts have recognized that context can be generalized between entity names that share the same type (e.g., person or location) and have …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22168

AbstractWe introduce the deep inside-outside recursive autoencoder (DIORA), a fully-unsupervised method for discovering syntax that simultaneously learns representations for constituents within the induced tree. Our approach predicts each word in an input sentence conditioned on the rest of the sentence. During training we use dynamic programming to consider all possible …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22169

AbstractThere has been considerable attention devoted to models that learn to jointly infer an expression’s syntactic structure and its semantics. Yet, Nangia and Bowman (2018) has recently shown that the current best systems fail to learn the correct parsing strategy on mathematical expressions generated from a simple context-free grammar. In …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22170

AbstractRecurrent neural network grammars (RNNG) are generative models of language which jointly model syntax and surface structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. Supervised RNNGs achieve strong language modeling and parsing performance, but require an annotated corpus of parse trees. In this work, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22171

AbstractAlthough recent neural conversation models have shown great potential, they often generate bland and generic responses. While various approaches have been explored to diversify the output of the conversation model, the improvement often comes at the cost of decreased relevance. In this paper, we propose a SpaceFusion model to jointly …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22172

AbstractContextual word representations derived from large-scale neural language models are successful across a diverse set of NLP tasks, suggesting that they encode useful and transferable features of language. To shed light on the linguistic knowledge they capture, we study the representations produced by several recent pretrained contextualizers (variants of ELMo, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22173

AbstractRecent work has attempted to enhance vector space representations using information from structured semantic resources. This process, dubbed retrofitting (Faruqui et al., 2015), has yielded improvements in word similarity performance. Research has largely focused on the retrofitting algorithm, or on the kind of structured semantic resources used, but little research …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22174

AbstractIn traditional Distributional Semantic Models (DSMs) the multiple senses of a polysemous word are conflated into a single vector space representation. In this work, we propose a DSM that learns multiple distributional representations of a word based on different topics. First, a separate DSM is trained for each topic and …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22175

AbstractA standard word embedding algorithm, such as word2vec and glove, makes a strong assumption that words are likely to be semantically related only if they co-occur locally within a window of fixed size. However, this strong assumption may not capture the semantic association between words that co-occur frequently but non-locally …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22176

AbstractInsufficient or even unavailable training data of emerging classes is a big challenge of many classification tasks, including text classification. Recognising text documents of classes that have never been seen in the learning stage, so-called zero-shot text classification, is therefore difficult and only limited previous works tackled this problem. In …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22177

AbstractDistant supervision (DS) is an important paradigm for automatically extracting relations. It utilizes existing knowledge base to collect examples for the relation we intend to extract, and then uses these examples to automatically generate the training data. However, the examples collected can be very noisy, and pose significant challenge for …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22178

AbstractExtreme classification is a classification task on an extremely large number of labels (tags). User generated labels for any type of online data can be sparing per individual user but intractably large among all users. It would be useful to automatically select a smaller, standard set of labels to represent …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22179

AbstractModern weakly supervised methods for event detection (ED) avoid time-consuming human annotation and achieve promising results by learning from auto-labeled data. However, these methods typically rely on sophisticated pre-defined rules as well as existing instances in knowledge bases for automatic annotation and thus suffer from low coverage, topic bias, and …...