Articles
Total Articles: 38870
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30447
AbstractOne of the most challenging part of recipe generation is to deal with the complex restrictions among the input ingredients. Previous researches simplify the problem by treating the inputs independently and generating recipes containing as much information as possible. In this work, we propose a routing method to dive into …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30448
AbstractSolving algebraic word problems has recently emerged as an important natural language processing task. To solve algebraic word problems, recent studies suggested neural models that generate solution equations by using ‘Op (operator/operand)’ tokens as a unit of input/output. However, such a neural model suffered two issues: expression fragmentation and operand-context …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30452
AbstractA recent state-of-the-art neural open information extraction (OpenIE) system generates extractions iteratively, requiring repeated encoding of partial outputs. This comes at a significant computational cost. On the other hand,sequence labeling approaches for OpenIE are much faster, but worse in extraction quality. In this paper, we bridge this trade-off by presenting …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30477
AbstractResearch on temporal knowledge bases, which associate a relational fact (s,r,o) with a validity time period (or time instant), is in its early days. Our work considers predicting missing entities (link prediction) and missing time intervals (time prediction) as joint Temporal Knowledge Base Completion (TKBC) tasks, and presents TIMEPLEX, a …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30478
AbstractThe idea of using multi-task learning approaches to address the joint extraction of entity and relation is motivated by the relatedness between the entity recognition task and the relation classification task. Existing methods using multi-task learning techniques to address the problem learn interactions among the two tasks through a shared …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30479
AbstractRelation extraction (RE) aims to identify the semantic relations between named entities in text. Recent years have witnessed it raised to the document level, which requires complex reasoning with entities and mentions throughout an entire document. In this paper, we propose a novel model to document-level RE, by encoding the …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30481
AbstractThe process of collecting and annotating training data may introduce distribution artifacts which may limit the ability of models to learn correct generalization behavior. We identify failure modes of SOTA relation extraction (RE) models trained on TACRED, which we attribute to limitations in the data annotation process. We collect and …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30482
AbstractDistant supervision (DS) has been widely adopted to generate auto-labeled data for sentence-level relation extraction (RE) and achieved great results. However, the existing success of DS cannot be directly transferred to more challenging document-level relation extraction (DocRE), as the inevitable noise caused by DS may be even multiplied in documents …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30483
AbstractDespite efforts to distinguish three different evaluation setups (Bekoulis et al., 2018), numerous end-to-end Relation Extraction (RE) articles present unreliable performance comparison to previous work. In this paper, we first identify several patterns of invalid comparisons in published papers and describe them to avoid their propagation. We then propose a …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30484
AbstractOpen relation extraction is the task of extracting open-domain relation facts from natural language sentences. Existing works either utilize heuristics or distant-supervised annotations to train a supervised classifier over pre-defined relations, or adopt unsupervised methods with additional assumptions that have less discriminative power. In this work, we propose a self-supervised …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30485
AbstractNeural models have achieved remarkable success on relation extraction (RE) benchmarks. However, there is no clear understanding what information in text affects existing RE models to make decisions and how to further improve the performance of these models. To this end, we empirically study the effect of two main information …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30486
AbstractAbstractive document summarization is usually modeled as a sequence-to-sequence (SEQ2SEQ) learning problem. Unfortunately, training large SEQ2SEQ based summarization models on limited supervised summarization data is challenging. This paper presents three sequence-to-sequence pre-training (in shorthand, STEP) objectives which allow us to pre-train a SEQ2SEQ based abstractive summarization model on unlabeled text. …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30487
AbstractWe consider the problem of better modeling query-cluster interactions to facilitate query focused multi-document summarization. Due to the lack of training data, existing work relies heavily on retrieval-style methods for assembling query relevant summaries. We propose a coarse-to-fine modeling framework which employs progressively more accurate modules for estimating whether text …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30488
AbstractEvaluation of a document summarization system has been a critical factor to impact the success of the summarization task. Previous approaches, such as ROUGE, mainly consider the informativeness of the assessed summary and require human-generated references for each test summary. In this work, we propose to evaluate the summary qualities …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30489
AbstractAspect-based sentiment analysis (ABSA) aims to predict the sentiment towards a specific aspect in the text. However, existing ABSA test sets cannot be used to probe whether a model can distinguish the sentiment of the target aspect from the non-target aspects. To solve this problem, we develop a simple but …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30490
AbstractModeling content importance is an essential yet challenging task for summarization. Previous work is mostly based on statistical methods that estimate word-level salience, which does not consider semantics and larger context when quantifying importance. It is thus hard for these methods to generalize to semantic units of longer text spans. …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30491
AbstractAs an important research issue in the natural language processing community, multi-label emotion detection has been drawing more and more attention in the last few years. However, almost all existing studies focus on one modality (e.g., textual modality). In this paper, we focus on multi-label emotion detection in a multi-modal …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30492
AbstractEmotion-cause pair extraction (ECPE) is a new task that aims to extract the potential pairs of emotions and their corresponding causes in a document. The existing methods first perform emotion extraction and cause extraction independently, and then perform emotion-cause pairing and filtering. However, the above methods ignore the fact that …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30493
AbstractAspect based sentiment analysis, predicting sentiment polarity of given aspects, has drawn extensive attention. Previous attention-based models emphasize using aspect semantics to help extract opinion features for classification. However, these works are either not able to capture opinion spans as a whole, or not able to capture variable-length opinion spans. …...
nan
Publication: TIPSTER (2020)
DOI: nan
Paper ID: 30494
AbstractThe task of emotion-cause pair extraction deals with finding all emotions and the corresponding causes in unannotated emotion texts. Most recent studies are based on the likelihood of Cartesian product among all clause candidates, resulting in a high computational cost. Targeting this issue, we regard the task as a sequence …...