Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39488

AbstractResearchers illustrate improvements in contextual encoding strategies via resultant performance on a battery of shared Natural Language Understanding (NLU) tasks. Many of these tasks are of a categorical prediction variety: given a conditioning context (e.g., an NLI premise), provide a label based on an associated prompt (e.g., an NLI hypothesis). …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39489

AbstractLexical entailment (LE; also known as hyponymy-hypernymy or is-a relation) is a core asymmetric lexical relation that supports tasks like taxonomy induction and text generation. In this work, we propose a simple and effective method for fine-tuning distributional word vectors for LE. Our Generalized Lexical ENtailment model (GLEN) is decoupled …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39490

AbstractThe recently introduced BERT model exhibits strong performance on several language understanding benchmarks. In this paper, we describe a simple re-implementation of BERT for commonsense reasoning. We show that the attentions produced by BERT can be directly utilized for tasks such as the Pronoun Disambiguation Problem and Winograd Schema Challenge. …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39491

AbstractSemantic parsing over multiple knowledge bases enables a parser to exploit structural similarities of programs across the multiple domains. However, the fundamental challenge lies in obtaining high-quality annotations of (utterance, program) pairs across various domains needed for training such models. To overcome this, we propose a novel framework to build …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39492

AbstractRecent work by Zellers et al. (2018) introduced a new task of commonsense natural language inference: given an event description such as “A woman sits at a piano,” a machine must select the most likely followup: “She sets her fingers on the keys.” With the introduction of BERT, near human-level …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39493

AbstractRecognizing the internal structure of events is a challenging language processing task of great importance for text understanding. We present a supervised model for automatically identifying when one event is a subevent of another. Building on prior work, we introduce several novel features, in particular discourse and narrative features, that …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39494

AbstractWe present the first comprehensive study on automatic knowledge base construction for two prevalent commonsense knowledge graphs: ATOMIC (Sap et al., 2019) and ConceptNet (Speer et al., 2017). Contrary to many conventional KBs that store knowledge with canonical templates, commonsense KBs only store loosely structured open-text descriptions of knowledge. We …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39495

AbstractWe present a latent variable model for predicting the relationship between a pair of text sequences. Unlike previous auto-encoding–based approaches that consider each sequence separately, our proposed framework utilizes both sequences within a single model by generating a sequence that has a given relationship with a source sequence. We further …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39496

AbstractThe recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN) based models generate richer …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39497

AbstractLink prediction and entailment graph induction are often treated as different problems. In this paper, we show that these two problems are actually complementary. We train a link prediction model on a knowledge graph of assertions extracted from raw text. We propose an entailment score that exploits the new facts …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39498

AbstractWe present a monolingual alignment system for long, sentence- or clause-level alignments, and demonstrate that systems designed for word- or short phrase-based alignment are ill-suited for these longer alignments. Our system is capable of aligning semantically similar spans of arbitrary length. We achieve significantly higher recall on aligning phrases of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39499

AbstractIn this paper, we present a fast and strong neural approach for general purpose text matching applications. We explore what is sufficient to build a fast and well-performed text matching model and propose to keep three key features available for inter-sequence alignment: original point-wise features, previous aligned features, and contextual …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39500

AbstractFor several natural language processing (NLP) tasks, span representation design is attracting considerable attention as a promising new technique; a common basis for an effective design has been established. With such basis, exploring task-dependent extensions for argumentation structure parsing (ASP) becomes an interesting research direction. This study investigates (i) span …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39501

AbstractAttention-based neural models were employed to detect the different aspects and sentiment polarities of the same target in targeted aspect-based sentiment analysis (TABSA). However, existing methods do not specifically pre-train reasonable embeddings for targets and aspects in TABSA. This may result in targets or aspects having the same vector representations …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39502

AbstractPolitical debates offer a rare opportunity for citizens to compare the candidates’ positions on the most controversial topics of the campaign. Thus they represent a natural application scenario for Argument Mining. As existing research lacks solid empirical investigation of the typology of argument components in political debates, we fill this …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39503

AbstractIn sentiment detection, the natural language processing community has focused on determining holders, facets, and valences, but has paid little attention to the reasons for sentiment decisions. Our work considers human motives as the driver for human sentiments and addresses the problem of motive detection as the first step. Following …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39504

AbstractWe identify agreement and disagreement between utterances that express stances towards a topic of discussion. Existing methods focus mainly on conversational settings, where dialogic features are used for (dis)agreement inference. We extend this scope and seek to detect stance (dis)agreement in a broader setting, where independent stance-bearing utterances, which prevail …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39505

AbstractText classification approaches have usually required task-specific model architectures and huge labeled datasets. Recently, thanks to the rise of text-based transfer learning techniques, it is possible to pre-train a language model in an unsupervised manner and leverage them to perform effective on downstream tasks. In this work we focus on …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39506

AbstractWe are surprised to find that BERT’s peak performance of 77% on the Argument Reasoning Comprehension Task reaches just three points below the average untrained human baseline. However, we show that this result is entirely accounted for by exploitation of spurious statistical cues in the dataset. We analyze the nature …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39507

AbstractNeural models have been investigated for sentiment classification over constituent trees. They learn phrase composition automatically by encoding tree structures but do not explicitly model sentiment composition, which requires to encode sentiment class labels. To this end, we investigate two formalisms with deep sentiment representations that capture sentiment subtype expressions …...