Embed this Speech!

<script type='text/javascript' src='http://www.sweetspeeches.com/s/e/16301---learning-rules-with-adaptor-grammars'></script>

Verified

Learning Rules with Adaptor Grammars July 9, 2009

Send This Speech Embed This Speech

Favorite:

  • Favorite_star_off
  • Bg_dislike

    0

Google Tech Talk
July 6, 2009

ABSTRACT
[note: apologies for the overscanned slides - you can find full resolution slides at http://www.cog.brown.edu/~mj/papers/johnson09-learning-rules-g.pdf ]

Presented by Mark Johnson, Brown University.

Nonparametric Bayesian methods are interesting because they may provide a way of learning the appropriate units of generalization as well as the generalization's probability or weight. Adaptor Grammars are a framework for stating a variety of hierarchical nonparametric Bayesian models, where the units of generalization can be viewed as
kinds of PCFG rules. This talk describes the mathematical and computational properties of Adaptor Grammars and linguistic applications such as word segmentation and syllabification,
and describes the MCMC algorithms we use to sample them.

Joint work with Sharon Goldwater and Tom Griffiths.

Telepromptor

Print transcript

Full Transcript coming soon

  • Randomspeech

Speech Sender

close [x]

You are sending:

Learning Rules with Adaptor Grammars- July 9, 2009

- - -
Send to:

We welcome any and all feedback for Sweet Speeches! Speak your mind!