找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Constraint Solving and Language Processing; First International Henning Christiansen,Peter Rossen Skadhauge,J?rgen Conference proceedings

[復(fù)制鏈接]
樓主: Glycemic-Index
21#
發(fā)表于 2025-3-25 04:07:40 | 只看該作者
Lecture Notes in Computer Scienception. . is then a non-generative theory in the sense that no structure has to be build, only constraints are used both to represent linguistic information and to describe inputs. This paper describes the basic notions used in . and proposes an account of long-distance dependencies, illustrating the expressive power of the formalism.
22#
發(fā)表于 2025-3-25 08:13:59 | 只看該作者
https://doi.org/10.1007/978-3-319-20687-5ain dependency relations, modification frames and word order, including non-projectivity. Although these simple constraints are adequate from the linguistic point of view, their combination is still too weak and allows an exponential number of solutions for a sentence of . words.
23#
發(fā)表于 2025-3-25 14:28:04 | 只看該作者
24#
發(fā)表于 2025-3-25 17:41:03 | 只看該作者
Property Grammars: A Fully Constraint-Based Theoryconstraints. The . constitutes then the core of the theory: it is the grammar, but it also constitutes, after evaluation for a given input, its description. . is then a non-generative theory in the sense that no structure has to be build, only constraints are used both to represent linguistic inform
25#
發(fā)表于 2025-3-25 20:49:56 | 只看該作者
An Abductive Treatment of Long Distance Dependencies in CHRdiscuss our ideas both from a classical analysis point of view, and from a property-grammar based perspective. We exemplify them through relative clauses first, and next through the more challenging case of natural language coordination. We present an abductive rule schema for conjunction from which
26#
發(fā)表于 2025-3-26 03:25:06 | 只看該作者
Metagrammar Reduxystem described hereafter consists of two main components: a control device aimed at controlling how fragments are to be combined in order to describe meaningful lexical descriptions and a composition system aimed at resolving how elementary descriptions are to be combined.
27#
發(fā)表于 2025-3-26 07:27:43 | 只看該作者
28#
發(fā)表于 2025-3-26 10:57:42 | 只看該作者
Gradience, Constructions and Constraint Systemsonal constraint language processing. We first present here our framework for language processing, where all linguistic knowledge is represented by means of constraints. The grammar itself is a constraint system. A constraint is a relation among categories, which encodes a linguistic property. But in
29#
發(fā)表于 2025-3-26 14:47:26 | 只看該作者
Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czechn the formalism Extensible Dependency Grammar (XDG). The grammar rules are automatically inferred from the Prague Dependency Treebank (PDT) and constrain dependency relations, modification frames and word order, including non-projectivity. Although these simple constraints are adequate from the ling
30#
發(fā)表于 2025-3-26 20:36:19 | 只看該作者
Animacy Information in Human Sentence Processing: An Incremental Optimization of Interpretation Appred according to a new model of incremental optimization of interpretation. This model makes use of violable ranked constraints. To analyze the use of animacy information a set of four constraints is needed, namely ., ., ., and .. It is shown that the pattern of constraint violations of these four co
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-20 01:04
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
曲沃县| 肇东市| 嵩明县| 铅山县| 逊克县| 琼海市| 濮阳县| 旬邑县| 和田县| 新安县| 崇明县| 公安县| 怀仁县| 娱乐| 绍兴县| 北海市| 八宿县| 清镇市| 孝义市| 龙胜| 呼玛县| 屯昌县| 建昌县| 女性| 泸州市| 马关县| 临夏县| 延长县| 上杭县| 垣曲县| 田林县| 岫岩| 五常市| 商丘市| 平罗县| 富宁县| 吉林市| 沙湾县| 清涧县| 永新县| 新郑市|