啪心儿跳动
发表于 2025-3-26 21:15:05
Meaning-Driven Selectional Restrictions in , Versus ,ly when the underlying experience is veridical and the attitude content true in the actual world. This is the case for most uses of ., but only for few exceptional uses of .. I give a compositional semantics for . and . that captures their licensing conditions.
情爱
发表于 2025-3-27 02:57:26
,Multilingual Text Generation for Abstract Wikipedia in Grammatical Framework: Prospects and Challenerent skill requirements. The plan is to start with a simple but functional multilingual NLG system and to proceed towards more and more sophisticated language and wider coverage of topics, also allowing a human in the loop to create content via a Controlled Natural Language (CNL).
commute
发表于 2025-3-27 07:37:28
,Integrating Deep Neural Networks with Dependent Type Semantics,hem. Under this unified view, interesting correspondences are found between proof-theoretic and machine learning notions. For instance, the value of the loss function provides proof for an atomic predicate, and the neural parameters are regarded as proof-theoretic assumptions about the real world.
高射炮
发表于 2025-3-27 09:40:39
http://reply.papertrans.cn/59/5880/587949/587949_34.png
食道
发表于 2025-3-27 15:22:00
http://reply.papertrans.cn/59/5880/587949/587949_35.png
粗糙滥制
发表于 2025-3-27 20:29:10
Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021)978-3-031-21780-7Series ISSN 1860-949X Series E-ISSN 1860-9503
欢呼
发表于 2025-3-27 22:54:15
https://doi.org/10.1007/978-3-031-21780-7Computational Intelligence; intelligent natural language processing; natural language processing; Artif
elucidate
发表于 2025-3-28 03:17:22
http://reply.papertrans.cn/59/5880/587949/587949_38.png
连系
发表于 2025-3-28 07:30:04
Studies in Computational Intelligencehttp://image.papertrans.cn/l/image/587949.jpg
Malcontent
发表于 2025-3-28 12:36:35
,Complexity of the Lambek Calculus and Its Extensions,We survey results on algorithmic complexity of extensions of the Lambek calculus. We classify these extensions as “harmless,” which do not increase complexity, and “dangerous,” which make decision problems undecidable. For the latter, we focus on extensions with subexponentials and with Kleene star.