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...
Główni autorzy: | Blunsom, P, Cohn, T |
---|---|
Format: | Conference item |
Wydane: |
ACL
2010
|
Podobne zapisy
-
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
od: Blunsom, P, i wsp.
Wydane: (2010) -
Inducing Tree−Substitution Grammars
od: Cohn, T, i wsp.
Wydane: (2010) -
Inducing Tree-Substitution Grammars.
od: Cohn, T, i wsp.
Wydane: (2010) -
BLOCKED INFERENCE IN BAYESIAN TREE SUBSTITUTION GRAMMARS
od: Cohn, T, i wsp.
Wydane: (2010) -
Inducing compact but accurate tree−substitution grammars
od: Cohn, T, i wsp.
Wydane: (2009)