arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.00908cs.CLcs.AIcs.CC
收藏

基于阶段的最简句法分析与非局部依赖的复杂性

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

NETS - IUSS(高等研究院网络系统)

Cristiano Chesi

摘要:

一个认知上合理的解析算法应该像人类解析器一样在关键上下文中执行。在这里,我提出了一个适应Earley的解析算法,适用于基于阶段的最简语法(PMG,Chesi 2012),能够预测性能的复杂性影响。专注于自主节奏的阅读实验对象分裂的句子(沃伦和吉布森2005年),我将关联到分析的复杂性度量的基础上线索功能检索在动词段(特征检索和编码成本,FREC)。FREC是关键的基础上所讨论的解析算法预测的内存使用,它正确地符合阅读时间显示。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