Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22080

AbstractIncremental domain adaptation, in which a system learns from the correct output for each input immediately after making its prediction for that input, can dramatically improve system performance for interactive machine translation. Users of interactive systems are sensitive to the speed of adaptation and how often a system repeats mistakes, …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22081

AbstractWe present a robust neural abstractive summarization system for cross-lingual summarization. We construct summarization corpora for documents automatically translated from three low-resource languages, Somali, Swahili, and Tagalog, using machine translation and the New York Times summarization corpus. We train three language-specific abstractive summarizers and evaluate on documents originally written in …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22082

AbstractCritical to natural language generation is the production of correctly inflected text. In this paper, we isolate the task of predicting a fully inflected sentence from its partially lemmatized version. Unlike traditional morphological inflection or surface realization, our task input does not provide “gold” tags that specify what morphological features …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22083

AbstractCurrent research on spoken language translation (SLT) has to confront with the scarcity of sizeable and publicly available training corpora. This problem hinders the adoption of neural end-to-end approaches, which represent the state of the art in the two parent tasks of SLT: automatic speech recognition and machine translation. To …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22084

AbstractMachine learning has shown promise for automatic detection of Alzheimer’s disease (AD) through speech; however, efforts are hampered by a scarcity of data, especially in languages other than English. We propose a method to learn a correspondence between independently engineered lexicosyntactic features in two languages, using a large parallel corpus …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22085

AbstractLanguage identification for code-switching (CS), the phenomenon of alternating between two or more languages in conversations, has traditionally been approached under the assumption of a single language per token. However, if at least one language is morphologically rich, a large number of words can be composed of morphemes from more …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22086

AbstractRecent work has shown that visual context improves cross-lingual sense disambiguation for nouns. We extend this line of work to the more challenging task of cross-lingual verb sense disambiguation, introducing the MultiSense dataset of 9,504 images annotated with English, German, and Spanish verbs. Each image in MultiSense is annotated with …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22087

AbstractThe task of retrieving clips within videos based on a given natural language query requires cross-modal reasoning over multiple frames. Prior approaches such as sliding window classifiers are inefficient, while text-clip similarity driven ranking-based approaches such as segment proposal networks are far more complicated. In order to select the most …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22088

AbstractWe demonstrate the surprising strength of unimodal baselines in multimodal domains, and make concrete recommendations for best practices in future research. Where existing work often compares against random or majority class baselines, we argue that unimodal approaches better capture and reflect dataset biases and therefore provide an important comparison when …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22089

AbstractWe present a novel method for mapping unrestricted text to knowledge graph entities by framing the task as a sequence-to-sequence problem. Specifically, given the encoded state of an input text, our decoder directly predicts paths in the knowledge graph, starting from the root and ending at the the target node …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22090

AbstractOver the last few years, there has been growing interest in learning models for physically grounded language understanding tasks, such as the popular blocks world domain. These works typically view this problem as a single-step process, in which a human operator gives an instruction and an automated agent is evaluated …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22091

AbstractWe propose a new visual grounding task called Visual Query Detection (VQD). In VQD, the task is to localize a variable number of objects in an image where the objects are specified in natural language. VQD is related to visual referring expression comprehension, where the task is to localize only …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22092

AbstractTraining models to map natural language instructions to programs, given target world supervision only, requires searching for good programs at training time. Search is commonly done using beam search in the space of partial programs or program trees, but as the length of the instructions grows finding a good program …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22093

AbstractNeural Networks trained with gradient descent are known to be susceptible to catastrophic forgetting caused by parameter shift during the training process. In the context of Neural Machine Translation (NMT) this results in poor performance on heterogeneous datasets and on sub-tasks like rare phrase translation. On the other hand, non-parametric …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22094

AbstractCurrent predominant neural machine translation (NMT) models often have a deep structure with large amounts of parameters, making these models hard to train and easily suffering from over-fitting. A common practice is to utilize a validation set to evaluate the training process and select the best checkpoint. Average and ensemble …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22095

AbstractWe introduce a curriculum learning approach to adapt generic neural machine translation models to a specific domain. Samples are grouped by their similarities to the domain of interest and each group is fed to the training algorithm with a particular schedule. This approach is simple to implement on top of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22096

AbstractModern Machine Translation (MT) systems perform remarkably well on clean, in-domain text. However most of the human generated text, particularly in the realm of social media, is full of typos, slang, dialect, idiolect and other noise which can have a disastrous impact on the accuracy of MT. In this paper …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22097

AbstractRecent research has discovered that a shared bilingual word embedding space can be induced by projecting monolingual word embedding spaces from two languages using a self-learning paradigm without any bilingual supervision. However, it has also been shown that for distant language pairs such fully unsupervised self-learning methods are unstable and …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22098

AbstractBeam search optimization (Wiseman and Rush, 2016) resolves many issues in neural machine translation. However, this method lacks principled stopping criteria and does not learn how to stop during training, and the model naturally prefers longer hypotheses during the testing time in practice since they use the raw score instead …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 22099

AbstractWe propose a new automatic evaluation metric for machine translation. Our proposed metric is obtained by adjusting the Earth Mover’s Distance (EMD) to the evaluation task. The EMD measure is used to obtain the distance between two probability distributions consisting of some signatures having a feature and a weight. We …...