Heads-up! Unsupervised Constituency Parsing via Self-Attention Heads
원문 초록
Transformer-based pre-trained language models (PLMs) have dramatically improved the state of the art in NLP across many tasks. This has led to substantial interest in analyzing the syntactic knowledge PLMs learn. Previous approaches to this question have been limited, mostly using test suites or probes. Here, we propose a novel fully unsupervised parsing approach that extracts constituency trees from PLM attention heads. We rank transformer attention heads based on their inherent properties, and create an ensemble of high-ranking heads to produce the final tree. Our method is adaptable to low-resource languages, as it does not rely on development sets, which can be expensive to annotate. Our experiments show that the proposed method often outperform existing approaches if there is no development set present. Our unsupervised parser can also be used as a tool to analyze the grammars PLMs learn implicitly. For this, we use the parse trees induced by our method to train a neural PCFG and compare it to a grammar derived from a human-annotated treebank.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.