Approximate Dynamic Oracle for Dependency Parsing with Reinforcement Learning
We present a general approach with reinforcement learning (RL) to approximate dynamic oracles for transition systems where exact dynamic oracles are difficult to derive. We treat oracle parsing as a reinforcement learning problem, design the reward function inspired by the classical dynamic oracle, and use Deep Q-Learning (DQN) techniques to train the oracle with gold trees as features. The combination of a priori knowledge and data-driven methods enables an efficient dynamic oracle, which improves the parser performance over static oracles in several transition systems.
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingImitation LearningQ-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Structured PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles
Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed st…
Constituency ParsingDependency ParsingRerankingSentenceBidirectional Transition-Based Dependency Parsing
Transition-based dependency parsing is a fast and effective approach for dependency parsing. Traditionally, a transitionbased dependency parser processes an input sentence and predicts a sequence of parsing actions in a …
Dependency ParsingSentenceTransition-Based Dependency ParsingA Tabular Method for Dynamic Oracles in Transition-Based Parsing
We develop parsing oracles for two transition-based dependency parsers, including the arc-standard parser, solving a problem that was left open in (Goldberg and Nivre, 2013). We experimentally show that using these oracl…
ARC