Copenhagen: Tree approximations of semantic parsing problems
- ,
- Anders Søgaard,
- Jakob Elming,
- Dirk Hovy,
- Barbara Plank,
- Hector Martinez Alonso
- Malmö University
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewPublication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 213-217Publication milestones
- Published - 2014
Publication status
Published - 2014
Publisher
Association for Computational Linguistics, United StatesHost publication title
Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014)Abstract
In this shared task paper for SemEval2014 Task 8, we show that most semantic structures can be approximated by trees through a series of almost bijective graph transformations. We transform input graphs, apply off-the-shelf methods from syntactic parsing on the resulting trees, and retrieve output graphs. Using tree approximations, we obtain good results across three semantic formalisms,
with a 15.9% error reduction over a stateof-the-art semantic role labeling system on development data. Our system came in 3/6 in the shared task closed track.
with a 15.9% error reduction over a stateof-the-art semantic role labeling system on development data. Our system came in 3/6 in the shared task closed track.