Total Articles: 38870

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33086

AbstractThis paper proposes to address the word sense ambiguity issue in an unsupervised manner, where word sense representations are learned along a word sense selection mechanism given contexts. Prior work focused on designing a single model to deliver both mechanisms, and thus suffered from either coarse-grained representation learning or inefficient …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33087

AbstractWord embeddings seek to recover a Euclidean metric space by mapping words into vectors, starting from words co-occurrences in a corpus. Word embeddings may underestimate the similarity between nearby words, and overestimate it between distant words in the Euclidean metric space. In this paper, we re-embed pre-trained word embeddings with …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33088

AbstractMany Natural Language Processing (NLP) models rely on distributed vector representations of words. Because the process of training word vectors can require large amounts of data and computation, NLP researchers and practitioners often utilize pre-trained embeddings downloaded from the Web. However, finding the best embeddings for a given task is …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33089

AbstractIn this paper, we propose to learn word embeddings based on the recent fixed-size ordinally forgetting encoding (FOFE) method, which can almost uniquely encode any variable-length sequence into a fixed-size representation. We use FOFE to fully encode the left and right context of each word in a corpus to construct …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33090

AbstractDistributional semantics models are known to struggle with small data. It is generally accepted that in order to learn ‘a good vector’ for a word, a model must have sufficient examples of its usage. This contradicts the fact that humans can guess the meaning of a word from a few …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33091

AbstractWe introduce a novel mixed characterword architecture to improve Chinese sentence representations, by utilizing rich semantic information of word internal structures. Our architecture uses two key strategies. The first is a mask gate on characters, learning the relation among characters in a word. The second is a maxpooling operation on …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33092

AbstractWe present an unsupervised, language agnostic approach for exploiting morphological regularities present in high dimensional vector spaces. We propose a novel method for generating embeddings of words from their morphological variants using morphological transformation operators. We evaluate this approach on MSR word analogy test set with an accuracy of 85% …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33093

AbstractWord embeddings have attracted much attention recently. Different from alphabetic writing systems, Chinese characters are often composed of subcharacter components which are also semantically informative. In this work, we propose an approach to jointly embed Chinese words as well as their characters and fine-grained subcharacter components. We use three likelihoods …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33094

AbstractWe consider the problem of learning general-purpose, paraphrastic sentence embeddings in the setting of Wieting et al. (2016b). We use neural machine translation to generate sentential paraphrases via back-translation of bilingual sentence pairs. We evaluate the paraphrase pairs by their ability to serve as training data for learning paraphrastic sentence …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33095

AbstractIn this paper, we propose new methods to learn Chinese word representations. Chinese characters are composed of graphical components, which carry rich semantics. It is common for a Chinese learner to comprehend the meaning of a word from these graphical components. As a result, we propose models that enhance word …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33096

AbstractLearning word embeddings on large unlabeled corpus has been shown to be successful in improving many natural language tasks. The most efficient and popular approaches learn or retrofit such representations using additional external data. Resulting embeddings are generally better than their corpus-only counterparts, although such resources cover a fraction of …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33097

AbstractThe existing word representation methods mostly limit their information source to word co-occurrence statistics. In this paper, we introduce ngrams into four representation methods: SGNS, GloVe, PPMI matrix, and its SVD factorization. Comprehensive experiments are conducted on word analogy and similarity tasks. The results show that improved word representations are …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33098

AbstractWe present a novel neural model HyperVec to learn hierarchical embeddings for hypernymy detection and directionality. While previous embeddings have shown limitations on prototypical hypernyms, HyperVec represents an unsupervised measure where embeddings are learned in a specific order and capture the hypernym–hyponym distributional hierarchy. Moreover, our model is able to …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33099

AbstractResolving abstract anaphora is an important, but difficult task for text understanding. Yet, with recent advances in representation learning this task becomes a more tangible aim. A central property of abstract anaphora is that it establishes a relation between the anaphor embedded in the anaphoric sentence and its (typically non-nominal) …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33100

AbstractMulti-document summarization provides users with a short text that summarizes the information in a set of related documents. This paper introduces affinity-preserving random walk to the summarization task, which preserves the affinity relations of sentences by an absorbing random walk model. Meanwhile, we put forward adjustable affinity-preserving random walk to …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33101

AbstractDiscourse coherence is strongly associated with text quality, making it important to natural language generation and understanding. Yet existing models of coherence focus on measuring individual aspects of coherence (lexical overlap, rhetorical structure, entity centering) in narrow domains. In this paper, we describe domain-independent neural models of discourse coherence that …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33102

AbstractWe introduce the first end-to-end coreference resolution model and show that it significantly outperforms all previous work without using a syntactic parser or hand-engineered mention detector. The key idea is to directly consider all spans in a document as potential mentions and learn distributions over possible antecedents for each. The …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33103

AbstractGenerating captions for images is a task that has recently received considerable attention. Another type of visual inputs are abstract scenes or object layouts where the only information provided is a set of objects and their locations. This type of imagery is commonly found in many applications in computer graphics, …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33104

AbstractWe present a model for locating regions in space based on natural language descriptions. Starting with a 3D scene and a sentence, our model is able to associate words in the sentence with regions in the scene, interpret relations such as ‘on top of’ or ‘next to,’ and finally locate …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 33105

AbstractWe propose a novel decoding approach for neural machine translation (NMT) based on continuous optimisation. We reformulate decoding, a discrete optimization problem, into a continuous problem, such that optimization can make use of efficient gradient-based techniques. Our powerful decoding framework allows for more accurate decoding for standard neural machine translation …...