A 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 oracles during training yields superior parsing accuracies on many languages.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCSimilar Papers 제목 키워드 기반
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+3Transition-based Dependency DAG Parsing Using Dynamic Oracles
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing
We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers. In both cases, the dynamic oracles manag…
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing
We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers. In both cases, the dynamic oracles manag…
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 ParsingRerankingSentence