Total Articles: 38870

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27313

Open-source analyzer dictionary development is being implemented for Skolt Sami, Ingrian, Moksha-Mordvin, etc. in the Helsinki CSC infrastructure; home of the Finnish Kielipankki ’Language Bank’ and Termipankki ’Term Bank’. The proximity of minority-language corpora in need of annotation and the multiple usage of controlled wikimedia-type dictionaries make CSC an attractive …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27231

AbstractWhile generative models such as Latent Dirichlet Allocation (LDA) have proven fruitful in topic modeling, they often require detailed assumptions and careful specification of hyperparameters. Such model complexity issues only compound when trying to generalize generative models to incorporate human input. We introduce Correlation Explanation (CorEx), an alternative approach to …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27232

AbstractWe introduce a neural method for transfer learning between two (source and target) classification tasks or aspects over the same domain. Rather than training on target labels, we use a few keywords pertaining to source and target aspects indicating sentence relevance instead of document class labels. Documents are encoded by …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27233

AbstractCurrent word alignment models do not distinguish between different types of alignment links. In this paper, we provide a new probabilistic model for word alignment where word alignments are associated with linguistically motivated alignment types. We propose a novel task of joint prediction of word alignment and alignment types and …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27234

AbstractWith the ever growing amount of textual data from a large variety of languages, domains, and genres, it has become standard to evaluate NLP algorithms on multiple datasets in order to ensure a consistent performance across heterogeneous setups. However, such multiple comparisons pose significant challenges to traditional statistical analysis methods …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27237

AbstractWe present a new model for acquiring comprehensive multiword lexicons from large corpora based on competition among n-gram candidates. In contrast to the standard approach of simple ranking by association measure, in our model n-grams are arranged in a lattice structure based on subsumption and overlap relationships, with nodes inhibiting …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27238

AbstractGeneral treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27239

AbstractWe introduce a method for measuring the correspondence between low-level speech features and human perception, using a cognitive model of speech perception implemented directly on speech recordings. We evaluate two speaker normalization techniques using this method and find that in both cases, speech features that are normalized across speakers predict …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27240

AbstractBoth bottom-up and top-down strategies have been used for neural transition-based constituent parsing. The parsing strategies differ in terms of the order in which they recognize productions in the derivation tree, where bottom-up strategies and top-down strategies take post-order and pre-order traversal over trees, respectively. Bottom-up parsers benefit from rich …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27241

AbstractWe present a new framework to induce an in-domain phrase table from in-domain monolingual data that can be used to adapt a general-domain statistical machine translation system to the targeted domain. Our method first compiles sets of phrases in source and target languages separately and generates candidate phrase pairs by …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27242

AbstractWe describe a neural network model that jointly learns distributed representations of texts and knowledge base (KB) entities. Given a text in the KB, we train our proposed model to predict entities that are relevant to the text. Our model is designed to be generic with the ability to address …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27243

AbstractHumans have the capacity to draw common-sense inferences from natural language: various things that are likely but not certain to hold based on established discourse, and are rarely stated explicitly. We propose an evaluation of automated common-sense inference based on an extension of recognizing textual entailment: predicting ordinal human responses …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27244

AbstractMost existing machine translation systems operate at the level of words, relying on explicit segmentation to extract tokens. We introduce a neural machine translation (NMT) model that maps a source character sequence to a target character sequence without any segmentation. We employ a character-level convolutional network with max-pooling at the …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27245

AbstractThis paper focuses on unsupervised modeling of morphological families, collectively comprising a forest over the language vocabulary. This formulation enables us to capture edge-wise properties reflecting single-step morphological derivations, along with global distributional properties of the entire forest. These global properties constrain the size of the affix set and encourage …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27246

AbstractWe propose a simple solution to use a single Neural Machine Translation (NMT) model to translate between multiple languages. Our solution requires no changes to the model architecture from a standard NMT system but instead introduces an artificial token at the beginning of the input sentence to specify the required …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27247

AbstractWe present a model of pragmatic referring expression interpretation in a grounded communication task (identifying colors from descriptions) that draws upon predictions from two recurrent neural network classifiers, a speaker and a listener, unified by a recursive pragmatic reasoning framework. Experiments show that this combined pragmatic model interprets color descriptions …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27248

AbstractWe present Attract-Repel, an algorithm for improving the semantic quality of word vectors by injecting constraints extracted from lexical resources. Attract-Repel facilitates the use of constraints from mono- and cross-lingual resources, yielding semantically specialized cross-lingual vector spaces. Our evaluation shows that the method can make use of existing cross-lingual lexicons …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27249

AbstractVariation in language is ubiquitous, particularly in newer forms of writing such as social media. Fortunately, variation is not random; it is often linked to social properties of the author. In this paper, we show how to exploit social networks to make sentiment analysis more robust to social language variation. …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27250

AbstractWe describe a simple but effective method for cross-lingual syntactic transfer of dependency parsers, in the scenario where a large amount of translation data is not available. This method makes use of three steps: 1) a method for deriving cross-lingual word clusters, which can then be used in a multilingual …...

nan

Publication: TIPSTER (2017)

DOI: nan

Paper ID: 27254

AbstractPruning hypotheses during dynamic programming is commonly used to speed up inference in settings such as parsing. Unlike prior work, we train a pruning policy under an objective that measures end-to-end performance: we search for a fast and accurate policy. This poses a difficult machine learning problem, which we tackle …...