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 estimator for a large class of PCFGs that satisfy certa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2020-07-01
|
| Series: | Transactions of the Association for Computational Linguistics |
| Online Access: | https://www.mitpressjournals.org/doi/abs/10.1162/tacl_a_00323 |