[ 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 10:54] ufal		courses:rg:2011-report-parser [2012/09/27 10:58] ufal
Line 45:		Line 45:
	| this parser | <latex>\mathop O(n\log(n))</latex> | <latex>\mathop O(n^2)</latex> - naive implementation |		| this parser | <latex>\mathop O(n\log(n))</latex> | <latex>\mathop O(n^2)</latex> - naive implementation |
	| this parser - non-projective | <latex>\mathop O(n^2\log(n))</latex> | <latex>\mathop O(n^3)</latex> - naive implementation |		| this parser - non-projective | <latex>\mathop O(n^2\log(n))</latex> | <latex>\mathop O(n^3)</latex> - naive implementation |
-		+
-	* implemented by a heap, it can reach <latex>\mathop O(n\log(n))</latex>; however, they don't use it because it's fast enough	+	* implemented by a heap, it can reach <latex>\mathop O(n\log(n))</latex>; however, they don't use it because it's fast enough
		+	* Algorithm1
		+	* we weren't sure what the variable "index" is (best index of parent or any index of queue of unprocessed words)
		+	* it again confirms that pseudocode is usually more confusing than a normal code or verbal explanation

---

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