Total Articles: 38870

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30600

AbstractNeural Natural Language Generation (NLG) systems are well known for their unreliability. To overcome this issue, we propose a data augmentation approach which allows us to restrict the output of a network and guarantee reliability. While this restriction means generation will be less diverse than if randomly sampled, we include …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30601

AbstractFew/Zero-shot learning is a big challenge of many classifications tasks, where a classifier is required to recognise instances of classes that have very few or even no training samples. It becomes more difficult in multi-label classification, where each instance is labelled with more than one class. In this paper, we …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30602

AbstractPunning is a creative way to make conversation enjoyable and literary writing elegant. In this paper, we focus on the task of generating a pun sentence given a pair of homophones. We first find the constraint words supporting the semantic incongruity for a sentence. Then we rewrite the sentence with …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30603

AbstractA sequence-to-sequence (seq2seq) learning with neural networks empirically shows to be an effective framework for grammatical error correction (GEC), which takes a sentence with errors as input and outputs the corrected one. However, the performance of GEC models with the seq2seq framework heavily relies on the size and quality of …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30604

AbstractSemi-supervision is a promising paradigm for Bilingual Lexicon Induction (BLI) with limited annotations. However, previous semisupervised methods do not fully utilize the knowledge hidden in annotated and nonannotated data, which hinders further improvement of their performance. In this paper, we propose a new semi-supervised BLI framework to encourage the interaction …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30605

AbstractIt is challenging to perform lifelong language learning (LLL) on a stream of different tasks without any performance degradation comparing to the multi-task counterparts. To address this issue, we present Lifelong Language Knowledge Distillation (L2KD), a simple but efficient method that can be easily applied to existing LLL architectures in …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30606

AbstractRecent years the task of incomplete utterance rewriting has raised a large attention. Previous works usually shape it as a machine translation task and employ sequence to sequence based architecture with copy mechanism. In this paper, we present a novel and extensive approach, which formulates it as a semantic segmentation …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30607

AbstractThis paper proposes to adapt self-attention to discourse level for modeling discourse elements in argumentative student essays. Specifically, we focus on two issues. First, we propose structural sentence positional encodings to explicitly represent sentence positions. Second, we propose to use inter-sentence attentions to capture sentence interactions and enhance sentence representation. …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30608

AbstractDiscourse relations describe how two propositions relate to one another, and identifying them automatically is an integral part of natural language understanding. However, annotating discourse relations typically requires expert annotators. Recently, different semantic aspects of a sentence have been represented and crowd-sourced via question-and-answer (QA) pairs. This paper proposes a …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30609

AbstractAs different genres are known to differ in their communicative properties and as previously, for Chinese, discourse relations have only been annotated over news text, we have created the TED-CDB dataset. TED-CDB comprises a large set of TED talks in Chinese that have been manually annotated according to the goals …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30610

AbstractThis paper focuses on tree-based modeling for the sentence classification task. In existing works, aggregating on a syntax tree usually considers local information of sub-trees. In contrast, in addition to the local information, our proposed Modularized Syntactic Neural Network (MSNN) utilizes the syntax category labels and takes advantage of the …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30612

AbstractExisting pre-trained large language models have shown unparalleled generative capabilities. However, they are not controllable. In this paper, we propose MEGATRON-CNTRL, a novel framework that uses large-scale language models and adds control to text generation by incorporating an external knowledge base. Our framework consists of a keyword predictor, a knowledge …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30667

AbstractThis paper reduces discontinuous parsing to sequence labeling. It first shows that existing reductions for constituent parsing as labeling do not support discontinuities. Second, it fills this gap and proposes to encode tree discontinuities as nearly ordered permutations of the input sequence. Third, it studies whether such discontinuous representations are …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30668

AbstractCross-language differences in (universal) dependency parsing performance are mostly attributed to treebank size, average sentence length, average dependency length, morphological complexity, and domain differences. We point at a factor not previously discussed: If we abstract away from words and dependency labels, how many graphs in the test data were seen …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30670

AbstractA gapping construction consists of a coordinated structure where redundant elements are elided from all but one conjuncts. This paper proposes a method of parsing sentences with gapping to recover elided elements. The proposed method is based on constituent trees annotated with grammatical and semantic roles that are useful for …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30671

AbstractAutomatic post-editing (APE) aims to improve machine translations, thereby reducing human post-editing effort. APE has had notable success when used with statistical machine translation (SMT) systems but has not been as successful over neural machine translation (NMT) systems. This has raised questions on the relevance of APE task in the …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30672

AbstractAs a sequence-to-sequence generation task, neural machine translation (NMT) naturally contains intrinsic uncertainty, where a single sentence in one language has multiple valid counterparts in the other. However, the dominant methods for NMT only observe one of them from the parallel corpora for the model training but have to deal …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30673

AbstractMost of the successful and predominant methods for Bilingual Lexicon Induction (BLI) are mapping-based, where a linear mapping function is learned with the assumption that the word embedding spaces of different languages exhibit similar geometric structures (i.e. approximately isomorphic). However, several recent studies have criticized this simplified assumption showing that …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30674

AbstractUsing a language model (LM) pretrained on two languages with large monolingual data in order to initialize an unsupervised neural machine translation (UNMT) system yields state-of-the-art results. When limited data is available for one language, however, this method leads to poor translations. We present an effective approach that reuses an …...

nan

Publication: TIPSTER (2020)

DOI: nan

Paper ID: 30675

AbstractWe introduce a novel chart-based algorithm for span-based parsing of discontinuous constituency trees of block degree two, including ill-nested structures. In particular, we show that we can build variants of our parser with smaller search spaces and time complexities ranging from O(nˆ6) down to O(nˆ3). The cubic time variant covers …...