Total Articles: 38870

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39934

AbstractWe study relation extraction for knowledge base (KB) enrichment. Specifically, we aim to extract entities and their relationships from sentences in the form of triples and map the elements of the extracted triples to an existing KB in an end-to-end manner. Previous studies focus on the extraction itself and rely …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39935

AbstractNot all types of supervision signals are created equal: Different types of feedback have different costs and effects on learning. We show how self-regulation strategies that decide when to ask for which kind of feedback from a teacher (or from oneself) can be cast as a learning-to-learn problem leading to …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39936

AbstractWe investigate adaptive ensemble weighting for Neural Machine Translation, addressing the case of improving performance on a new and potentially unknown domain without sacrificing performance on the original domain. We adapt sequentially across two Spanish-English and three English-German tasks, comparing unregularized fine-tuning, L2 and Elastic Weight Consolidation. We then report …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39937

AbstractIt has been shown that the performance of neural machine translation (NMT) drops starkly in low-resource conditions, underperforming phrase-based statistical machine translation (PBSMT) and requiring large amounts of auxiliary data to achieve competitive results. In this paper, we re-assess the validity of these results, arguing that they are the result …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39938

AbstractA regularization technique based on adversarial perturbation, which was initially developed in the field of image processing, has been successfully applied to text classification tasks and has yielded attractive improvements. We aim to further leverage this promising methodology into more sophisticated and critical neural models in the natural language processing …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39939

AbstractRecent work on bilingual lexicon induction (BLI) has frequently depended either on aligned bilingual lexicons or on distribution matching, often with an assumption about the isometry of the two spaces. We propose a technique to quantitatively estimate this assumption of the isometry between two embedding spaces and empirically show that …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39940

AbstractWord embeddings are widely used on a variety of tasks and can substantially improve the performance. However, their quality is not consistent throughout the vocabulary due to the long-tail distribution of word frequency. Without sufficient contexts, rare word embeddings are usually less reliable than those of common words. However, current …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39941

AbstractUnsupervised neural machine translation (NMT) has attracted a lot of attention recently. While state-of-the-art methods for unsupervised translation usually perform well between similar languages (e.g., English-German translation), they perform poorly between distant languages, because unsupervised alignment does not work well for distant languages. In this work, we introduce unsupervised pivot …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39942

AbstractIn cross-lingual transfer, NLP models over one or more source languages are applied to a low-resource target language. While most prior work has used a single source model or a few carefully selected models, here we consider a “massive” setting with many such models. This setting raises the problem of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39943

AbstractWe propose a new domain adaptation method for Combinatory Categorial Grammar (CCG) parsing, based on the idea of automatic generation of CCG corpora exploiting cheaper resources of dependency trees. Our solution is conceptually simple, and not relying on a specific parser architecture, making it applicable to the current best-performing parsers. …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39944

AbstractWe study a variant of domain adaptation for named-entity recognition where multiple, heterogeneously tagged training sets are available. Furthermore, the test tag-set is not identical to any individual training tag-set. Yet, the relations between all tags are provided in a tag hierarchy, covering the test tags as a combination of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39945

AbstractWhile machine translation has traditionally relied on large amounts of parallel corpora, a recent research line has managed to train both Neural Machine Translation (NMT) and Statistical Machine Translation (SMT) systems using monolingual corpora only. In this paper, we identify and address several deficiencies of existing unsupervised SMT approaches by …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39946

AbstractClassical non-neural dependency parsers put considerable effort on the design of feature functions. Especially, they benefit from information coming from structural features, such as features drawn from neighboring tokens in the dependency tree. In contrast, their BiLSTM-based successors achieve state-of-the-art performance without explicit information about the structural context. In this …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39947

AbstractVector representations of sentences, trained on massive text corpora, are widely used as generic sentence embeddings across a variety of NLP problems. The learned representations are generally assumed to be continuous and real-valued, giving rise to a large memory footprint and slow retrieval speed, which hinders their applicability to low-resource …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39948

AbstractWe investigate the capacity of mechanisms for compositional semantic parsing to describe relations between sentences and semantic representations. We prove that in order to represent certain relations, mechanisms which are syntactically projective must be able to remember an unbounded number of locations in the semantic representations, where nonprojective mechanisms need …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39949

AbstractWe propose an attention-based model that treats AMR parsing as sequence-to-graph transduction. Unlike most AMR parsers that rely on pre-trained aligners, external semantic resources, or data augmentation, our proposed parser is aligner-free, and it can be effectively trained with limited amounts of labeled AMR data. Our experimental results outperform all …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39950

AbstractStructured information about entities is critical for many semantic parsing tasks. We present an approach that uses a Graph Neural Network (GNN) architecture to incorporate information about relevant entities and their relations during parsing. Combined with a decoder copy mechanism, this approach provides a conceptually simple mechanism to generate logical …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39951

AbstractSemantic parsing converts natural language queries into structured logical forms. The lack of training data is still one of the most serious problems in this area. In this work, we develop a semantic parsing framework with the dual learning algorithm, which enables a semantic parser to make full use of …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39952

AbstractResponse selection plays an important role in fully automated dialogue systems. Given the dialogue context, the goal of response selection is to identify the best-matched next utterance (i.e., response) from multiple candidates. Despite the efforts of many previous useful models, this task remains challenging due to the huge semantic gap …...

nan

Publication: TIPSTER (2019)

DOI: nan

Paper ID: 39953

AbstractNeural generative models have been become increasingly popular when building conversational agents. They offer flexibility, can be easily adapted to new domains, and require minimal domain engineering. A common criticism of these systems is that they seldom understand or use the available dialog history effectively. In this paper, we take …...