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...
主要な著者: | Blunsom, P, Cohn, T |
---|---|
フォーマット: | Conference item |
出版事項: |
ACL
2010
|
類似資料
-
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
著者:: Blunsom, P, 等
出版事項: (2010) -
Inducing Tree−Substitution Grammars
著者:: Cohn, T, 等
出版事項: (2010) -
Inducing Tree-Substitution Grammars.
著者:: Cohn, T, 等
出版事項: (2010) -
BLOCKED INFERENCE IN BAYESIAN TREE SUBSTITUTION GRAMMARS
著者:: Cohn, T, 等
出版事項: (2010) -
Inducing compact but accurate tree−substitution grammars
著者:: Cohn, T, 等
出版事項: (2009)