A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Depth-bounding is effective: Improvements and evaluation of unsupervised PCFG induction
2018
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
There have been several recent attempts to improve the accuracy of grammar induction systems by bounding the recursive complexity of the induction model (Ponvert et al., 2011; Noji and Johnson, 2016; Shain et al., 2016; Jin et al., 2018) . Modern depth-bounded grammar inducers have been shown to be more accurate than early unbounded PCFG inducers, but this technique has never been compared against unbounded induction within the same system, in part because most previous depthbounding models are
doi:10.18653/v1/d18-1292
dblp:conf/emnlp/JinDMSS18
fatcat:kxytcssbjjarto4ieza6wdar3e