Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39954

AbstractRecent research has achieved impressive results in single-turn dialogue modelling. In the multi-turn setting, however, current models are still far from satisfactory. One major challenge is the frequently occurred coreference and information omission in our daily conversation, making it hard for machines to understand the real intention. In this paper, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39955

AbstractDocument Grounded Conversations is a task to generate dialogue responses when chatting about the content of a given document. Obviously, document knowledge plays a critical role in Document Grounded Conversations, while existing dialogue models do not exploit this kind of knowledge effectively enough. In this paper, we propose a novel …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39956

AbstractCurrently, researchers have paid great attention to retrieval-based dialogues in open-domain. In particular, people study the problem by investigating context-response matching for multi-turn response selection based on publicly recognized benchmark data sets. State-of-the-art methods require a response to interact with each utterance in a context from the beginning, but the …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39960

AbstractNeural models have become one of the most important approaches to dialog response generation. However, they still tend to generate the most common and generic responses in the corpus all the time. To address this problem, we designed an iterative training process and ensemble method based on boosting. We combined …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39376

AbstractIn this paper we frame the task of supervised relation classification as an instance of meta-learning. We propose a model-agnostic meta-learning protocol for training relation classifiers to achieve enhanced predictive performance in limited supervision settings. During training, we aim to not only learn good parameters for classifying relations with sufficient …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39377

AbstractWe introduce VAMPIRE, a lightweight pretraining framework for effective text classification when data and computing resources are limited. We pretrain a unigram document model as a variational autoencoder on in-domain, unlabeled data and use its internal states as features in a downstream classifier. Empirically, we show the relative strength of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39378

AbstractThis paper studies automatic keyphrase extraction on social media. Previous works have achieved promising results on it, but they neglect human reading behavior during keyphrase annotating. The human attention is a crucial element of human reading behavior. It reveals the relevance of words to the main topics of the target …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39379

AbstractNamed entity recognition (NER) is the backbone of many NLP solutions. F1 score, the harmonic mean of precision and recall, is often used to select/evaluate the best models. However, when precision needs to be prioritized over recall, a state-of-the-art model might not be the best choice. There is little in …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39380

AbstractEntity resolution (ER) is the task of identifying different representations of the same real-world entities across databases. It is a key step for knowledge base creation and text mining. Recent adaptation of deep learning methods for ER mitigates the need for dataset-specific feature engineering by constructing distributed representations of entity …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39381

AbstractNamed entity recognition (NER) is one of the best studied tasks in natural language processing. However, most approaches are not capable of handling nested structures which are common in many applications. In this paper we introduce a novel neural network architecture that first merges tokens and/or entities into entities forming …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39382

AbstractDe-identification is the task of detecting protected health information (PHI) in medical text. It is a critical step in sanitizing electronic health records (EHR) to be shared for research. Automatic de-identification classifiers can significantly speed up the sanitization process. However, obtaining a large and diverse dataset to train such a …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39383

AbstractSimultaneous translation is widely useful but remains one of the most difficult tasks in NLP. Previous work either uses fixed-latency policies, or train a complicated two-staged model using reinforcement learning. We propose a much simpler single model that adds a “delay” token to the target vocabulary, and design a restricted …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39384

AbstractUnseen words, also called out-of-vocabulary words (OOVs), are difficult for machine translation. In neural machine translation, byte-pair encoding can be used to represent OOVs, but they are still often incorrectly translated. We improve the translation of OOVs in NMT using easy-to-obtain monolingual data. We look for OOVs in the text …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39385

AbstractMulti-head self-attention is a key component of the Transformer, a state-of-the-art architecture for neural machine translation. In this work we evaluate the contribution made by individual attention heads to the overall performance of the model and analyze the roles played by them in the encoder. We find that the most …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39386

AbstractLow-resource language pairs with a paucity of parallel data pose challenges for machine translation in terms of both adequacy and fluency. Data augmentation utilizing a large amount of monolingual data is regarded as an effective way to alleviate the problem. In this paper, we propose a general framework of data …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39387

AbstractThis paper proposes Confusionset-guided Pointer Networks for Chinese Spell Check (CSC) task. More concretely, our approach utilizes the off-the-shelf confusionset for guiding the character generation. To this end, our novel Seq2Seq model jointly learns to copy a correct character from an input sentence through a pointer network, or generate a …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39388

AbstractIn this paper we discuss the usefulness of applying a checking procedure to existing thesauri. The procedure is based on the analysis of discrepancies of corpus-based and thesaurus-based word similarities. We applied the procedure to more than 30 thousand words of the Russian wordnet and found some serious errors in …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39389

AbstractLexical relation classification is the task of predicting whether a certain relation holds between a given pair of words. In this paper, we explore to which extent the current distributional landscape based on word embeddings provides a suitable basis for classification of collocations, i.e., pairs of words between which idiosyncratic …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39390

AbstractWord embeddings typically represent different meanings of a word in a single conflated vector. Empirical analysis of embeddings of ambiguous words is currently limited by the small size of manually annotated resources and by the fact that word senses are treated as unrelated individual concepts. We present a large dataset …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39391

AbstractThe inability to quantify key aspects of creative language is a frequent obstacle to natural language understanding. To address this, we introduce novel tasks for evaluating the creativeness of language—namely, scoring and ranking text by humorousness and metaphor novelty. To sidestep the difficulty of assigning discrete labels or numeric scores, …...