Articles
Total Articles: 38870
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4606
AbstractSemantic Textual Similarity (STS) is a foundational NLP task and can be used in a wide range of tasks. To determine the STS of two texts, hundreds of different STS systems exist, however, for an NLP system designer, it is hard to decide which system is the best one. To …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4607
AbstractBecause of the increasing popularity of social media, much information has been shared on the internet, enabling social media users to understand various real world events. Particularly, social media-based infectious disease surveillance has attracted increasing attention. In this work, we specifically examine influenza: a common topic of communication on social …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4608
AbstractDeceptive opinion spam detection has attracted significant attention from both business and research communities. Existing approaches are based on manual discrete features, which can capture linguistic and psychological cues. However, such features fail to encode the semantic meaning of a document from the discourse perspective, which limits the performance. In …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4609
AbstractTeaching large classes remains a great challenge, primarily because it is difficult to attend to all the student needs in a timely manner. Automatic text summarization systems can be leveraged to summarize the student feedback, submitted immediately after each lecture, but it is left to be discovered what makes a …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4610
AbstractAutomatic video description generation has recently been getting attention after rapid advancement in image caption generation. Automatically generating description for a video is more challenging than for an image due to its temporal dynamics of frames. Most of the work relied on Recurrent Neural Network (RNN) and recently attentional mechanisms …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4611
AbstractGrammar induction is the task of learning syntactic structure in a setting where that structure is hidden. Grammar induction from words alone is interesting because it is similiar to the problem that a child learning a language faces. Previous work has typically assumed richer but cognitively implausible input, such as …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4612
AbstractExisting sentence regression methods for extractive summarization usually model sentence importance and redundancy in two separate processes. They first evaluate the importance f(s) of each sentence s and then select sentences to generate a summary based on both the importance scores and redundancy among sentences. In this paper, we propose …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4613
AbstractVarious treebanks have been released for dependency parsing. Despite that treebanks may belong to different languages or have different annotation schemes, they contain common syntactic knowledge that is potential to benefit each other. This paper presents a universal framework for transfer parsing across multi-typed treebanks with deep multi-task learning. We …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4614
AbstractWe present an efficient model selection method using boosting for transition-based constituency parsing. It is designed for exploring a high-dimensional search space, defined by a large set of feature templates, as for example is typically the case when parsing morphologically rich languages. Our method removes the need to manually define …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4615
AbstractWe present CATENA, a sieve-based system to perform temporal and causal relation extraction and classification from English texts, exploiting the interaction between the temporal and the causal model. We evaluate the performance of each sieve, showing that the rule-based, the machine-learned and the reasoning components all contribute to achieving state-of-the-art …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4473
AbstractSentence compression is a way to perform text simplification and is usually handled in a monolingual setting. In this paper, we study ways to extend sentence compression in a bilingual context, where the goal is to obtain parallel compressions of parallel sentences. This can be beneficial for a series of …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4474
AbstractIn Natural Language Generation (NLG), one important limitation is the lack of common benchmarks on which to train, evaluate and compare data-to-text generators. In this paper, we make one step in that direction and introduce a method for automatically creating an arbitrary large repertoire of data units that could serve …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4475
AbstractResearch in multi-document summarization has focused on newswire corpora since the early beginnings. However, the newswire genre provides genre-specific features such as sentence position which are easy to exploit in summarization systems. Such easy to exploit genre-specific features are available in other genres as well. We therefore present the new …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4476
AbstractDistant supervision is an efficient approach that automatically generates labeled data for relation extraction (RE). Traditional distantly supervised RE systems rely heavily on handcrafted features, and hence suffer from error propagation. Recently, a neural network architecture has been proposed to automatically extract features for relation classification. However, this approach follows …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4477
AbstractNowadays, neural networks play an important role in the task of relation classification. By designing different neural architectures, researchers have improved the performance to a large extent in comparison with traditional methods. However, existing neural networks for relation classification are usually of shallow architectures (e.g., one-layer convolutional neural networks or …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4478
AbstractPrevious studies on temporal relation extraction focus on mining sentence-level information or enforcing coherence on different temporal relation types among various event mentions in the same sentence or neighboring sentences, largely ignoring those discourse-level temporal relations in nonadjacent sentences. In this paper, we propose a discourse-level global inference model to …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4479
AbstractIdentifying events of a specific type is a challenging task as events in texts are described in numerous and diverse ways. Aiming to resolve high complexities of event descriptions, previous work (Huang and Riloff, 2013) proposes multi-faceted event recognition and a bootstrapping method to automatically acquire both event facet phrases …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4480
AbstractCommunity Question Answering (cQA) forums have become a popular medium for soliciting direct answers to specific questions of users from experts or other experienced users on a given topic. However, for a given question, users sometimes have to sift through a large number of low-quality or irrelevant answers to find …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4481
AbstractWe propose an approach to Named Entity Disambiguation that avoids a problem of standard work on the task (likewise affecting fully supervised, weakly supervised, or distantly supervised machine learning techniques): the treatment of name mentions referring to people with no (or very little) coverage in the textual training data is …...
nan
Publication: TIPSTER (2016)
DOI: nan
Paper ID: 4482
AbstractKnowledge graph (KG) completion adds new facts to a KG by making inferences from existing facts. Most existing methods ignore the time information and only learn from time-unknown fact triples. In dynamic environments that evolve over time, it is important and challenging for knowledge graph completion models to take into …...