English
Related papers

Related papers: Learning Parse and Translation Decisions From Exam…

200 papers

Standard machine translation systems process sentences in isolation and hence ignore extra-sentential information, even though extended context can both prevent mistakes in ambiguous cases and improve translation coherence. We introduce a…

Computation and Language · Computer Science 2018-05-28 Elena Voita , Pavel Serdyukov , Rico Sennrich , Ivan Titov

As one of the fundamental tasks in text analysis, phrase mining aims at extracting quality phrases from a text corpus. Phrase mining is important in various tasks such as information extraction/retrieval, taxonomy construction, and topic…

Computation and Language · Computer Science 2017-03-14 Jingbo Shang , Jialu Liu , Meng Jiang , Xiang Ren , Clare R Voss , Jiawei Han

One of the difficulties of neural machine translation (NMT) is the recall and appropriate translation of low-frequency words or phrases. In this paper, we propose a simple, fast, and effective method for recalling previously seen…

Computation and Language · Computer Science 2018-04-10 Jingyi Zhang , Masao Utiyama , Eiichro Sumita , Graham Neubig , Satoshi Nakamura

Compositional vector space models of meaning promise new solutions to stubborn language understanding problems. This paper makes two contributions toward this end: (i) it uses automatically-extracted paraphrase examples as a source of…

Computation and Language · Computer Science 2018-02-01 Avneesh Saluja , Chris Dyer , Jean-David Ruvini

Discriminative translation models utilizing source context have been shown to help statistical machine translation performance. We propose a novel extension of this work using target context information. Surprisingly, we show that this…

Computation and Language · Computer Science 2016-07-06 Aleš Tamchyna , Alexander Fraser , Ondřej Bojar , Marcin Junczys-Dowmunt

We show that the state of the art Transformer Machine Translation (MT) model is not biased towards monotonic reordering (unlike previous recurrent neural network models), but that nevertheless, long-distance dependencies remain a challenge…

Computation and Language · Computer Science 2019-09-26 Leshem Choshen , Omri Abend

Large language models (LLMs) have demonstrated their ability to learn in-context, allowing them to perform various tasks based on a few input-output examples. However, the effectiveness of in-context learning is heavily reliant on the…

Computation and Language · Computer Science 2024-01-29 Liang Wang , Nan Yang , Furu Wei

We describe the University of Maryland machine translation systems submitted to the WMT17 German-English Bandit Learning Task. The task is to adapt a translation system to a new domain, using only bandit feedback: the system receives a…

Computation and Language · Computer Science 2017-08-09 Amr Sharaf , Shi Feng , Khanh Nguyen , Kianté Brantley , Hal Daumé

Modern language models leverage increasingly large numbers of parameters to achieve performance on natural language understanding tasks. Ensembling these models in specific configurations for downstream tasks show even further performance…

Computation and Language · Computer Science 2022-07-20 Pranab Islam , Shaan Khosla , Arthur Lok , Mudit Saxena

We study the phenomenon of \textit{in-context learning} (ICL) exhibited by large language models, where they can adapt to a new learning task, given a handful of labeled examples, without any explicit parameter optimization. Our goal is to…

Machine Learning · Computer Science 2023-05-29 Jacob Abernethy , Alekh Agarwal , Teodor V. Marinov , Manfred K. Warmuth

Machine learning models, and in particular language models, are being applied to various tasks that require reasoning. While such models are good at capturing patterns their ability to reason in a trustable and controlled manner is…

Computation and Language · Computer Science 2023-11-07 Kristoffer Æsøy , Ana Ozaki

This paper proposes an efficient example sampling method for example-based word sense disambiguation systems. To construct a database of practical size, a considerable overhead for manual sense disambiguation (overhead for supervision) is…

Computation and Language · Computer Science 2007-05-23 Atsushi Fujii , Kentaro Inui , Takenobu Tokunaga , Hozumi Tanaka

Transition-based and graph-based dependency parsers have previously been shown to have complementary strengths and weaknesses: transition-based parsers exploit rich structural features but suffer from error propagation, while graph-based…

Computation and Language · Computer Science 2019-08-28 Artur Kulmizev , Miryam de Lhoneux , Johannes Gontrum , Elena Fano , Joakim Nivre

Eric Brill has recently proposed a simple and powerful corpus-based language modeling approach that can be applied to various tasks including part-of-speech tagging and building phrase structure trees. The method learns a series of symbolic…

cmp-lg · Computer Science 2008-02-03 Lance A. Ramshaw , Mitchell P. Marcus

Progress in text understanding has been driven by large datasets that test particular capabilities, like recent datasets for reading comprehension (Hermann et al., 2015). We focus here on the LAMBADA dataset (Paperno et al., 2016), a word…

Computation and Language · Computer Science 2017-02-20 Zewei Chu , Hai Wang , Kevin Gimpel , David McAllester

We present an empirical analysis of the state-of-the-art systems for referring expression recognition -- the task of identifying the object in an image referred to by a natural language expression -- with the goal of gaining insight into…

Computation and Language · Computer Science 2018-05-31 Volkan Cirik , Louis-Philippe Morency , Taylor Berg-Kirkpatrick

Pretrained language models (PLMs) have shown remarkable few-shot learning capabilities when provided with properly formatted examples. However, selecting the "best" examples remains an open challenge. We propose a complexity-based prompt…

Computation and Language · Computer Science 2024-08-01 Rishabh Adiga , Lakshminarayanan Subramanian , Varun Chandrasekaran

This paper describes a natural language parsing algorithm for unrestricted text which uses a probability-based scoring function to select the "best" parse of a sentence. The parser, Pearl, is a time-asynchronous bottom-up chart parser with…

cmp-lg · Computer Science 2008-02-03 David M. Magerman , Mitchell P. Marcus

We use transductive regression techniques to learn mappings between source and target features of given parallel corpora and use these mappings to generate machine translation outputs. We show the effectiveness of $L_1$ regularized…

Computation and Language · Computer Science 2024-07-01 Ergun Biçici

We introduce a novel multi-source technique for incorporating source syntax into neural machine translation using linearized parses. This is achieved by employing separate encoders for the sequential and parsed versions of the same source…

Computation and Language · Computer Science 2018-08-31 Anna Currey , Kenneth Heafield