Inducing Probabilistic Grammars by Bayesian Model Merging

Details Inducing Probabilistic Grammars by Bayesian Model Merging Inducing Probabilistic Grammars by Bayesian Model Merging

1994-09-13

arxiv.org/abs/cmp-lg/9409010v1

Computer Science

Computation and Language

To appear in Grammatical Inference and Applications, Second International Colloquium on Grammatical Inference; Springer Verlag

Scientific paper

We describe a framework for inducing probabilistic grammars from corpora of positive samples. First, samples are {\em incorporated} by adding ad-hoc rules to a working grammar; subsequently, elements of the model (such as states or nonterminals) are {\em merged} to achieve generalization and a more compact representation. The choice of what to merge and when to stop is governed by the Bayesian posterior probability of the grammar given the data, which formalizes a trade-off between a close fit to the data and a default preference for simpler models (`Occam's Razor'). The general scheme is illustrated using three types of probabilistic grammars: Hidden Markov models, class-based $n$-grams, and stochastic context-free grammars.

Affiliated with

Also associated with

No associations

Rating

Inducing Probabilistic Grammars by Bayesian Model Merging does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inducing Probabilistic Grammars by Bayesian Model Merging, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inducing Probabilistic Grammars by Bayesian Model Merging will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190259