资源分类
》 资源 》论文》Multi-Task Semantic Dependency Parsing with Policy Gradient forLearning Easy-First Strategies

Multi-Task Semantic Dependency Parsing with Policy Gradient forLearning Easy-First Strategies

2019-09-18 | |  133 |   51 |   0 0 0
Abstract In Semantic Dependency Parsing (SDP), semantic relations form directed acyclic graphs, rather than trees. We propose a new iterative predicate selection (IPS) algorithm for SDP. Our IPS algorithm combines the graph-based and transition-based parsing approaches in order to handle multiple semantic head words. We train the IPS model using a combination of multi-task learning and task-specific policy gradient training. Trained this way, IPS achieves a new state of the art on the SemEval 2015 Task 18 datasets. Furthermore, we observe that policy gradient training learns an easy-first strategy.

上一篇：Modeling financial analysts’ decision making via the pragmatics andsemantics of earnings calls

下一篇：Ranking Generated Summaries by Correctness: An Interesting butChallenging Application for Natural Language Inference

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...