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

基于期望的最简文法

Expectation-based Minimalist Grammars

NeTS – IUSS lab for NEurolinguistics, Computational Linguistics, and Theoretical Syntax, Pavia（帕维亚 IUSS 神经语言学、计算语言学与理论句法实验室（NeTS））

Cristiano Chesi

备注：
This is an extended version of a paper published in CLiC-it 2021 - Italian Conference on Computational Linguistics 2021 - Proceedings of the Eighth Italian Conference on Computational Linguistics Milan, Italy, January 26-28, 2022. Edited by Elisabetta Fersini, Marco Passarotti, Viviana Patti. CEUR-WS.org, ISSN 1613-0073
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

基于期望的最简语法（Expectation-based Minimalist Grammars，e-MG）是Stabler（Stabler，2011，2013，1997）和基于阶段的最简语法（Phase-based Minimalist Grammars，PMGs，Chesi，2005，2007; Stabler，2011）形式化的（合并）最简语法（C）MG的简化版本。关键的简化包括仅依靠词汇编码的类别自上而下的期望来构建驱动结构。对自上而下派生的承诺（如e-MG和PMG，而不是（C）MG，Chomsky，1995; Stabler，2011）允许我们定义一个在解析和生成中应该相同的核心派生（Momma & Phillips，2018）。

英文摘要：

Expectation-based Minimalist Grammars (e-MGs) are simplified versions of the (Conflated) Minimalist Grammars, (C)MGs, formalized by Stabler (Stabler, 2011, 2013, 1997) and Phase-based Minimalist Grammars, PMGs (Chesi, 2005, 2007; Stabler, 2011). The crucial simplification consists of driving structure building only by relying on lexically encoded categorial top-down expectations. The commitment on a top-down derivation (as in e-MGs and PMGs, as opposed to (C)MGs, Chomsky, 1995; Stabler, 2011) allows us to define a core derivation that should be the same in both parsing and generation (Momma & Phillips, 2018).

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

↑