The Informativeness/Complexity Trade-Off in the Domain of Boolean Connectives
The Informativeness/Complexity Trade-Off in the Domain of Boolean Connectives
复制标题
布尔连接词领域的信息性/复杂性权衡
DOI:
10.1162/ling_a_00461
复制
发表时间:
2022
影响因子:
1.6
通讯作者:
Uegaki W
中科院分区:
文献类型:
--
作者:
Uegaki W
I apply the model of semantic universals in terms of informativeness/complexity trade-off (Kemp, Xu, and Regier 2018) to Boolean connectives. The model explains the crosslinguistic absence of the connective , once theoretical insights from and are incorporated. The lack of follows if languages optimize the trade-off between (a) simplicity of the lexicon measured in terms of primitive symbols and (b) informativeness of the lexicon measured in terms of accurate transfer of information, given scalar implicature. The analysis demonstrates that the model provides a promising insight into the nature of lexicalization in logical vocabularies.
登录
查看更多内容
DOI:
10.3765/salt.v24i0.2422
发表时间:
2014
期刊:
Semantics and Linguistic Theory
影响因子:
--
作者:
Margit Bowler
通讯作者:
Margit Bowler
影响因子:
0.5
作者:
M. Mous
通讯作者:
M. Mous
影响因子:
2.1
作者:
Del Pinal, Guillermo
通讯作者:
Del Pinal, Guillermo
影响因子:
1.1
作者:
Jaeger, Gerhard
通讯作者:
Jaeger, Gerhard
影响因子:
1.1
作者:
Enguehard, Emile;Spector, Benjamin
通讯作者:
Spector, Benjamin