Total Articles: 38870

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4123

AbstractOver 97 million inhabitants speak Vietnamese as the native language in the world. However, there are few research studies on machine reading comprehension (MRC) in Vietnamese, the task of understanding a document or text, and answering questions related to it. Due to the lack of benchmark datasets for Vietnamese, we …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4124

AbstractIn order to facilitate natural language understanding, the key is to engage commonsense or background knowledge. However, how to engage commonsense effectively in question answering systems is still under exploration in both research academia and industry. In this paper, we propose a novel question-answering method by integrating multiple knowledge sources, …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4125

AbstractThe structural information of Knowledge Bases (KBs) has proven effective to Question Answering (QA). Previous studies rely on deep graph neural networks (GNNs) to capture rich structural information, which may not model node relations in particularly long distance due to oversmoothing issue. To address this challenge, we propose a novel …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4126

AbstractThe interaction of conversational systems with users poses an exciting opportunity for improving them after deployment, but little evidence has been provided of its feasibility. In most applications, users are not able to provide the correct answer to the system, but they are able to provide binary (correct, incorrect) feedback. …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4127

AbstractWe introduce CHIME, a cross-passage hierarchical memory network for question answering (QA) via text generation. It extends XLNet introducing an auxiliary memory module consisting of two components: the context memory collecting cross-passage evidences, and the answer memory working as a buffer continually refining the generated answers. Empirically, we show the …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4128

AbstractWeakly supervised machine reading comprehension (MRC) task is practical and promising for its easily available and massive training data, but inevitablely introduces noise. Existing related methods usually incorporate extra submodels to help filter noise before the noisy data is input to main models. However, these multistage methods often make training …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4129

AbstractRecent question generation (QG) approaches often utilize the sequence-to-sequence framework (Seq2Seq) to optimize the log likelihood of ground-truth questions using teacher forcing. However, this training objective is inconsistent with actual question quality, which is often reflected by certain global properties such as whether the question can be answered by the …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4130

AbstractSyntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Despite its difficulty, unsupervised parsing is an interesting research direction because of its capability of utilizing almost unlimited unannotated …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4131

AbstractSemantic parsing is the task of translating natural language utterances into machine-readable meaning representations. Currently, most semantic parsing methods are not able to utilize the contextual information (e.g. dialogue and comments history), which has a great potential to boost the semantic parsing systems. To address this issue, context dependent semantic …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4132

AbstractIn this paper we present a parsing model for projective dependency trees which takes advantage of the existence of complementary dependency annotations which is the case in Arabic, with the availability of CATiB and UD treebanks. Our system performs syntactic parsing according to both annotation types jointly as a sequence …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4133

AbstractMannual annotation for dependency parsing is both labourious and time costly, resulting in the difficulty to learn practical dependency parsers for many languages due to the lack of labelled training corpora. To compensate for the scarcity of labelled data, semi-supervised dependency parsing methods are developed to utilize unlabelled data in …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4134

AbstractCommonsenseQA is a task in which a correct answer is predicted through commonsense reasoning with pre-defined knowledge. Most previous works have aimed to improve the performance with distributed representation without considering the process of predicting the answer from the semantic representation of the question. To shed light upon the semantic …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4135

AbstractAutomatically describing videos in natural language is an ambitious problem, which could bridge our understanding of vision and language. We propose a hierarchical approach, by first generating video descriptions as sequences of simple sentences, followed at the next level by a more complex and fluent description in natural language. While …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4136

AbstractQuestion answering over dialogue, a specialized machine reading comprehension task, aims to comprehend a dialogue and to answer specific questions. Despite many advances, existing approaches for this task did not consider dialogue structure and background knowledge (e.g., relationships between speakers). In this paper, we introduce a new approach for the …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4137

AbstractEnd-to-end neural data-to-text (D2T) generation has recently emerged as an alternative to pipeline-based architectures. However, it has faced challenges generalizing to new domains and generating semantically consistent text. In this work, we present DataTuner, a neural, end-to-end data-to-text generation system that makes minimal assumptions about the data representation and target …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4138

AbstractData collection for the knowledge graph-to-text generation is expensive. As a result, research on unsupervised models has emerged as an active field recently. However, most unsupervised models have to use non-parallel versions of existing small supervised datasets, which largely constrain their potential. In this paper, we propose a large-scale, general-domain …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4139

AbstractThe Variational Autoencoder (VAE) is a popular and powerful model applied to text modelling to generate diverse sentences. However, an issue known as posterior collapse (or KL loss vanishing) happens when the VAE is used in text modelling, where the approximate posterior collapses to the prior, and the model will …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4140

AbstractRecently, many KB-to-text generation tasks have been proposed to bridge the gap between knowledge bases and natural language by directly converting a group of knowledge base triples into human-readable sentences. However, most of the existing models suffer from the off-topic problem, namely, the models are prone to generate some unrelated …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4141

AbstractSentiment forecasting in dialog aims to predict the polarity of next utterance to come, and can help speakers revise their utterances in sentimental utterances generation. However, the polarity of next utterance is normally hard to predict, due to the lack of content of next utterance (yet to come). In this …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 4142

AbstractWe present a bracketing-based encoding that can be used to represent any 2-planar dependency tree over a sentence of length n as a sequence of n labels, hence providing almost total coverage of crossing arcs in sequence labeling parsing. First, we show that existing bracketing encodings for parsing as labeling …...