[ 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/03/12 22:59 longdt 2012/03/12 22:53 longdt 2012/03/12 22:53 longdt 2012/03/12 22:51 longdt 2012/03/12 22:50 longdt 2012/03/12 22:50 longdt 2012/03/12 22:49 longdt 2012/03/12 22:47 longdt 2012/03/12 22:45 longdt 2012/03/12 22:44 longdt 2012/03/12 22:42 longdt 2012/03/12 22:41 longdt 2012/03/12 22:41 longdt 2012/03/12 22:39 longdt 2012/03/12 20:22 longdt 2012/03/12 20:21 longdt 2012/03/12 20:19 longdt 2012/03/12 20:17 longdt 2012/03/12 20:16 longdt 2012/03/12 20:11 longdt vytvořeno Go Next revision		Previous revision 2012/03/12 22:59 longdt 2012/03/12 22:53 longdt 2012/03/12 22:53 longdt 2012/03/12 22:51 longdt 2012/03/12 22:50 longdt 2012/03/12 22:50 longdt 2012/03/12 22:49 longdt 2012/03/12 22:47 longdt 2012/03/12 22:45 longdt 2012/03/12 22:44 longdt 2012/03/12 22:42 longdt 2012/03/12 22:41 longdt 2012/03/12 22:41 longdt 2012/03/12 22:39 longdt 2012/03/12 20:22 longdt 2012/03/12 20:21 longdt 2012/03/12 20:19 longdt 2012/03/12 20:17 longdt 2012/03/12 20:16 longdt 2012/03/12 20:11 longdt vytvořeno Go Last revision Both sides next revision
courses:rg:2012:longdtreport [2012/03/12 22:50] longdt		courses:rg:2012:longdtreport [2012/03/12 22:53] longdt
Line 27:		Line 27:
	- Use n array for n-gram model (array i-th is used for i-gram)		- Use n array for n-gram model (array i-th is used for i-gram)
	- Each element in array in pair (w,c)		- Each element in array in pair (w,c)
-	- w : index of that word in unigram array	+	w : index of that word in unigram array
-	- c : offset pointer	+	c : offset pointer
	- Sort base on w		- Sort base on w
Line 52:		Line 52:
	the underline reason is only to support binary search		the underline reason is only to support binary search
-	==== Conclusion ====	+	==== Decoding ====
		+	**I. Exploiting Repetitive Queries**
		+	The method use cache to speed up the process
		+	This simple implementation increase performance of 300% over conventional implementation
		+	**II. Exploiting Scrolling Queries**
		+
		+	We can quickly form the context encoding of the next query by concatenating new words with saved offset from previous query
		+
		+	==== Conclusion ====
	All in all, it was a paper worth reading, well presented, and thoroughly		All in all, it was a paper worth reading, well presented, and thoroughly
	discussed, bringing useful general ideas as well as interesting details.		discussed, bringing useful general ideas as well as interesting details.
		+

---

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