布尔连接词领域的信息性/复杂性权衡

IF 1.6 1区 文学 0 LANGUAGE & LINGUISTICS Linguistic Inquiry Pub Date : 2023-12-22 DOI:10.1162/ling_a_00461
Wataru Uegaki
{"title":"布尔连接词领域的信息性/复杂性权衡","authors":"Wataru Uegaki","doi":"10.1162/ling_a_00461","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":48044,"journal":{"name":"Linguistic Inquiry","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Informativeness/Complexity Trade-Off in the Domain of Boolean Connectives\",\"authors\":\"Wataru Uegaki\",\"doi\":\"10.1162/ling_a_00461\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":48044,\"journal\":{\"name\":\"Linguistic Inquiry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linguistic Inquiry\",\"FirstCategoryId\":\"98\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10494060/\",\"RegionNum\":1,\"RegionCategory\":\"文学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"LANGUAGE & LINGUISTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linguistic Inquiry","FirstCategoryId":"98","ListUrlMain":"https://ieeexplore.ieee.org/document/10494060/","RegionNum":1,"RegionCategory":"文学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"LANGUAGE & LINGUISTICS","Score":null,"Total":0}
引用次数: 0

摘要

我将信息性/复杂性权衡方面的语义共性模型(Kemp,Xu,and Regier,2018)应用于布尔连接词。一旦我们结合Horn(1972)、Katzir和Singh(2013)的理论见解,该模型就解释了连接NAND在跨语言中的缺失。如果语言在给定标量含义的情况下优化(a)根据基元符号测量的词典的简单性和(b)根据信息的准确传递测量的词典信息性之间的权衡,则NAND的缺乏随之而来。分析表明,该模型为逻辑词汇中词汇化的本质提供了一个很有前途的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Informativeness/Complexity Trade-Off in the Domain of Boolean Connectives
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Linguistic Inquiry
Linguistic Inquiry Multiple-
CiteScore
2.50
自引率
12.50%
发文量
54
期刊介绍: Linguistic Inquiry leads the field in research on current topics in linguistics. This key resource explores new theoretical developments based on the latest international scholarship, capturing the excitement of contemporary debate in full-scale articles as well as shorter contributions (Squibs and Discussion) and more extensive commentary (Remarks and Replies).
期刊最新文献
Inverse Linking and Extraposition VP-Preposing and Constituency “Paradox” Using Computational Models to Test Syntactic Learnability Applicative Recursion and Nominal Licensing More on (the Lack of) Reconstruction in English Tough-Constructions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1