Articles
Total Articles: 38870
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31531
AbstractWe present M2D2, a fine-grained, massively multi-domain corpus for studying domain adaptation in language models (LMs). M2D2 consists of 8.5B tokens and spans 145 domains extracted from Wikipedia and Semantic Scholar. Using ontologies derived from Wikipedia and ArXiv categories, we organize the domains in each data source into 22 groups. …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31532
AbstractThe recent success of large language models for text generation poses a severe threat to academic integrity, as plagiarists can generate realistic paraphrases indistinguishable from original work. However, the role of large autoregressive models in generating machine-paraphrased plagiarism and their detection is still incipient in the literature. This work explores …...
Entity Extraction in Low Resource Domains with Selective Pre-training of Large Language Models
31533nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31533
AbstractTransformer-based language models trained on large natural language corpora have been very useful in downstream entity extraction tasks. However, they often result in poor performances when applied to domains that are different from those they are pretrained on. Continued pretraining using unlabeled data from target domains can help improve the …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31534
AbstractThe diverse relationships among real-world events, including coreference, temporal, causal, and subevent relations, are fundamental to understanding natural languages. However, two drawbacks of existing datasets limit event relation extraction (ERE) tasks: (1) Small scale. Due to the annotation complexity, the data scale of existing datasets is limited, which cannot well …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31535
AbstractText matching is a fundamental research problem in natural language understanding. Interaction-based approaches treat the text pair as a single sequence and encode it through cross encoders, while representation-based models encode the text pair independently with siamese or dual encoders. Interaction-based models require dense computations and thus are impractical in …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31536
AbstractThe task of Cross-document Coreference Resolution has been traditionally formulated as requiring to identify all coreference links across a given set of documents. We propose an appealing, and often more applicable, complementary set up for the task – Cross-document Coreference Search, focusing in this paper on event coreference. Concretely, given …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31563
AbstractOverfitting is a notorious problem when there is insufficient data to train deep neural networks in machine learning tasks. Data augmentation regularization methods such as Dropout, Mixup, and their enhanced variants are effective and prevalent, and achieve promising performance to overcome overfitting. However, in text learning, most of the existing …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31565
AbstractRecently proposed dialogue state tracking (DST) approaches predict the dialogue state of a target turn sequentially based on the previous dialogue state. During the training time, the ground-truth previous dialogue state is utilized as the historical context. However, only the previously predicted dialogue state can be used in inference. This …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31566
AbstractExisting sentiment analysis models have achieved great advances with the help of sufficient sentiment annotations. Unfortunately, many languages do not have sufficient sentiment corpus. To this end, recent studies have proposed cross-lingual sentiment analysis to transfer sentiment analysis models from resource-rich languages to low-resource languages. However, these studies either rely …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31567
AbstractEntity Alignment (EA) aims to find equivalent entity pairs between KGs, which is the core step to bridging and integrating multi-source KGs. In this paper, we argue that existing complex EA methods inevitably inherit the inborn defects from their neural network lineage: poor interpretability and weak scalability. Inspired by recent …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31568
AbstractWe present DocInfer - a novel, end-to-end Document-level Natural Language Inference model that builds a hierarchical document graph enriched through inter-sentence relations (topical, entity-based, concept-based), performs paragraph pruning using the novel SubGraph Pooling layer, followed by optimal evidence selection based on REINFORCE algorithm to identify the most important context sentences …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31569
AbstractPrefix-tuning, or more generally continuous prompt tuning, has become an essential paradigm of parameter-efficient transfer learning. Using a large pre-trained language model (PLM), prefix-tuning can obtain strong performance by training only a small portion of parameters. In this paper, we propose to understand and further develop prefix-tuning through the kernel …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31570
AbstractReasoning over natural language is a long-standing goal for the research community. However, studies have shown that existing language models are inadequate in reasoning. To address the issue, we present POET, a novel reasoning pre-training paradigm. Through pre-training language models with programs and their execution results, POET empowers language models …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31571
AbstractEmbedding knowledge graphs (KGs) for multi-hop logical reasoning is a challenging problem due to massive and complicated structures in many KGs. Recently, many promising works projected entities and queries into a geometric space to efficiently find answers. However, it remains challenging to model the negation and union operator. The negation …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31572
AbstractCommonsense generation aims to generate a realistic sentence describing a daily scene under the given concepts, which is very challenging, since it requires models to have relational reasoning and compositional generalization capabilities. Previous work focuses on retrieving prototype sentences for the provided concepts to assist generation. They first use a …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31573
AbstractEfficient document retrieval heavily relies on the technique of semantic hashing, which learns a binary code for every document and employs Hamming distance to evaluate document distances. However, existing semantic hashing methods are mostly established on outdated TFIDF features, which obviously do not contain lots of important semantic information about …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31574
AbstractResearch in massively multilingual image captioning has been severely hampered by a lack of high-quality evaluation datasets. In this paper we present the Crossmodal-3600 dataset (XM3600 in short), a geographically diverse set of 3600 images annotated with human-generated reference captions in 36 languages. The images were selected from across the …...
ReSel: N-ary Relation Extraction from Scientific Text and Tables by Learning to Retrieve and Select
31575nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31575
AbstractWe study the problem of extracting N-ary relation tuples from scientific articles. This task is challenging because the target knowledge tuples can reside in multiple parts and modalities of the document. Our proposed method ReSel decomposes this task into a two-stage procedure that first retrieves the most relevant paragraph/table and …...
nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31576
AbstractDeciphering historical substitution ciphers is a challenging problem. Example problems that have been previously studied include detecting cipher type, detecting plaintext language, and acquiring the substitution key for segmented ciphers. However, attacking unsegmented ciphers is still a challenging task. Segmentation (i.e. finding substitution units) is essential for cracking those ciphers. …...
SEM-F1: an Automatic Way for Semantic Evaluation of Multi-Narrative Overlap Summaries at Scale
31577nan
Publication: TIPSTER (2022)
DOI: nan
Paper ID: 31577
AbstractRecent work has introduced an important yet relatively under-explored NLP task called Semantic Overlap Summarization (SOS) that entails generating a summary from multiple alternative narratives which conveys the common information provided by those narratives. Previous work also published a benchmark dataset for this task by collecting 2,925 alternative narrative pairs …...