Titlebook: Natural Language Processing and Chinese Computing; 7th CCF Internationa Min Zhang,Vincent Ng,Hongying Zan Conference proceedings 2018 Sprin

無目標(biāo)

Suggestions

壯觀的游行

神秘

From Plots to Endings: A Reinforced Pointer Generator for Story Ending Generatione a framework consisting of a Generator and a Reward Manager for this task. The Generator follows the pointer-generator network with coverage mechanism to deal with out-of-vocabulary (OOV) and repetitive words. Moreover, a mixed loss method is introduced to enable the Generator to produce story endi

Forage飼料

A3Net:Adversarial-and-Attention Network for Machine Reading Comprehensionwo perspectives. First, adversarial training is applied to several target variables within the model, rather than only to the inputs or embeddings. We control the norm of adversarial perturbations according to the norm of original target variables, so that we can jointly add perturbations to several

天真

廢止

彎腰

Learning to Converse Emotionally Like Humans: A Conditional Variational Approachnt research hotspot. Although several emotional conversation approaches have been introduced, none of these methods were able to decide an appropriate emotion category for the response. We propose a new neural conversation model which is able to produce reasonable emotion interaction and generate em

Devastate

Response Selection of Multi-turn Conversation with Deep Neural Networkss, the task is to choose the most reasonable response for the context. It can be regarded as a matching problem. To address this task, we propose a deep neural model named RCMN which focus on modeling relevance consistency of conversations. In addition, we adopt one existing deep learning model whic

Fillet,Filet

Learning Dialogue History for Spoken Language Understandingesentations. SLU usually consists of two parts, namely intent identification and slot filling. Although many methods have been proposed for SLU, these methods generally process each utterance individually, which loses context information in dialogues. In this paper, we propose a hierarchical LSTM ba