Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

ACL
2009

favoriteEmaildiscussreport

153views Computational Linguistics» more ACL 2009»

Bayesian Learning of a Tree Substitution Grammar

13 years 8 months ago

Bayesian Learning of a Tree Substitution Grammar

Download www.cs.rochester.edu

Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we learn a TSG using Gibbs sampling with a nonparametric prior to control subtree size. The learned grammars perform significantly better than heuristically extracted ones on parsing accuracy.

Matt Post, Daniel Gildea

Real-time Traffic

ACL 2009 | Computational Linguistics | Context-free Grammars | Grammars | Tree Substitution |

claim paper

Related Content

» Inducing TreeSubstitution Grammars

» Blocked Inference in Bayesian Tree Substitution Grammars

» Bayesian Synchronous TreeSubstitution Grammar Induction and Its Application to Sentence Co...

» Insertion Operator for Bayesian Tree Substitution Grammars

» Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing

» Native Language Detection with Tree Substitution Grammars

» Estimating Compact Yet Rich Tree Insertion Grammars

» Bayesian Synchronous Grammar Induction

» Improving TreetoTree Translation with Packed Forests

Post Info
More Details (n/a)

Added	16 Feb 2011
Updated	16 Feb 2011
Type	Journal
Year	2009
Where	ACL
Authors	Matt Post, Daniel Gildea

Comments (0)