[ Skip to the content ]

Institute of Formal and Applied Linguistics Wiki

• ÚFAL Wiki Home
• ÚFAL Home
• Sitemap
• RSS
• ÚFAL calendar
• Recent changes
• Login
• Hledat:

[ Back to the navigation ]

Differences

This shows you the differences between two versions of the page.

View differences: Side by SideInline Go

Link to this comparison view

Both sides previous revision Previous revision 2012/09/27 11:22 ufal 2012/09/27 11:21 ufal 2012/09/27 11:20 ufal 2012/09/27 11:17 ufal 2012/09/27 11:15 ufal 2012/09/27 11:12 ufal 2012/09/27 11:09 ufal 2012/09/27 11:03 ufal 2012/09/27 10:58 ufal 2012/09/27 10:54 ufal 2012/09/27 10:39 ufal 2012/09/27 10:36 ufal 2012/09/27 10:14 ufal 2012/09/27 09:41 ufal 2012/09/27 09:31 ufal 2012/09/26 13:57 ufal 2012/09/26 13:56 ufal 2012/09/26 13:49 ufal 2012/09/26 13:46 ufal vytvořeno Go		2012/09/27 11:22 ufal 2012/09/27 11:21 ufal 2012/09/27 11:20 ufal 2012/09/27 11:17 ufal 2012/09/27 11:15 ufal 2012/09/27 11:12 ufal 2012/09/27 11:09 ufal 2012/09/27 11:03 ufal 2012/09/27 10:58 ufal 2012/09/27 10:54 ufal 2012/09/27 10:39 ufal 2012/09/27 10:36 ufal 2012/09/27 10:14 ufal 2012/09/27 09:41 ufal 2012/09/27 09:31 ufal 2012/09/26 13:57 ufal 2012/09/26 13:56 ufal 2012/09/26 13:49 ufal 2012/09/26 13:46 ufal vytvořeno Go Next revision Both sides next revision
courses:rg:2011-report-parser [2012/09/27 09:31] ufal		courses:rg:2011-report-parser [2012/09/27 09:41] ufal
Line 10:		Line 10:
	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's one. In addition, they extend the non-directional easy-first first algorithm of Goldberg and Elhadad to support non-projective trees by adding "move" actions inspired by Nivre's swap-based reordering for shift-reduce parsing. Their parser is capable of producing shallow semantic annotations for prepositions, possesives and noun compounds.		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's one. In addition, they extend the non-directional easy-first first algorithm of Goldberg and Elhadad to support non-projective trees by adding "move" actions inspired by Nivre's swap-based reordering for shift-reduce parsing. Their parser is capable of producing shallow semantic annotations for prepositions, possesives and noun compounds.
		+
	===== 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's dependency labels
		+

---

[ Back to the navigation ] [ Back to the content ]