Name
Abstract | ||
|---|---|---|
This article describes a simple PCFG induction model with a fixed category domain that predicts a large majority of attested constituent boundaries, and predicts labels consistent with nearly half of attested constituent labels on a standard evaluation data set of child-directed speech. The article then explores the idea that the difference between simple grammars exhibited by child learners and fully recursive grammars exhibited by adult learners may be an effect of increasing working memory capacity, where the shallow grammars are constrained images of the recursive grammars. An implementation of these memory bounds as limits on center embedding in a depth-specific transform of a recursive grammar yields a significant improvement over an equivalent but unbounded baseline, suggesting that this arrangement may indeed confer a learning advantage. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1162/COLI_a_00399 | COMPUTATIONAL LINGUISTICS |
DocType | Volume | Issue |
Journal | 47 | 1 |
ISSN | Citations | PageRank |
0891-2017 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lifeng Jin | 1 | 7 | 6.87 |
| Lane Schwartz | 2 | 209 | 18.01 |
| finale doshivelez | 3 | 574 | 51.99 |
| Timothy A. Miller | 4 | 71 | 13.76 |
| William Schuler | 5 | 125 | 17.78 |