A Search-Based Dynamic Reranking Model for Dependency Parsing
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingRerankingTransition-Based Dependency ParsingSimilar Papers 제목 키워드 기반
Efficient Stacked Dependency Parsing by Forest Reranking
2013-01-01 · TACL 2013 1
· Katsuhiko Hayashi, Shuhei Kondo, Yuji Matsumoto
This paper proposes a discriminative forest reranking algorithm for dependency parsing that can be seen as a form of efficient stacked parsing. A dynamic programming shift-reduce parser produces a packed derivation fores…
ARCDependency ParsingRerankingTransition-based Parsing with Context Enhancement and Future Reward Reranking
2016-12-15
· Fugen Zhou, Fuxiang Wu, Zhengchen Zhang, Minghui Dong
This paper presents a novel reranking model, future reward reranking, to re-score the actions in a transition-based parser by using a global scorer. Different to conventional reranking parsing, the model searches for the…
ARCRerankingSpan-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles
2016-12-20 · EMNLP 2016 11
· James Cross, Liang Huang
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 ParsingRerankingSentenceK-Best Spanning Tree Dependency Parsing With Verb Valency Lexicon Reranking
2012-12-01 · COLING 2012 12
· Zeljko Agic
Dependency ParsingReranking
A Reranking Approach for Dependency Parsing with Variable-sized Subtree Features
2012-11-01 · PACLIC 2012 11
· Mo Shen, Daisuke Kawahara, Sadao Kurohashi
Dependency ParsingReranking