Normal view MARC view ISBD view

Potsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing / Agić, Željko ; Koller, Alexander.

By: Agić, Željko.
Contributor(s): Koller, Alexander [aut].
Material type: materialTypeLabelArticleDescription: 465-470.Other title: Potsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing [Naslov na engleskom:].Subject(s): 5.04 | semantic parsing, dependency graph, graph-tree transformation hrv | semantic parsing, dependency graph, graph-tree transformation engOnline resources: Click here to access online | Click here to access online In: International Workshop on Semantic Evaluation (SemEval 2014) (23-24.08.2014. ; Dublin, Irska) Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014) str. 465-470Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

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.

Projekt MZOS 130-1300646-1776

ENG

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha