Articles
Total Articles: 38870
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42044
AbstractNeural network models have recently been applied to the task of automatic essay scoring, giving promising results. Existing work used recurrent neural networks and convolutional neural networks to model input essays, giving grades based on a single vector representation of the essay. On the other hand, the relative advantages of …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42045
AbstractConventional word embeddings are trained with specific criteria (e.g., based on language modeling or co-occurrence) inside a single information source, disregarding the opportunity for further calibration using external knowledge. This paper presents a unified framework that leverages pre-learned or external priors, in the form of a regularizer, for enhancing conventional …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42046
AbstractVector representations of word meaning have found many applications in the field of natural language processing. Word vectors intuitively represent the average context in which a given word tends to occur, but they cannot explicitly model the diversity of these contexts. Although region representations of word meaning offer a natural …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42047
AbstractRecent studies of distributional semantic models have set up a competition between word embeddings obtained from predictive neural networks and word vectors obtained from abstractive count-based models. This paper is an attempt to reveal the underlying contribution of additional training data and post-processing steps on each type of model in …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42048
AbstractWord embeddings are widely used in Natural Language Processing, mainly due to their success in capturing semantic information from massive corpora. However, their creation process does not allow the different meanings of a word to be automatically separated, as it conflates them into a single vector. We address this issue …...
Automatic Selection of Context Configurations for Improved Class-Specific Word Representations
42049nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42049
AbstractThis paper is concerned with identifying contexts useful for training word representation models for different word classes such as adjectives (A), verbs (V), and nouns (N). We introduce a simple yet effective framework for an automatic selection of class-specific context configurations. We construct a context configuration space based on universal …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42050
AbstractPairwise ranking methods are the most widely used discriminative training approaches for structure prediction problems in natural language processing (NLP). Decomposing the problem of ranking hypotheses into pairwise comparisons enables simple and efficient solutions. However, neglecting the global ordering of the hypothesis list may hinder learning. We propose a listwise …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42051
AbstractFor many applications of question answering (QA), being able to explain why a given model chose an answer is critical. However, the lack of labeled data for answer justifications makes learning this difficult and expensive. Here we propose an approach that uses answer ranking as distant supervision for learning how …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42052
AbstractWe address the task of Named Entity Disambiguation (NED) for noisy text. We present WikilinksNED, a large-scale NED dataset of text fragments from the web, which is significantly noisier and more challenging than existing news-based datasets. To capture the limited and noisy local context surrounding each mention, we design a …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42053
AbstractThis paper presents a collaborative partitioning algorithm—a novel ensemble-based approach to coreference resolution. Starting from the all-singleton partition, we search for a solution close to the ensemble’s outputs in terms of a task-specific similarity measure. Our approach assumes a loose integration of individual components of the ensemble and can therefore …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42054
AbstractMetaphor detection has been both challenging and rewarding in natural language processing applications. This study offers a new approach based on eventive information in detecting metaphors by leveraging the Chinese writing system, which is a culturally bound ontological system organized according to the basic concepts represented by radicals. As such, …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42055
AbstractRecent work has explored the syntactic abilities of RNNs using the subject-verb agreement task, which diagnoses sensitivity to sentence structure. RNNs performed this task well in common cases, but faltered in complex sentences (Linzen et al., 2016). We test whether these errors are due to inherent limitations of the architecture …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42056
AbstractLanguage acquisition can be modeled as a statistical inference problem: children use sentences and sounds in their input to infer linguistic structure. However, in many cases, children learn from data whose statistical structure is distorted relative to the language they are learning. Such distortions can arise either in the input …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42057
AbstractI explore the hypothesis that conventional neural network models (e.g., recurrent neural networks) are incorrectly biased for making linguistically sensible generalizations when learning, and that a better class of models is based on architectures that reflect hierarchical structures for which considerable behavioral evidence exists. I focus on the problem of …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42059
AbstractThis paper is concerned with building deep grammatical relation (GR) analysis using data-driven approach. To deal with this problem, we propose graph merging, a new perspective, for building flexible dependency graphs: Constructing complex graphs via constructing simple subgraphs. We discuss two key problems in this perspective: (1) how to decompose …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42067
AbstractQuestion answering (QA) systems are easily distracted by irrelevant or redundant words in questions, especially when faced with long or multi-sentence questions in difficult domains. This paper introduces and studies the notion of essential question terms with the goal of improving such QA solvers. We illustrate the importance of essential …...
The Effect of Different Writing Tasks on Linguistic Style: A Case Study of the ROC Story Cloze Task
42073nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42073
AbstractA writer’s style depends not just on personal traits but also on her intent and mental state. In this paper, we show how variants of the same writing task can lead to measurable differences in writing style. We present a case study based on the story cloze task (Mostafazadeh et …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42444
AbstractThe language that we produce reflects our personality, and various personal and demographic characteristics can be detected in natural language texts. We focus on one particular personal trait of the author, gender, and study how it is manifested in original texts and in translations. We show that author’s gender has …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42445
AbstractIn this work, we investigate several neural network architectures for fine-grained entity type classification and make three key contributions. Despite being a natural comparison and addition, previous work on attentive neural architectures have not considered hand-crafted features and we combine these with learnt features and establish that they complement each …...
nan
Publication: TIPSTER (2017)
DOI: nan
Paper ID: 42446
AbstractThis article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transition-based discontinuous parser (Maier, 2015) by a large margin (it is …...