Dependency Parsing with Backtracking using Deep Reinforcement Learning
Greedy algorithms for NLP such as transition based parsing are prone to error propagation. One way to overcome this problem is to allow the algorithm to backtrack and explore an alternative solution in cases where new evidence contradicts the solution explored so far. In order to implement such a behavior, we use reinforcement learning and let the algorithm backtrack in cases where such an action gets a better reward than continuing to explore the current solution. We test this idea on both POS tagging and dependency parsing and show that backtracking is an effective means to fight against error propagation.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement LearningDependency ParsingPOSPOS Taggingreinforcement-learningReinforcement LearningReinforcement Learning (RL)Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Transition-Based Dependency Parsing with Heuristic Backtracking
Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing
Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforce…
Dependency Parsingreinforcement-learningReinforcement LearningReinforcement Learning (RL)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 learnin…
Dependency ParsingImitation LearningQ-Learningreinforcement-learning+3A Survey of Syntactic-Semantic Parsing Based on Constituent and Dependency Structures
Syntactic and semantic parsing has been investigated for decades, which is one primary topic in the natural language processing community. This article aims for a brief survey on this topic. The parsing community include…
Dependency ParsingSemantic ParsingAdapting Unsupervised Syntactic Parsing Methodology for Discourse Dependency Parsing
One of the main bottlenecks in developing discourse dependency parsers is the lack of annotated training data. A potential solution is to utilize abundant unlabeled data by using unsupervised techniques, but there is so …
Dependency ParsingDiscourse Parsing