Efficient Constituency Parsing by Pointing
원문 초록
We propose a novel constituency parsing model that casts the parsing problem into a series of pointing tasks. Specifically, our model estimates the likelihood of a span being a legitimate tree constituent via the pointing score corresponding to the boundary words of the span. Our parsing model supports efficient top-down decoding and our learning objective is able to enforce structural consistency without resorting to the expensive CKY inference. The experiments on the standard English Penn Treebank parsing task show that our method achieves 92.78 F1 without using pre-trained models, which is higher than all the existing methods with similar time complexity. Using pre-trained BERT, our model achieves 95.48 F1, which is competitive with the state-of-the-art while being faster. Our approach also establishes new state-of-the-art in Basque and Swedish in the SPMRL shared tasks on multilingual constituency parsing.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.