找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logical Aspects of Computational Linguistics; 4th International Co Philippe Groote,Glyn Morrill,Christian Retoré Conference proceedings 200

[复制链接]
楼主: 武士精神
发表于 2025-3-26 22:43:22 | 显示全部楼层
Recognizing Head Movementends these grammars with head movement (“incorporation”) and affix hopping. The grammars are presented as lexicons together with CKY-like reduction rules, so an efficient CKY-like recognition method is immediately given, and logical perspectives are briefly considered.
发表于 2025-3-27 01:10:29 | 显示全部楼层
发表于 2025-3-27 08:58:26 | 显示全部楼层
发表于 2025-3-27 09:42:05 | 显示全部楼层
An Algebraic Analysis of Clitic Pronouns in ItalianWe analyze both pre- and post-verbal clitics in Italian in the context of infinitival phrases and declarative sentences, using a new form of categorial grammar in which one assigns to each morpheme a type, an element of the free “pregroup” generated by a partially ordered set of basic types.
发表于 2025-3-27 14:18:51 | 显示全部楼层
发表于 2025-3-27 18:35:42 | 显示全部楼层
发表于 2025-3-28 01:49:35 | 显示全部楼层
发表于 2025-3-28 04:26:27 | 显示全部楼层
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Techniqueprovide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.
发表于 2025-3-28 08:06:52 | 显示全部楼层
Consistent Identification in the Limit of Any of the Classes ,-Valued Is NP-hardg some of these classes by means of a consistent learning function is NP-hard..The complexity of learning classes from one particular family, Gk-valued, was still left open. In this paper it is shown that learning any (except one) class from this family by means of a consistent learning function is NP-hard as well.
发表于 2025-3-28 13:18:44 | 显示全部楼层
A Framework for the Hyperintensional Semantics of Natural Language with Two Implementationsituations/indices are then prime filters of propositions in the (pre-)lattice. Truth in a world/situation is then reducible to membership of a prime filter. We showho wthi s approach can be implemented within (i) an intensional higher-order type theory, and (ii) first-order property theory.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-4 04:31
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表