arXiv:1705.03919
A Minimal Span-Based Neural Constituency Parser
원문 초록
In this work, we present a minimal neural model for constituency parsing based on independent scoring of labels and spans. We show that this model is not only compatible with classical dynamic programming techniques, but also admits a novel greedy top-down inference algorithm based on recursive partitioning of the input. We demonstrate empirically that both prediction schemes are competitive with recent work, and when combined with basic extensions to the scoring model are capable of achieving state-of-the-art single-model performance on the Penn Treebank (91.79 F1) and strong performance on the French Treebank (82.23 F1).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Automatic Extraction of Clausal Embedding Based on Large-Scale English Text Data
Improving Unsupervised Constituency Parsing via Maximizing Semantic Information
Structural Optimization Ambiguity and Simplicity Bias in Unsupervised Neural Grammar Induction
To be Continuous, or to be Discrete, Those are Bits of Questions
Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing
Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.