I See Dead Code

Q: “How many constituent trees fit on a single A0 poster in style?” A: “886”

[Read more →]

Beginnings After the bleak, joyless work of releasing software, plugging holes of preventing users from clicking buttons they should not have clicked in the first place, writing unctuous documentation and release notes and wrapping code into neat little installers with tiny bows and bells that gently tingle when touched, there are few things as profoundly [...]

[Read more →]

It is possible to write custom GTK widgets that have “native” scrolling support, as opposed to just shoving them into a GtkViewPort and forgetting about them. Apart from having mastered a small coding challenge, as it turned out to be, this also gives you greater control over the scrolling itself, like making sure that certain [...]

[Read more →]

Even before I started working at UZH, I got my new hardware. Back in February, when I visited Zürich to look for rooms, I was offered to choose a new notebook for myself. Since I already have a large notebook (at least that’s what I consider my 14.1″ T61) and toyed around with the idea [...]

[Read more →]

Going through a computational linguistics program will bring you in touch with Zipf’s Law. Its core claim: In a corpus, the frequency of any word is inversely proportional to its rank. Translated into less-wordy terms, it means that some words (events) occur very often and many words only occur a few times, or only once. [...]

[Read more →]

Yesterday, I merged the frame semantics branch, which I have been working on for my MSc thesis, into my personal repository. Since such a grave step always demands introspection, I looked at all 513 commits I ever to to the TreeAligner repository and created a little statistic on commit times. The picture contains a 24h [...]

[Read more →]

Some participants of this semester’s „Computational Linguistics” course (which is a code word for „10 different lecturers guide you through the wonderful world of algorithms and theoretical foundations of CoLi”) obviously lack a life and willfully extended their own homework assignment, writing small toolkits for finite state automata. Surprisingly, all those toolkits were written in [...]

[Read more →]

Sometimes I wonder what the hell I might have been thinking while writing code like this1 : 1 2 3 4 5 6 7 def uncurry(f): return lambda t: f(*t)   def longest_common_prefix(Sa, Sb): return len(list( takewhile(uncurry(eq), izip(Sa, Sb)))) I bet the tenses are all wrong again. [↩]

[Read more →]

For one of the exercises, we had to implement the EM algorithm for Gaussian Mixture Models. I’ve spent a considerable amount of time on my solutions, either because I wanted to learn a new language (Scala version) or I wanted to not forgot an old one (C++ version), so I don’t want the code simply [...]

[Read more →]

While learning for the exam of this semester’s Pattern & Speech Recognition course by Prof. Klakow (highly, highly recommended), we (a couple of people, look for the names in the document itself) put together a summary with a couple a topics from the course. Topics Feature Extraction from Sound Bayesian Decision Theory Maximum Likelihood Estimation [...]

[Read more →]