Depth-Bounded Statistical PCFG Induction as a Model of Human Grammar Acquisition
AbstractThis 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-direc...
Main Authors: | Lifeng Jin, Lane Schwartz, Finale Doshi-Velez, Timothy Miller, William Schuler |
---|---|
Format: | Article |
Language: | English |
Published: |
The MIT Press
2021-03-01
|
Series: | Computational Linguistics |
Online Access: | https://direct.mit.edu/coli/article/47/1/181/97336/Depth-Bounded-Statistical-PCFG-Induction-as-a |
Similar Items
-
LPG–PCFG: An Improved Probabilistic Context- Free Grammar to Hit Low-Probability Passwords
by: Xiaozhou Guo, et al.
Published: (2022-06-01) -
Unsupervised PCFG Inference from Russian Corpus of Phone Conversations
by: Liubov Kovriguina, et al.
Published: (2016-11-01) -
Generation of Syntax Parser on South Indian Language using Bottom-Up Parsing Technique and PCFG
by: M. Rajani Shree, et al.
Published: (2023-01-01) -
Bayesian nonparametric approaches for reinforcement learning in partially observable domains
by: Doshi-Velez, Finale
Published: (2012) -
On different approaches to syntactic analysis into bi-lexical dependencies: An empirical comparison of direct, PCFG-based, and HPSG-based parsers
by: Angelina Ivanova, et al.
Published: (2016-04-01)