Saturday, November 26, 2011

Boardgames / RPGs anyone?

Now for something completely different: KR is over and free time might become a bit less impossible to obtain, so I've got to ask:

Is anyone else interested in boardgames or role playing games among us? Want to start a game group for one of these?

Additional details: From boardgames I'm mostly interested in eurogames (Catan, Puerto Rico etc), although I'm willing to play pretty much anything. For RPGs, I'm currently mostly into indie narrativist games (eg Dogs in the Vineyard) and horror games; but, again, I'm willing to play pretty much anything.

Thanks for reading (and apologies if this is spam to you),
-Nikolas

Friday, November 25, 2011

ELPL - Empirical findings

Hey peeps,

While sifting through the masses of documents about assignment 1, we found that we have to list some empirical findings about the probabilities of words and productions. I've attached our findings in a document. Could anyone check if it matches your own findings?

https://docs.google.com/open?id=0B5e7DAOiLEZwYjhjODFkZGQtMjI1My00Mjg2LTgzY2UtOGYxZjA3OTdjNGQ0

Cheers

Tuesday, November 22, 2011

Off topic: ice skating near the UVA

Hey guys, its been a while since we got together and did something informal/fun as a group. So far its mainly been work work work and the occasional ping pong game... So I was thinking, why don't we do something again sometime soon like next week when we're not so busy (i.e. once we have gotten the KR exam and ELPL deadline out of the way).

My suggestion: there's a pretty big outdoors ice skating track about 10 minutes walking from Science Park (its called Jaap Eden for those who want to check it out - only available in Dutch though). I've heard from others that they had an enjoyable time there and its not really that expensive: renting a pair of skates costs around 5-6 euro and the entrance fee is about 3 euros per student if I purchase a bunch of entrances in one go and get major discount. Maybe we could go there on an afternoon for a couple of hours when we're not busy with studying...

Below in the table are the opening hours for the outdoors ice skating track:



There's also a big indoor ice skating hall at that location, which is open from 13:00-15:45 every day (in the weekend its open at 12:00). So if its raining then thats an alternative.


So I was thinking Monday afternoon would be a good time to go as we don't have class at that time. We could skate, eat something and afterwards either go home or skate some more ;) But of course, this is just my suggestion, if anyone else has any other activities in mind feel free to share.
I will probably be buying a pack of entrances for the ice skating regardless if we organize an AI field trip or not, so anyone who is interested in going skating soon (even if you want to go on your own) then let me know, you could buy the ticket off me and get like €2.10 discount :P



ps: if Nikolas or anyone else can create an off-topic tab for the blog then that'd be great so that we can keep the informal stuff together in one place. I tried but didn't manage to figure out how to do it.

Friday, November 18, 2011

CYK and unit rules

There was some heated discussion on CYK and unit production rules during today's ELPL lab session. In essence, the CYK algorithm expects all the grammar rules to be in the form A -> B C except for when words (terminals) are produced in which case it expects them to be in the form A -> a. This is known as the Chomsky Normal Form (CNF),

However, as we have all seen, our treebanks are not like that; there are some unit productions. I spent some time making up variations of CYK that would work with less strict assumptions but to no avail. It really felt that the problem isn't something that can be easily overcome with a simple hack. From what I could tell, there was some deeply ingrained constraint that probably makes it impossible for any simple modification of CYK to work with a grammar like the one we have.

Still, not all hope is lost. Wikipedia says:
Any context-free grammar can be represented in CNF
I suppose that, by extension, this must be true for PCFGs as well. So, in essence, we should be able to find an algorithm to transcribe our syntax trees and/or grammar to this form, with no loss of information, right? It seems that this might be our best bet. Wikipedia again suggests one. The same algorithm (and some motivation on why it works) can be found in Michael Sipser's "Introduction to the Theory of Computation".

However, this transcription to the CNF might introduce new symbols or merge existing ones. That could pose a problem with the evaluation later because the parsing is expected to produce syntax trees that use the same terminology as the ones in the training dataset.

But! If I understand the algorithm correctly, the only contentious point is when eliminating rules of the form A -> B C D ... which introduces new symbols. Luckily, we don't have any rules in that form.

So, we could just go through the grammar and each time we find a unit rule, A -> B, we remove it. Then, for each rule in the form B -> u (where u is a string that can be composed of terminal and non-terminal symbols) we add the rule A -> u, unless it's one of those unit rules we removed before. This is repeated until no unit rules are left.

A possible issue with the above approach is how to deal with the frequencies / probabilities of these rules. How are we supposed to decide the probabilities of the new rules based on the removed ones? Other than this one thorn, do you think this is a good solution?

Saturday, November 12, 2011

Bayesian inference and neuroscience

 I watched this great talk given by Daniel Wolpert the other day, titled The real reason for brains. It included some stuff on Bayesian inference that are pretty relevant with what we're doing at the university, especially MLPR. I hope you like it:

Friday, November 11, 2011

CYK for dummies

Hi guys,

here I share a nice PDF (tnx Mihai!) about the CYK algorithm:


The tables shown in the document (1.2, CYK by example) are very useful to understand the idea behind the algorithm, I think that the key point to quickly understand them is just being aware that, for a sentence S, each cell (X,Y), represents the sub-string of S starting with the word X and having length Y.

Enjoy :-)
Dario

 Edit: Additional resources from the comments, credit goes to Robrecht:
Edit again: Even more stuff, credit goes to Wenjin:

someone to make a 2- student group with, Elements of Language Processing and Learning- first assignment

Hi all,
I am a second year student of the Master of Logic. I am taking the AI course Elements of Language Processing and Learning, taught by Khalil Sima'an.

I am looking for a student I can make a group with since the student I was working with decided to drop the course. Is there someone who is still working alone? In the case, I would be happy if you could contact me as soon as possible.

Thank you,
Alessandra