Potsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing

Željko Agić and Alexander Koller

In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval), 2014.

We present the Potsdam systems that participated in the semantic dependency parsing shared task of SemEval 2014. They are based on linguistically motivated bidirectional transformations between graphs and trees and on utilization of syntactic dependency parsing. They were entered in both the closed track and the open track of the challenge, recording a peak average labeled F1 score of 78.60.

Download: Download

BibTeX Entry
@InProceedings{sdp-semeval-14,
	author = {\v{Z}eljko Agi\'{c} and Alexander Koller},
	title = {Potsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing},
	booktitle = {Proceedings of the 8th International Workshop on
		Semantic Evaluation (SemEval)},
	year = 2014
}

Back: Publications