English
Related papers

Related papers: Bayesian Grammar Induction for Language Modeling

200 papers

Understanding how the structure of language can be learned from sentences alone is a central question in both cognitive science and machine learning. Studies of the internal representations of Large Language Models (LLMs) support their…

Machine Learning · Statistics 2026-02-10 Jack T. Parley , Francesco Cagnetta , Matthieu Wyart

Prompted models have demonstrated impressive few-shot learning abilities. Repeated interactions at test-time with a single model, or the composition of multiple models together, further expands capabilities. These compositions are…

Most previous work on grammar induction focuses on learning phrasal or dependency structure purely from text. However, because the signal provided by text alone is limited, recently introduced visually grounded syntax models make use of…

Computation and Language · Computer Science 2021-09-22 Ruisi Su , Shruti Rijhwani , Hao Zhu , Junxian He , Xinyu Wang , Yonatan Bisk , Graham Neubig

Existing language models (LMs) predict tokens with a softmax over a finite vocabulary, which can make it difficult to predict rare tokens or phrases. We introduce NPM, the first nonparametric masked language model that replaces this softmax…

Computation and Language · Computer Science 2023-05-29 Sewon Min , Weijia Shi , Mike Lewis , Xilun Chen , Wen-tau Yih , Hannaneh Hajishirzi , Luke Zettlemoyer

We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…

Methodology · Statistics 2012-07-02 Ricardo Silva , Zoubin Ghahramani

Most neural machine translation systems still translate sentences in isolation. To make further progress, a promising line of research additionally considers the surrounding context in order to provide the model potentially missing…

Computation and Language · Computer Science 2019-11-01 Sébastien Jean , Ankur Bapna , Orhan Firat

The PC algorithm uses conditional independence tests for model selection in graphical modeling with acyclic directed graphs. In Gaussian models, tests of conditional independence are typically based on Pearson correlations, and…

Statistics Theory · Mathematics 2012-07-03 Naftali Harris , Mathias Drton

We look into the task of \emph{generalizing} word embeddings: given a set of pre-trained word vectors over a finite vocabulary, the goal is to predict embedding vectors for out-of-vocabulary words, \emph{without} extra contextual…

Computation and Language · Computer Science 2020-10-22 Zhao Jinman , Shawn Zhong , Xiaomin Zhang , Yingyu Liang

This paper presents novel Bayesian optimisation algorithms for minimum error rate training of statistical machine translation systems. We explore two classes of algorithms for efficiently exploring the translation space, with the first…

Computation and Language · Computer Science 2014-12-24 Yishu Miao , Ziyu Wang , Phil Blunsom

Chinese input recommendation plays an important role in alleviating human cost in typing Chinese words, especially in the scenario of mobile applications. The fundamental problem is to predict the conditional probability of the next word…

Computation and Language · Computer Science 2019-07-12 Hainan Zhang , Yanyan Lan , Jiafeng Guo , Jun Xu , Xueqi Cheng

We study grammar induction with mildly context-sensitive grammars for unsupervised discontinuous parsing. Using the probabilistic linear context-free rewriting system (LCFRS) formalism, our approach fixes the rule structure in advance and…

Computation and Language · Computer Science 2023-06-12 Songlin Yang , Roger P. Levy , Yoon Kim

We present a model for pragmatically describing scenes, in which contrastive behavior results from a combination of inference-driven pragmatics and learned semantics. Like previous learned approaches to language generation, our model uses a…

Computation and Language · Computer Science 2016-09-27 Jacob Andreas , Dan Klein

The paper presents an approach to semantic grounding of language models (LMs) that conceptualizes the LM as a conditional model generating text given a desired semantic message formalized as a set of entity-relationship triples. It embeds…

Computation and Language · Computer Science 2022-11-17 Chris Alberti , Kuzman Ganchev , Michael Collins , Sebastian Gehrmann , Ciprian Chelba

We describe an incremental unsupervised procedure to learn words from transcribed continuous speech. The algorithm is based on a conservative and traditional statistical model, and results of empirical tests show that it is competitive with…

Computation and Language · Computer Science 2007-05-23 Anand Venkataraman

This paper explores two separate questions: Can we perform natural language processing tasks without a lexicon?; and, Should we? Existing natural language processing techniques are either based on words as units or use units such as grams…

Computation and Language · Computer Science 2012-12-14 Peiyou Song , Anhei Shu , David Phipps , Dan Wallach , Mohit Tiwari , Jedidiah Crandall , George Luger

Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is prohibitively expensive. This work aims to improve the…

Computation and Language · Computer Science 2007-05-23 Rebecca Hwa

Large language models (LLMs) have been shown to acquire sequence-level planning abilities during training, yet their planning behavior exhibited at inference time often appears short-sighted and inconsistent with these capabilities. We…

Artificial Intelligence · Computer Science 2026-02-04 Haijiang Yan , Jian-Qiao Zhu , Adam Sanborn

While perception tasks such as visual object recognition and text understanding play an important role in human intelligence, the subsequent tasks that involve inference, reasoning and planning require an even higher level of intelligence.…

Machine Learning · Statistics 2016-09-06 Hao Wang , Dit-Yan Yeung

We introduce a novel parser based on a probabilistic version of a left-corner parser. The left-corner strategy is attractive because rule probabilities can be conditioned on both top-down goals and bottom-up derivations. We develop the…

cmp-lg · Computer Science 2007-05-23 Christopher D. Manning , Bob Carpenter

Pre-training has proven to be effective in unsupervised machine translation due to its ability to model deep context information in cross-lingual scenarios. However, the cross-lingual information obtained from shared BPE spaces is…

Computation and Language · Computer Science 2019-09-04 Shuo Ren , Yu Wu , Shujie Liu , Ming Zhou , Shuai Ma
‹ Prev 1 8 9 10 Next ›