From Montague's Rules of Quantification to Minimal Recursion Semantics and the Language of Acyclic Recursion

Roussanka Loukanova
{"title":"From Montague's Rules of Quantification to Minimal Recursion Semantics and the Language of Acyclic Recursion","authors":"Roussanka Loukanova","doi":"10.3233/978-1-60750-762-8-200","DOIUrl":null,"url":null,"abstract":"Moschovakis (2003-2006) developed a logical calculus of th e formal languageLλar of acyclic recursion, which is a type-theoretical work with many potential applications. On the implementation side, large -scale grammars for human languages, e.g. versions of HPSG, have been using semant ic representations casted in the feature-value language Minimal Recursion Sem antics (MRS). While lacking strict formalization, MRS represents successfull y ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the languageLλar.","PeriodicalId":206420,"journal":{"name":"Biology, Computation and Linguistics","volume":"16 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biology, Computation and Linguistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-60750-762-8-200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Moschovakis (2003-2006) developed a logical calculus of th e formal languageLλar of acyclic recursion, which is a type-theoretical work with many potential applications. On the implementation side, large -scale grammars for human languages, e.g. versions of HPSG, have been using semant ic representations casted in the feature-value language Minimal Recursion Sem antics (MRS). While lacking strict formalization, MRS represents successfull y ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the languageLλar.
从蒙太古的量化规则到最小递归语义和无循环递归语言
Moschovakis(2003-2006)发展了一种非循环递归的形式语言λ的逻辑演算,这是一种具有许多潜在应用的类型理论工作。在实现方面,人类语言的大规模语法,例如HPSG的版本,一直在使用特征值语言最小递归语法(MRS)的语义表示。虽然缺乏严格的形式化,但MRS成功地表示了模棱两可的量词范围。在本文中,我们通过反思用语言的一个版本来形式化MRS的可能性,介绍了MRS的基本定义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信