2006
NeurIPS
NeurIPS 2006
Adaptor Grammars: A Framework for Specifying Compositional Nonparametric Bayesian Models
Abstract
This paper introduces adaptor grammars, a class of probabilistic models of lan- guage that generalize probabilistic context-free grammars (PCFGs). Adaptor grammars augment the probabilistic rules of PCFGs with “adaptors” that can in- duce dependencies among successive uses. With a particular choice of adaptor, based on the Pitman-Yor process, nonparametric Bayesian models of language using Dirichlet processes and hierarchical Dirichlet processes can be written as simple grammars. We present a general-purpose inference algorithm for adaptor grammars, making it easy to define and use such models, and illustrate how several existing nonparametric Bayesian models can be expressed within this framework.
🚀
Conference Pioneer
- NeurIPS 2006
🌱
Topic Pioneer
- Text Representation
🌉
Interdisciplinary Bridge
- Artificial Intelligence and Interdisciplinary and Natural Language Processing
📈
Trend Setter
- Nonparametric Bayesian
🧭
Keyword Pioneer
- probabilistic context-free grammar
🐣
Hot Topic Early Bird
- markov chain monte carlo
Authors
Topics
Artificial Intelligence > Bayesian & Probabilistic > Bayesian Learning
Artificial Intelligence > Bayesian & Probabilistic > Probabilistic Modeling
Natural Language Processing > Generation > Language Modeling
Natural Language Processing > Resources & Methods > Text Representation
Interdisciplinary > Linguistics > Computational Linguistics
Machine Learning > Bayesian & Probabilistic > Bayesian Learning
Artificial Intelligence > Bayesian & Probabilistic > Bayesian Inference
Machine Learning > Bayesian & Probabilistic > Nonparametric Bayesian