Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing.
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency grammars, however the models employed are overly simplistic, particularly in comparison to supervised parsing models. In this...
Autors principals: | Blunsom, P, Cohn, T |
---|---|
Format: | Conference item |
Publicat: |
ACL
2010
|
Ítems similars
-
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
per: Blunsom, P, et al.
Publicat: (2010) -
Inducing Tree−Substitution Grammars
per: Cohn, T, et al.
Publicat: (2010) -
Inducing Tree-Substitution Grammars.
per: Cohn, T, et al.
Publicat: (2010) -
BLOCKED INFERENCE IN BAYESIAN TREE SUBSTITUTION GRAMMARS
per: Cohn, T, et al.
Publicat: (2010) -
Inducing compact but accurate tree−substitution grammars
per: Cohn, T, et al.
Publicat: (2009)