闲荡 发表于 2025-3-30 10:10:13

J. C. J. M. van den Bergh,K. J. Button,P. Nijkamp,G. C. Peppingcience.Provides experimental evidence linking computational This volume on the semantic complexity of natural language explores the question why some sentences are more difficult than others. While doing so, it lays the groundwork for extending semantic theory with computational and cognitive aspect

咆哮 发表于 2025-3-30 12:22:19

http://reply.papertrans.cn/64/6312/631184/631184_52.png

圆锥体 发表于 2025-3-30 19:10:44

http://reply.papertrans.cn/64/6312/631184/631184_53.png

Airtight 发表于 2025-3-30 21:33:42

J. C. J. M. van den Bergh,K. J. Button,P. Nijkamp,G. C. Peppingare intractable, and therefore, their occurrence in natural language is far from obvious. I start by discussing the thesis formulated by Hintikka, which says that certain natural language sentences require nonlinear quantification to express their meaning. Then, I discuss a novel alternative reading

Abbreviate 发表于 2025-3-31 01:00:40

are intractable, and therefore, their occurrence in natural language is far from obvious. I start by discussing the thesis formulated by Hintikka, which says that certain natural language sentences require nonlinear quantification to express their meaning. Then, I discuss a novel alternative reading

动机 发表于 2025-3-31 08:45:56

J. C. J. M. van den Bergh,K. J. Button,P. Nijkamp,G. C. Pepping with a procedural approach to semantics, given a quantified sentence and a finite model, a semantic automaton computes the truth-value of this sentence in that model. In order to build the semantic automata theory, I first show how to encode finite models as strings of symbols, translating between
页: 1 2 3 4 5 [6]
查看完整版本: Titlebook: Meta-Analysis in Environmental Economics; J. C. J. M. Bergh,K. J. Button,G. C. Pepping Book 1997 Springer Science+Business Media B.V. 1997