Constituency Grammar Induction
4개 벤치마크 · 논문 22편 · 이 태스크의 논문 보기 →
Benchmarks
Most implemented
Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks
Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale
Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGs
Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representation
Compound Probabilistic Context-Free Grammars for Grammar Induction
On Eliciting Syntax from Language Models via Hashing
Papers
On Eliciting Syntax from Language Models via Hashing
Unsupervised parsing, also known as grammar induction, aims to infer syntactic structure from raw text. Recently, binary representation has exhibited remarkable information-preserving capabilities at both lexicon and syn…
Constituency Grammar InductionImproving Unsupervised Constituency Parsing via Maximizing Semantic Information
Unsupervised constituency parsers organize phrases within a sentence into a tree-shaped syntactic constituent structure that reflects the organization of sentence semantics. However, the traditional objective of maximizi…
Constituency Grammar InductionConstituency ParsingSentenceStructural Optimization Ambiguity and Simplicity Bias in Unsupervised Neural Grammar Induction
Neural parameterization has significantly advanced unsupervised grammar induction. However, training these models with a traditional likelihood loss for all possible parses exacerbates two issues: 1) $\textit{structural …
Constituency Grammar InductionConstituency ParsingSentenceGenerative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale
A syntactic language model (SLM) incrementally generates a sentence with its syntactic tree in a left-to-right manner. We present Generative Pretrained Structured Transformers (GPST), an unsupervised SLM at scale capable…
Constituency Grammar InductionLanguage ModelingLanguage ModellingNatural Language Inference+2Simple Hardware-Efficient PCFGs with Independent Left and Right Productions
Scaling dense PCFGs to thousands of nonterminals via a low-rank parameterization of the rule probability tensor has been shown to be beneficial for unsupervised parsing. However, PCFGs scaled this way still perform poorl…
Constituency Grammar InductionConstituency ParsingLanguage ModelingLanguage ModellingEnsemble Distillation for Unsupervised Constituency Parsing
We investigate the unsupervised constituency parsing task, which organizes words and phrases of a sentence into a hierarchical structure without using linguistically annotated data. We observe that existing unsupervised …
Constituency Grammar InductionConstituency ParsingSentence