Total Articles: 38870

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19858

AbstractWe present a new tree based approach to composing expressive image descriptions that makes use of naturally occuring web images with captions. We investigate two related tasks: image caption generalization and generation, where the former is an optional subtask of the latter. The high-level idea of our approach is to …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19859

AbstractWe show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming; the other is a supermodular quadratic pseudo-Boolean maximization problem, which can be solved in …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19860

AbstractCurrent supervised parsers are limited by the size of their labelled training data, making improving them with unlabelled data an important goal. We show how a state-of-the-art CCG parser can be enhanced, by predicting lexical categories using unsupervised vector-space embeddings of words. The use of word embeddings enables our model …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19861

AbstractPerson-to-person evaluations are prevalent in all kinds of discourse and important for establishing reputations, building social bonds, and shaping public opinion. Such evaluations can be analyzed separately using signed social networks and textual sentiment analysis, but this misses the rich interactions between language and social context. To capture such interactions, …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19862

AbstractWe present a method for discovering abstract event classes in biographies, based on a probabilistic latent-variable model. Taking as input timestamped text, we exploit latent correlations among events to learn a set of event classes (such as Born, Graduates High School, and Becomes Citizen), along with the typical times in …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19863

AbstractMicroblogs present an excellent opportunity for monitoring and analyzing world happenings. Given that words are often ambiguous, entity linking becomes a crucial step towards understanding microblogs. In this paper, we re-examine the problem of entity linking on microblogs. We first observe that spatiotemporal (i.e., spatial and temporal) signals play a …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19864

AbstractSyntax-based distributional models of lexical semantics provide a flexible and linguistically adequate representation of co-occurrence information. However, their construction requires large, accurately parsed corpora, which are unavailable for most languages. In this paper, we develop a number of methods to overcome this obstacle. We describe (a) a crosslingual approach that …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19865

AbstractWe present MultiP (Multi-instance Learning Paraphrase Model), a new model suited to identify paraphrases within the short messages on Twitter. We jointly model paraphrase relations between word and sentence pairs and assume only sentence-level annotations during learning. Using this principled latent variable model alone, we achieve the performance competitive with …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19866

AbstractEntity Linking (EL) and Word Sense Disambiguation (WSD) both address the lexical ambiguity of language. But while the two tasks are pretty similar, they differ in a fundamental respect: in EL the textual mention can be linked to a named entity which may or may not contain the exact mention, …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19867

AbstractWe present a simple, easy-to-replicate monolingual aligner that demonstrates state-of-the-art performance while relying on almost no supervision and a very small number of external resources. Based on the hypothesis that words with similar meanings represent potential pairs for alignment if located in similar contexts, we propose a system that operates …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19868

AbstractMulti-modal models that learn semantic representations from both linguistic and perceptual input outperform language-only models on a range of evaluations, and better reflect human concept acquisition. Most perceptual input to such models corresponds to concrete noun concepts and the superiority of the multi-modal approach has only been established when evaluating …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19869

AbstractStandard agreement measures for interannotator reliability are neither necessary nor sufficient to ensure a high quality corpus. In a case study of word sense annotation, conventional methods for evaluating labels from trained annotators are contrasted with a probabilistic annotation model applied to crowdsourced data. The annotation model provides far more …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19870

AbstractPrevious work on Recursive Neural Networks (RNNs) shows that these models can produce compositional feature vectors for accurately representing and classifying sentences or images. However, the sentence vectors of previous models cannot accurately represent visually grounded meaning. We introduce the DT-RNN model which uses dependency trees to embed sentences into …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19871

AbstractWe present a novel representation, evaluation measure, and supervised models for the task of identifying the multiword expressions (MWEs) in a sentence, resulting in a lexical semantic segmentation. Our approach generalizes a standard chunking representation to encode MWEs containing gaps, thereby enabling efficient sequence tagging algorithms for feature-rich discriminative models. …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19872

AbstractWe present a probabilistic language model that captures temporal dynamics and conditions on arbitrary non-linguistic context features. These context features serve as important indicators of language changes that are otherwise difficult to capture using text data by itself. We learn our model in an efficient online fashion that is scalable …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19873

AbstractIn this paper, we study the problem of manually correcting automatic annotations of natural language in as efficient a manner as possible. We introduce a method for automatically segmenting a corpus into chunks such that many uncertain labels are grouped into the same chunk, while human supervision can be omitted …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19874

AbstractExtracting instances of sentiment-oriented relations from user-generated web documents is important for online marketing analysis. Unlike previous work, we formulate this extraction task as a structured prediction problem and design the corresponding inference as an integer linear program. Our latent structural SVM based model can learn from training corpora that …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19875

AbstractThis article discusses the requirements of a formal specification for the annotation of temporal information in clinical narratives. We discuss the implementation and extension of ISO-TimeML for annotating a corpus of clinical notes, known as the THYME corpus. To reflect the information task and the heavily inference-based reasoning demands in …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19876

AbstractStress has long been established as a major cue in word segmentation for English infants. We show that enabling a current state-of-the-art Bayesian word segmentation model to take advantage of stress cues noticeably improves its performance. We find that the improvements range from 10 to 4%, depending on both the …...

nan

Publication: TIPSTER (2014)

DOI: nan

Paper ID: 19877

AbstractWe propose a new method for unsupervised tagging that finds minimal models which are then further improved by Expectation Maximization training. In contrast to previous approaches that rely on manually specified and multi-step heuristics for model minimization, our approach is a simple greedy approximation algorithm DMLC (Distributed-Minimum-Label-Cover) that solves this …...