Tiasa Mondol, Master’s candidate
David R. Cheriton School of Computer Science
The Kolmogorov Complexity of an object is incomputable. But built in its structure is a way to specify description methods of an object that is computable in some sense. Such a description method then can be exploited to quantify the bits of information needed to generate the object from scratch.
We show that Context-Free Grammars form such a viable description method to specify an object and the size of the grammar can reliably estimate the Kolmogorov Complexity. We use such estimation in approximating the Information Distance between two musical strings. We also show that such distance measure in music can be used to recognize the genre, composer and style and also for music classification.
200 University Avenue West
Waterloo, ON N2L 3G1