habia un error en el codigo, asi que hay que volver a correr los experimentos

hace unos dias, programe el systema para que los nodos que son argumentos esten marcados, y forzar a estos a a emparejarse,
lance cuatro procesos de los cuales 3 se han muerto, manyana tendre los resultados del ultimo proceso

el anual report esta entregado

reading emails

and changing the report content

Trial evaluation defense:

attend:

Liliana

Stephan

Rami

and Martin

El reporte ya esta casi acabado

hay una conferencia importante en milan

Friday 4 December 2009

8:30-9:15	Registration
9:15-9:30	Opening
9:30-10:30	Invited lecture: Eva Hajičová From Prague Structuralism to Treebank Annotation
10:30-11:00	Coffee break
11:00-12:30	Session A Chair: Koenraad De Smedt
11:00-11:30	Federico Sangati and Chiara Mazza An English Dependency Treebank à la Tesnière
11:30-12:00	Katri Haverinen, Filip Ginter, Veronika Laippala, Timo Viljanen and Tapio Salakoski Dependency Annotation of Wikipedia: First Steps Towards a Finnish Treebank
12:00-12:30	Markus Dickinson and Marwa Ragheb Dependency Annotation for Learner Corpora
12:30-14:00	Lunch
14:00-15:30	Session B Chair: Adam Przepiórkowski
14:00-14:30	Jörg Tiedemann and Gideon Kotzé Building a Large Machine-Aligned Parallel Treebank
14:30-15:00	Marie Mikulová and Jan Štĕpánek Annotation Quality Checking and Its Implications for Design of Treebank (in Building the Prague Czech-English Dependency Treebank)
15:00-15:30	Alina Wróblewska and Anette Frank Cross-Lingual Projection of LFG F-Structures: Building an F-Structure Bank for Polish
15:30-16:00	Coffee break
16:00-17:30	Poster session
	Eduard Bejček, Pavel Straňák and Jan Hajič Finalising Multiword Annotations in PDT
	Kristýna Čermáková, Lucie Mladová, Eva Fučíková and Kateřina Veselá Annotation of Selected Non-dependency Relations in a Dependency Treebank
	Barbara McGillivray Selectional Preferences from a Latin Treebank
	Helge Dyvik, Paul Meurer, Victoria Rosén and Koenraad De Smedt Linguistically Motivated Parallel Parsebanks

Saturday 5 December 2009

9:30-10:30	Invited lecture: Roberto Busa SJ From Punched Cards to Treebanks: 60 Years of Computational Linguistics
10:30-11:00	Coffee break
11:00-12:30	Session C Chair: Anette Frank
11:00-11:30	David Bamman, Francesco Mambrini and Gregory Crane An Ownership Model of Annotation: The Ancient Greek Dependency Treebank
11:30-12:00	Johan Bos, Cristina Bosco and Alessandro Mazzei Converting a Dependency Treebank to a Categorial Grammar Treebank for Italian
12:00-12:30	Torsten Marek, Gerold Schneider and Martin Volk A Declarative Formalism for Constituent-to-Dependency Conversion
12:30-14:00	Lunch
14:00-15:30	Session D Chair: Victoria Rosén
14:00-14:30	Seth Kulick and Ann Bies Treebank Analysis and Search Using an Extracted Tree Grammar
14:30-15:00	Adam Przepiórkowski TEI P5 as an XML Standard for Treebank Encoding
15:00-15:30	Ines Rehbein, Josef Ruppenhofer and Jonas Sunde MaJo - A Toolkit for Supervised Word Sense Disambiguation and Active Learning
15:30-16:00	Coffee break
16:00-17:30	Session E Chair: Charles J. Fillmore
16:00-16:30	Karin Harbusch and Gerard Kempen Clausal Coordinate Ellipsis and its Varieties in Spoken German: A Study with the TüBa-D/S Treebank of the VERBMOBIL Corpus
16:30-17:00	Jana Šindlerová and Ondřej Bojar Towards English-Czech Parallel Valency Lexicon via Treebank Examples
17:00-17:30	António Branco, Sara Silveira, Sérgio Castro, Mariana Avelãs, Clara Pinto and Francisco Costa Dynamic Propbanking with Deep Linguistic Grammars
17:30-17:45	Closing session

reading week

todavia escribiendo el report

Semantic RL aproaches written.

el reporte no se acepto para obtener los cinco creditos que faltan.

