找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 武士精神
31#
發(fā)表于 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.
32#
發(fā)表于 2025-3-27 01:10:29 | 只看該作者
33#
發(fā)表于 2025-3-27 08:58:26 | 只看該作者
34#
發(fā)表于 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.
35#
發(fā)表于 2025-3-27 14:18:51 | 只看該作者
36#
發(fā)表于 2025-3-27 18:35:42 | 只看該作者
37#
發(fā)表于 2025-3-28 01:49:35 | 只看該作者
38#
發(fā)表于 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.
39#
發(fā)表于 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.
40#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 23:31
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
桐城市| 荆州市| 福清市| 蕉岭县| 荔浦县| 普兰店市| 浠水县| 呼玛县| 宜城市| 清徐县| 奇台县| 巴马| 黄石市| 迁西县| 江安县| 长岛县| 库尔勒市| 日喀则市| 潍坊市| 唐河县| 阜新| 温州市| 遵义市| 察哈| 丁青县| 汤原县| 闽清县| 建瓯市| 和政县| 故城县| 东阿县| 蕲春县| 东海县| 滨州市| 扎兰屯市| 漯河市| 东乡县| 九江市| 安徽省| 福鼎市| 顺义区|