CAREER: Abstract Universals in (Morpho)Syntax: Computational Characterizations and Empirical Implications
CAREER: Abstract Universals in (Morpho)Syntax: Computational Characterizations and Empirical Implications
批准号:
1845344
负责人:
Thomas Graf
金额:
$42.38万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2019
资助国家:
美国
项目状态:
未结题
起止时间:
2019-04-01 至 2025-03-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
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.
期刊论文(19)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
Recursive prosody is not finite-state
递归韵律不是有限状态的
DOI:
--
发表时间:
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
遏制特征编码:严格局部特征分配
DOI:
--
发表时间:
2020
期刊:
Proceedings of the Society for Computation in Linguistics
影响因子:
--
作者:
[Graf, Thomas]
通讯作者:
Graf, Thomas
DOI:
--
发表时间:
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 描述
DOI:
--
发表时间:
2020
期刊:
Proceedings of the Society for Computation in Linguistics
影响因子:
--
作者:
[Karakas, Ayla]
通讯作者:
Karakas, Ayla
共 19 条
海外基金