Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence
Unsupervised constituency parsing has been explored much but is still far from being solved as currently mainstream unsupervised constituency parser only captures the unlabeled structure of sentences. Properties in the substitution of constituents make it possible to detect constituents in a particular label. We propose an unsupervised and training-free labeling procedure by leveraging a newly introduced metric, Neighboring Distribution Divergence (NDD), which evaluates semantic changes caused by editions. We develop NDD into Dual POS-NDD (DP-NDD) and build templates called "molds" to extract labeled constituents from sentences. We show that DP-NDD labels constituents precisely and inducts more accurate unlabeled constituency trees than all previous unsupervised methods. Following two frameworks for labeled constituency trees inference, we set the new state-of-the-art for unlabeled F1 and labeled F1. Further studies show our approach can be scaled to other span labeling problems, i.e., named entity recognition.
Code (0)
등록된 구현이 없습니다.
Tasks
Constituency Parsingnamed-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)POSSimilar Papers 제목 키워드 기반
Unsupervised Full Constituency Parsing with Neighboring Distribution Divergence
Unsupervised constituency parsing has been explored much but is still far from being solved. Conventional unsupervised constituency parser is only able to capture the unlabeled structure of sentences. Towards unsupervise…
Constituency ParsingPOSSemantic SimilaritySemantic Textual SimilarityCorpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency
We present a generative model for the unsupervised learning of dependency structures. We also describe the multiplicative combination of this dependency model with a model of linear constituency. The product model outper…
Constituency ParsingDependency ParsingUnsupervised Dependency ParsingOn the Role of Supervision in Unsupervised Constituency Parsing
We analyze several recent unsupervised constituency parsing models, which are tuned with respect to the parsing $F_1$ score on the Wall Street Journal (WSJ) development set (1,700 sentences). We introduce strong baseline…
Constituency ParsingData AugmentationModel SelectionUnsupervised Discourse Constituency Parsing Using Viterbi EM
In this paper, we introduce an unsupervised discourse constituency parsing algorithm. We use Viterbi EM with a margin-based criterion to train a span-based discourse parser in an unsupervised manner. We also propose init…
Constituency ParsingDiscourse ParsingStructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modeling
There are two major classes of natural language grammar -- the dependency grammar that models one-to-one correspondences between words and the constituency grammar that models the assembly of one or several corresponded …
Constituency ParsingDependency ParsingLanguage ModelingLanguage Modelling+2