1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CL2021★ 1 cited
Neural Bi-Lexicalized PCFG Induction
Songlin Yang, Yanpeng Zhao, Kewei Tu
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 ge…
cs.CL2021
PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols
Songlin Yang, Yanpeng Zhao, Kewei Tu
Probabilistic context-free grammars (PCFGs) with neural parameterization have been shown to be effective in unsupervised phrase-structure grammar induction. However, due to the cub…