estoy escribiendo la evaluacion

perfilando srl report
c++ clases (2 semana)

read semEval-2010 Task 10

some bugs fixed at the code.

experiments need to be run it again

escribiendo reporte del software

depurando codigo y corriendo experimentos

ayer estuve 3 horas pregramando y 3 horas depurando,
he anyadido un algoritmo genetico al programa para que busque los mejores parametros para medir la distancia entre los nodos de un arbol.

He reescrito las referencias del poster a mano, espero q asi salga bien

escribiendo el poster,
parece que todas las referencias que queria utilizar son procedings, asi que hay que buscar los papers

fijando errores en sanity test report
modificando el codigo fuente

le he enviado el borrador del reporte interno a martin
y rellenado wiki con mi trabajo

40 minutos ingles

todavia escribiendo el abstract y el sanity report

still developing the poster's abstract

memory allocation bug fixed.

AtomicCost -> needs to be free

debuggin memory alocation srl

PADOVA-ESSIR09

preparing evaluation for next October,
describing work.

LATEX course 3h

running experiment SRL
training and testing -> same data set.
I wish to prove that there are only errors when there are multiple trees at the same distance.

distance must be alwais 0
and number of trees at the same distance must be more than 1 if the label is wrong

pascal changen aborted

SVM

SVM:

general: http://www.support-vector-machines.org/

LIBSVM: http://www.csie.ntu.edu.tw/~cjlin/libsvm/ (C++)
SVMLIGHT: http://svmlight.joachims.org/ (C++)

BIOJAVA: http://www.biojava.org/ (The package org.biojava.stats.svm contains SVM classification and regression.) (JAVA)

Package pt.tumba.ngram.svm: http://tcatng.sourceforge.net/javadocs/pt/tumba/ngram/svm/package-summary.html (JAVA)

The following packages either implement SVM by themselves or wrap some SVM packages written in C/C++.

RapidMiner: http://rapid-i.com/
WEKA: http://www.cs.waikato.ac.nz/ml/weka/
MALLET: http://mallet.cs.umass.edu/
MINORTHIRD: http://minorthird.sourceforge.net/

start programming the sofware for the pascal challenge

booking fly to padova

Pascal Challenge

Pascal Challenge on
Large Scale Hierarchical Text classification

Web site: http://lshtc.iit.demokritos.gr/
Email: lshtc_info@iit.demokritos.gr

We are pleased to announce the launch of the Large Scale Hierarchical Text classification (LSHTC) Pascal Challenge. The LSHTC Challenge is a
hierarchical text classification competition using large datasets based on the ODP Web directory data (www.dmoz.org).

Hierarchies are becoming ever more popular for the organization of text
documents, particularly on the Web. Web directories are an example. Along with their widespread use, comes the need for automated classification of new documents to the categories in the hierarchy. As the size of the hierarchy grows and the number of documents to be classified increases, a number of interesting machine learning problems arise. In particular, it is one of the rare situations where data sparsity remains an issue despite the vastness of available data. The reasons for this are the simultaneous increase in the number of classes and their hierarchical organization. The latter leads to a very high imbalance between the classes at different levels of the hierarchy. Additionally, the statistical dependence of the classes poses challenges and opportunities for the learning methods.

The challenge will consist of four tasks with partially overlapping data. Information regarding the tasks and the challenge rules can be found at challenge Web site, under the "Tasks, Rules and Guidelines" link.

We plan a two-stage evaluation of the participating methods: one measuring classification performance and one computational performance. It is important to measure both, as they are dependent. The results will be included in a final report about the challenge and we also aim at organizing a special NIPS'09 workshop.

In order to register for the challenge and gain access to the datasets,
please create a new account at challenge Web site.

Key dates:
Start of testing: July 10, 2009.
End of testing, submission of executables and short papers: September 29, 2009.
End of scalability test and announcement of results: October 25, 2009.
NIPS'09 workshop (subject to approval): December 11-12, 2009

Organisers:
Eric Gaussier, LIG, Grenoble, France
George Paliouras, NCSR "Demokritos", Athens, Greece
Aris Kosmopoulos, NCSR "Demokritos", Athens, Greece
Sujeevan Aseervatham, LIG, Grenoble & Yakaz, Paris, France

the proposition bank: an annotated corpus of semantic roles

describes how is builded propbank

writing the SRL report