Phase-based Minimalist Parsing and complexity in non-local dependencies
Computation and Language
2021-07-20 v2 Artificial Intelligence
Computational Complexity
Abstract
A cognitively plausible parsing algorithm should perform like the human parser in critical contexts. Here I propose an adaptation of Earley's parsing algorithm, suitable for Phase-based Minimalist Grammars (PMG, Chesi 2012), that is able to predict complexity effects in performance. Focusing on self-paced reading experiments of object clefts sentences (Warren & Gibson 2005) I will associate to parsing a complexity metric based on cued features to be retrieved at the verb segment (Feature Retrieval & Encoding Cost, FREC). FREC is crucially based on the usage of memory predicted by the discussed parsing algorithm and it correctly fits with the reading time revealed.
Cite
@article{arxiv.1906.00908,
title = {Phase-based Minimalist Parsing and complexity in non-local dependencies},
author = {Cristiano Chesi},
journal= {arXiv preprint arXiv:1906.00908},
year = {2021}
}