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...
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Conference item |
| প্রকাশিত: |
ACL
2010
|