Consistent unsupervised estimators for anchored PCFGs
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Consistent Unsupervised Estimators for Anchored PCFGs
Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning (1969). Here we present an algorithm based on distributional learning that is a consistent…
Simple 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 ModellingAn Empirical Study of Compound PCFGs
Compound probabilistic context-free grammars (C-PCFGs) have recently established a new state of the art for unsupervised phrase-structure grammar induction. However, due to the high space and time complexities of chart-b…
SentenceNeural Bi-Lexicalized PCFG Induction
Neural lexicalized PCFGs (L-PCFGs) have been shown effective in grammar induction. However, to reduce computational complexity, they make a strong independence assumption on the generation of the child word and thus bile…
Constituency Grammar InductionPCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols
Probabilistic context-free grammars (PCFGs) with neural parameterization have been shown to be effective in unsupervised phrase-structure grammar induction. However, due to the cubic computational complexity of PCFG repr…
Constituency Grammar InductionForm