Modelling dependency completion in sentence comprehension as a Bayesian hierarchical mixture process: A case study involving Chinese relative clauses

February 02, 2017 ยท Declared Dead ยท ๐Ÿ› Annual Meeting of the Cognitive Science Society

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shravan Vasishth, Nicolas Chopin, Robin Ryder, Bruno Nicenboim arXiv ID 1702.00564 Category stat.AP Cross-listed cs.CL, stat.ME, stat.ML Citations 6 Venue Annual Meeting of the Cognitive Science Society Last Checked 2 months ago
Abstract
We present a case-study demonstrating the usefulness of Bayesian hierarchical mixture modelling for investigating cognitive processes. In sentence comprehension, it is widely assumed that the distance between linguistic co-dependents affects the latency of dependency resolution: the longer the distance, the longer the retrieval time (the distance-based account). An alternative theory, direct-access, assumes that retrieval times are a mixture of two distributions: one distribution represents successful retrievals (these are independent of dependency distance) and the other represents an initial failure to retrieve the correct dependent, followed by a reanalysis that leads to successful retrieval. We implement both models as Bayesian hierarchical models and show that the direct-access model explains Chinese relative clause reading time data better than the distance account.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” stat.AP

R.I.P. ๐Ÿ‘ป Ghosted

Forecasting: theory and practice

Fotios Petropoulos, Daniele Apiletti, ... (+78 more)

stat.AP ๐Ÿ› International Journal of Forecasting ๐Ÿ“š 481 cites 5 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted