Phase-based Minimalist Parsing and complexity in non-local dependencies

06/03/2019
by   Cristiano Chesi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/02/2016

Shift-Reduce Constituent Parsing with Neural Lookahead Features

Transition-based models can be fast and accurate for constituent parsing...
05/26/2019

SemBleu: A Robust Metric for AMR Parsing Evaluation

Evaluating AMR parsing accuracy involves comparing pairs of AMR graphs. ...
10/17/2019

Marpa, A practical general parser: the recognizer

The Marpa recognizer is described. Marpa is a practical and fully implem...
01/11/2017

Parsing Universal Dependencies without training

We propose UDP, the first training-free parser for Universal Dependencie...
02/26/2022

Efficient Specialized Spreadsheet Parsing for Data Science

Spreadsheets are widely used for data exploration. Since spreadsheet sys...
08/04/2021

A Biologically Plausible Parser

We describe a parser of English effectuated by biologically plausible ne...
05/04/2020

Correlating Edge, Pose with Parsing

According to existing studies, human body edge and pose are two benefici...