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)