CAREER: Abstract Universals in (Morpho)Syntax: Computational Characterizations and Empirical Implications

职业：（Morpho）语法中的抽象共相：计算特征和经验含义

• 批准号: 1845344
• 负责人: Thomas Graf
• 金额: $ 42.38万
• 依托单位: SUNY at Stony Brook
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2019
• 资助国家: 美国
• 起止时间: 2019-04-01 至 2025-03-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1845344&HistoricalAwards=false
• 关键词: CAREER; Abstract; Universals; Morpho; Syntax

Language technology permeates the daily life of all Americans: from spam filters and spellcheckers to Google translate and digital assistants like Alexa and Siri. But not all language communities benefit equally. In order to perform well, current language technology requires enormous amounts of data, which are not available for smaller languages and dialects such as Navajo or African American Vernacular English. This requirement stands in stark contrast to the learning needs of children, who do not require much to acquire their native language perfectly. Linguists have attributed the ease of language acquisition to innate learning biases--all languages share universal properties, and a learning algorithm that is aware of these universals requires less data. But linguistic models of language universals are couched in terms that make them hard to incorporate into current learning algorithms. Bridging the gap between linguistic theory and language technology requires a mathematically and computationally grounded understanding of universals, both of which are incorporated in this project to inform language science and language technology.This project develops a computational model of universals in the domain of sentence structure and how it interacts with the shape of words. It adopts a framework that is built on techniques from theoretical computer science, mathematical logic, and abstract algebra. This makes it possible to characterize universals in a manner that is both rigorous and sufficiently flexible to easily accommodate the rich diversity of languages. The researcher will generalize this formal machinery from sounds to words and sentences. The project draws from from the linguistic literature on universals, and feeds it by deriving new universals from the computational analysis. The results will allow for new machine learning algorithms that incorporate linguistic universals as a strong learning bias. In addition, this award supports the development of an interactive, online learning platform. This resource will enable linguistics students across the country to master the skills they need to study language through a computational lens. Both the research and the education component of this project thus serve the purpose of bridging the gap between language science and language technology.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

语言技术渗透到所有美国人的日常生活中：从垃圾邮件过滤器和拼写检查器到谷歌翻译和Alexa和Siri等数字助手。但并不是所有的语言社区都同样受益。为了表现良好，目前的语言技术需要大量的数据，而这些数据对于较小的语言和方言（如纳瓦霍语或非裔美国人的方言英语）来说是不可用的。这一要求与儿童的学习需求形成鲜明对比，儿童不需要太多就能完美地掌握母语。语言学家将语言习得的便利性归因于先天的学习偏见——所有的语言都有共同的属性，而一个意识到这些共性的学习算法需要更少的数据。但是，语言共相的语言模型的措辞使得它们难以融入当前的学习算法。弥合语言理论和语言技术之间的差距需要对普遍性的数学和计算基础的理解，这两者都被纳入本项目，以告知语言科学和语言技术。这个项目开发了一个句子结构领域的共相的计算模型，以及它如何与单词的形状相互作用。它采用了建立在理论计算机科学、数学逻辑和抽象代数技术基础上的框架。这就有可能以一种既严格又足够灵活的方式来描述普遍性，从而容易地适应语言的丰富多样性。研究者将这种形式机制从声音推广到单词和句子。该项目从关于共相的语言学文献中提取，并通过计算分析得出新的共相。研究结果将允许新的机器学习算法将语言共性作为一种强大的学习偏见。此外，该奖项还支持互动式在线学习平台的开发。这个资源将使全国各地的语言学学生掌握通过计算透镜学习语言所需的技能。因此，该项目的研究和教育部分都是为了弥合语言科学和语言技术之间的差距。该奖项反映了美国国家科学基金会的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Recursive prosody is not finite-state

递归韵律不是有限状态的

• 发表时间: 2021
• 期刊: Proceedings of the Seventeenth SIGMORPHON Workshop on Computational Research
• 作者: Dolatian, Hossep;De Santo, Aniello;Graf, Thomas
• 通讯作者: Graf, Thomas

Curbing Feature Coding: Strictly Local Feature Assignment

遏制特征编码：严格局部特征分配

• 发表时间: 2020
• 期刊: Proceedings of the Society for Computation in Linguistics
• 作者: Graf, Thomas

The Subregular Complexity of Syntactic Islands

句法岛的次正则复杂性

• 发表时间: 2020
• 期刊: Proceedings of the Society for Computation in Linguistics
• 作者: Shafiei, Nazila;Graf, Thomas
• 通讯作者: Graf, Thomas

Modeling island effects with probabilistic tier-based strictly local grammars over trees

使用基于概率层的树上严格局部语法对岛屿效应进行建模

• DOI: 10.7275/nz4q-6b09
• 发表时间: 2023
• 期刊: Proceedings of the Society for Computation in Linguistics
• 作者: Torres, Charles;Hanson, Kenneth;Graf, Thomas;Mayer, Connor
• 通讯作者: Mayer, Connor

An IBSP Description of Sanskrit /n/-Retroflexion

梵文 /n/-Retroflexion 的 IBSP 描述

• 发表时间: 2020
• 期刊: Proceedings of the Society for Computation in Linguistics
• 作者: Karakas, Ayla