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

@inproceedings{Agic2014PotsdamSD,
  title={Potsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing},
  author={Zeljko Agic and Alexander Koller},
  booktitle={SemEval@COLING},
  year={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. 

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • 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.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Similar Papers

Loading similar papers…