[ 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
courses:rg:2012:longdtreport [2012/03/12 22:41] longdt		courses:rg:2012:longdtreport [2012/03/12 22:59] (current) longdt
Line 11:		Line 11:
	==== Encoding ====		==== Encoding ====
	**I. Encoding the count**		**I. Encoding the count**
		+
	In web1T corpus, the most frequent n-gram is 95 billion times, but contain only 770 000 unique count.		In web1T corpus, the most frequent n-gram is 95 billion times, but contain only 770 000 unique count.
	=> Maintain value rank array is a good way to encode count		=> Maintain value rank array is a good way to encode count
		+
	**II. Encoding the n-gram**		**II. Encoding the n-gram**
		+
	**//Idea//**		**//Idea//**
	encode W1,W2....Wn = c(W1,W2...W(n-1)) Wn		encode W1,W2....Wn = c(W1,W2...W(n-1)) Wn
	c is offset function, so call context encoding		c is offset function, so call context encoding
-	**//Implementation//
-	**
-	Sorted Array
-	+ Use n array for n-gram model (array i-th is used for i-gram)
-	+ Each element in array in pair (w,c)
-	+ w : index of that word in unigram array
-	+ c : offset pointer
-
-
-	Most of the attendants apparently understood the talk and the paper well, and a
-	lively discussion followed. One of our first topics of debate was the notion of
-	skyline presented in the paper. The skyline was somewhat of a supervised element
-	-- the authors estimated initial parameters for a model from gold data and
-	trained it afterwards. They assumed that a model with parameters estimated from
-	gold data cannot be beaten by an unsupervisedly trained model. Verily, after
-	training the skyline model, its accuracy dropped very significantly. The reasons
-	of this were a point of surprise for us as well as for the paper's authors.
-	Complementary to the skyline, the authors presented a baseline which should	+	**//Implementation//**
-	definitely be beaten by their final model. This baseline, they called	+
-	"uninformed", but were vague about which exact probability distribution they	+
-	used in this model. We could only speculate it was a uniform or random	+
-	probability distribution.	+
-	A point about unsupervised language modeling came out: Many linguistic phenomena	+	__Sorted Array__
-	are annotated in a way that is to some extent arbitrary, and reflects more the	+
-	linguistic theory used than the language itself, and an unsupervised model	+
-	cannot hope to get them right. The example we discussed was whether the word	+
-	"should" is governing the verb it's bound with, or vice versa. The authors	+
-	noticed that dependency orientation in general was not a particularly strong	+
-	point of their parser, and so they also included an evaluation metric that	+
-	ignored the dependency orientations.	+
-	Perhaps the most crucial observations the authors made was that there is a limit	+	- Use n array for n-gram model (array i-th is used for i-gram)
-	where feeding more data to the model training hurts its accuracy. They	+	- Each element in array in pair (w,c)
-	progressed from short sentences to longer, and identified the threshold, where	+	w : index of that word in unigram array
-	it's best to start ignoring any more training data, at sentences of length 15.	+	c : offset pointer
-	However, we were not 100% clear how they computed this constant.	+	- Sort base on w
-	If the model was to be fully unsupervised, it remains a question, how to setup	+
-	this threshold, because it cannot be safely assumed that it would be the same	+
-	for all languages and setups.	+
-	The writing style of the paper was also a matter of differing opinions.	+	Improvement : Implicitly encode W (all n-gram ending with particular word wi are stored -> wasteful. So, maintain another array save the beginning and the end of the range
-	Undeniably, it is written in a vocabulary-intensive fashion, bringing readers	+
-	face to face with words like "unbridled" or "jettison", which I personally had	+	__Hash Table__
-	never seen before.	+	Use open addressing (with linear probling)
		+	Use extra 40% space for auxiliary part (avoid collision)
		+
		+	**//Encoding Improvement//**
-	==== Conclusion ====	+	__Variable length coding__
-	All in all, it was a paper worth reading, well presented, and thoroughly	+	Idea :
-	discussed, bringing useful general ideas as well as interesting details.	+	Context offset tend to be close with each others, => Only save the first offsets address and the difference of others with the it
		+
		+	Question :
		+	how the unigram be sorted ?
		+	Martin suggest that it must be sorted base on frequency
		+
		+	__Block Compression__
		+	compress the key/value array in the blocks of 128 bytes,
		+	the underline reason is only to support binary search
		+
		+	==== 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 ====
		+	In summary, it was a worth reading paper, well presented, and thoroughly
		+	discussed. Paper contain many detail techniques that definitely helpful for actual implementation.

---

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