Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
courses:rg:2011-report-parser [2012/09/26 13:49] ufal |
courses:rg:2011-report-parser [2012/09/27 09:41] ufal |
||
---|---|---|---|
Line 3: | Line 3: | ||
written by Stephen Tratz and Eduard Hovy (Information Sciences Institute, University of Southern Carolina) | written by Stephen Tratz and Eduard Hovy (Information Sciences Institute, University of Southern Carolina) | ||
- | spoken | + | presented |
reported by Michal Novák | reported by Michal Novák | ||
Line 9: | Line 9: | ||
===== Introduction ===== | ===== Introduction ===== | ||
- | The paper describes a high-quality conversion of Penn Treebank to dependency trees. The authors introduce an improved labeled dependency scheme based on the Stanford' | + | The paper describes a high-quality conversion of Penn Treebank to dependency trees. The authors introduce an improved labeled dependency scheme based on the Stanford' |
===== Notes ===== | ===== Notes ===== | ||
+ | |||
+ | ==== Dependency conversion structure ==== | ||
+ | |||
+ | * in general, there are (at least) 3 possible types of dependency labels: | ||
+ | * unlabeled - is it really a set of labels? | ||
+ | * coarse labels of the CoNLL tasks | ||
+ | * 10-20 labels | ||
+ | * for example NMOD is always under a noun - it's an easy task and the result is not quite useful | ||
+ | * their scheme is based on the Stanford' | ||
+ | |||