Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39392

AbstractThe purpose of the research is to answer the question whether linguistic information is retained in vector representations of sentences. We introduce a method of analysing the content of sentence embeddings based on universal probing tasks, along with the classification datasets for two contrasting languages. We perform a series of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39393

AbstractWe present an unsupervised method to generate Word2Sense word embeddings that are interpretable — each dimension of the embedding space corresponds to a fine-grained sense, and the non-negative value of the embedding along the j-th dimension represents the relevance of the j-th sense to the word. The underlying LDA-based generative …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39394

AbstractSemantic compositionality (SC) refers to the phenomenon that the meaning of a complex linguistic unit can be composed of the meanings of its constituents. Most related works focus on using complicated compositionality functions to model SC while few works consider external knowledge in models. In this paper, we verify the …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39395

AbstractWord Sense Disambiguation (WSD) is a long-standing but open problem in Natural Language Processing (NLP). WSD corpora are typically small in size, owing to an expensive annotation process. Current supervised WSD methods treat senses as discrete labels and also resort to predicting the Most-Frequent-Sense (MFS) for words unseen during training. …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39396

AbstractContextual embeddings represent a new generation of semantic representations learned from Neural Language Modelling (NLM) that addresses the issue of meaning conflation hampering traditional word embeddings. In this work, we show that contextual embeddings can be used to achieve unprecedented gains in Word Sense Disambiguation (WSD) tasks. Our approach focuses …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39397

AbstractCurrent neural network-based conversational models lack diversity and generate boring responses to open-ended utterances. Priors such as persona, emotion, or topic provide additional information to dialog models to aid response generation, but annotating a dataset with priors is expensive and such annotations are rarely available. While previous methods for improving …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39398

AbstractMany real-world open-domain conversation applications have specific goals to achieve during open-ended chats, such as recommendation, psychotherapy, education, etc. We study the problem of imposing conversational goals on open-domain chat agents. In particular, we want a conversational system to chat naturally with human and proactively guide the conversation to a …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39399

AbstractWe introduce a general method for the interpretation and comparison of neural models. The method is used to factor a complex neural model into its functional components, which are comprised of sets of co-firing neurons that cut across layers of the network architecture, and which we call neural pathways. The …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39400

AbstractAutomatically analyzing dialogue can help understand and guide behavior in domains such as counseling, where interactions are largely mediated by conversation. In this paper, we study modeling behavioral codes used to asses a psychotherapy treatment style called Motivational Interviewing (MI), which is effective for addressing substance abuse and related problems. …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39401

AbstractIn this paper, we investigate the aspect of structured output modeling for the state-of-the-art graph-based neural dependency parser (Dozat and Manning, 2017). With evaluations on 14 treebanks, we empirically show that global output-structured models can generally obtain better performance, especially on the metric of sentence-level Complete Match. However, probably because …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39402

AbstractTo combat adversarial spelling mistakes, we propose placing a word recognition model in front of the downstream classifier. Our word recognition models build upon the RNN semi-character architecture, introducing several new backoff strategies for handling rare and unseen words. Trained to recognize words corrupted by random adds, drops, swaps, and …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39403

AbstractBuilding explainable systems is a critical problem in the field of Natural Language Processing (NLP), since most machine learning models provide no explanations for the predictions. Existing approaches for explainable machine learning systems tend to focus on interpreting the outputs or the connections between inputs and outputs. However, the fine-grained …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39404

AbstractWhile very deep neural networks have shown effectiveness for computer vision and text classification applications, how to increase the network depth of the neural machine translation (NMT) models for better translation quality remains a challenging problem. Directly stacking more blocks to the NMT model results in no improvement and even …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39405

AbstractEfficiently building an adversarial attacker for natural language processing (NLP) tasks is a real challenge. Firstly, as the sentence space is discrete, it is difficult to make small perturbations along the direction of gradients. Secondly, the fluency of the generated examples cannot be guaranteed. In this paper, we propose MHA, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39406

AbstractDeveloping intelligent persuasive conversational agents to change people’s opinions and actions for social good is the frontier in advancing the ethical development of automated dialogue systems. To do so, the first step is to understand the intricate organization of strategic disclosures and appeals employed in human persuasion conversations. We designed …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39407

AbstractAdversarial domain adaptation has been recently proposed as an effective technique for textual matching tasks, such as question deduplication. Here we investigate the use of gradient reversal on adversarial domain adaptation to explicitly learn both shared and unshared (domain specific) representations between two textual domains. In doing so, gradient reversal …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39408

AbstractWhile data augmentation is an important trick to boost the accuracy of deep learning methods in computer vision tasks, its study in natural language tasks is still very limited. In this paper, we present a novel data augmentation method for neural machine translation. Different from previous augmentation methods that randomly …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39635

AbstractHypernymy modeling has largely been separated according to two paradigms, pattern-based methods and distributional methods. However, recent works utilizing a mix of these strategies have yielded state-of-the-art results. This paper evaluates the contribution of both paradigms to hybrid success by evaluating the benefits of hybrid treatment of baseline models from …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39636

AbstractDue to the ubiquitous use of embeddings as input representations for a wide range of natural language tasks, imputation of embeddings for rare and unseen words is a critical problem in language processing. Embedding imputation involves learning representations for rare or unseen words during the training of an embedding model, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39637

AbstractGraph measures, such as node distances, are inefficient to compute. We explore dense vector representations as an effective way to approximate the same information. We introduce a simple yet efficient and effective approach for learning graph embeddings. Instead of directly operating on the graph structure, our method takes structural measures …...