標(biāo)題: Titlebook: Constraint Solving and Language Processing; First International Henning Christiansen,Peter Rossen Skadhauge,J?rgen Conference proceedings [打印本頁] 作者: Glycemic-Index 時(shí)間: 2025-3-21 16:48
書目名稱Constraint Solving and Language Processing影響因子(影響力)
書目名稱Constraint Solving and Language Processing影響因子(影響力)學(xué)科排名
書目名稱Constraint Solving and Language Processing網(wǎng)絡(luò)公開度
書目名稱Constraint Solving and Language Processing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Constraint Solving and Language Processing被引頻次
書目名稱Constraint Solving and Language Processing被引頻次學(xué)科排名
書目名稱Constraint Solving and Language Processing年度引用
書目名稱Constraint Solving and Language Processing年度引用學(xué)科排名
書目名稱Constraint Solving and Language Processing讀者反饋
書目名稱Constraint Solving and Language Processing讀者反饋學(xué)科排名
作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-21 20:54 作者: Bmd955 時(shí)間: 2025-3-22 03:20
Henning Christiansen,Peter Rossen Skadhauge,J?rgen作者: 一再遛 時(shí)間: 2025-3-22 08:23
0302-9743 meworks. Programming techniques for constraint solving have been, and still are, in a period with rapid devel- ment of new e?cient methods and paradigms from wh978-3-540-26165-0978-3-540-31928-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 脫離 時(shí)間: 2025-3-22 11:46
Conference proceedings 2005ply in the ch- acterization of linguistic and cognitive phenomena, in formalized linguistic m- els as well as in implementation-oriented frameworks. Programming techniques for constraint solving have been, and still are, in a period with rapid devel- ment of new e?cient methods and paradigms from wh作者: 驚呼 時(shí)間: 2025-3-22 15:51
Conference proceedings 2005C- straint Solving and Language Processing, held in Roskilde, Denmark, September 1–3, 2004. Constraint Programming and Constraint Solving, in particular Constraint Logic Programming, appear to be a very promising platform, perhaps the most promising present platform, for bringing forward the state o作者: 驚呼 時(shí)間: 2025-3-22 18:01
Margherita Antona,Constantine Stephanidisation that may be missing in one conjunct through semantic and syntactic information found in the other. Thus semantic criteria, which in most previous approaches was understressed in favour of syntactic criteria, regains its due importance, within our encompassing while retaining economic abductive formulation.作者: 眼界 時(shí)間: 2025-3-22 23:02 作者: 分發(fā) 時(shí)間: 2025-3-23 03:14
Margherita Antona,Constantine Stephanidis then introduce the notion of density, based on proportions of satisfied and violated linguistic properties. Our intuition is that density can be used as a means to measure fuzzy notions such as syntactic complexity or as a criterion to identify gradient levels of acceptability. We present and discuss early experimental results concerning density.作者: Evolve 時(shí)間: 2025-3-23 06:31 作者: forbid 時(shí)間: 2025-3-23 13:31
The Other Syntax: Approaching Natural Language Semantics Through Logical Form Compositionce over these logical expressions. Both well-formedness in the underspecified semantic description language and real-world inference among the fully resolved Ty2 terms denoted by those descriptions can be conducted by closure over algebras of Constraint Handling Rules [1] in a logic programming implementation.作者: phytochemicals 時(shí)間: 2025-3-23 16:12
Gradience, Constructions and Constraint Systems then introduce the notion of density, based on proportions of satisfied and violated linguistic properties. Our intuition is that density can be used as a means to measure fuzzy notions such as syntactic complexity or as a criterion to identify gradient levels of acceptability. We present and discuss early experimental results concerning density.作者: defendant 時(shí)間: 2025-3-23 20:30
Property Grammars: A Fully Constraint-Based Theoryption. . 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.作者: jealousy 時(shí)間: 2025-3-24 01:01
Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czechain 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.作者: NOCT 時(shí)間: 2025-3-24 04:01
An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Prlish Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combined with practical efficiency. We show results on a sample sentence that is a classic in natural language processing.作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-24 08:21
Model Extension and Model Selectionictions of the verb were used, showed that the model can account for the ambiguity resolution with both sorts of information. The model was also successfully applied to the on-line processing of a more complex object relative structure in English.作者: 可互換 時(shí)間: 2025-3-24 13:55 作者: 錢財(cái) 時(shí)間: 2025-3-24 16:38 作者: PRISE 時(shí)間: 2025-3-24 20:45
A Constraint-Based Model for Lexical and Syntactic Choice in Natural Language Generation may induce somewhat contradictory expectations. A constraint-based approach introduces a declarative model of these complex relations, allowing to identify all the possible (1) lexical choices or (2) syntactic structures which can be predicted from lexical descriptions.作者: declamation 時(shí)間: 2025-3-25 01:18
0302-9743 rkshop on C- straint Solving and Language Processing, held in Roskilde, Denmark, September 1–3, 2004. Constraint Programming and Constraint Solving, in particular Constraint Logic Programming, appear to be a very promising platform, perhaps the most promising present platform, for bringing forward t作者: 腐敗 時(shí)間: 2025-3-25 04:07
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.作者: 正面 時(shí)間: 2025-3-25 08:13
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.作者: NICE 時(shí)間: 2025-3-25 14:28 作者: 悄悄移動(dòng) 時(shí)間: 2025-3-25 17:41
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作者: temperate 時(shí)間: 2025-3-25 20:49
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作者: SPER 時(shí)間: 2025-3-26 03:25
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.作者: Bother 時(shí)間: 2025-3-26 07:27 作者: 體貼 時(shí)間: 2025-3-26 10:57
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作者: 概觀 時(shí)間: 2025-3-26 14:47
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作者: Immobilize 時(shí)間: 2025-3-26 20:36
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作者: FLORA 時(shí)間: 2025-3-26 21:53
An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Prtion is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combi作者: Obloquy 時(shí)間: 2025-3-27 01:33
A Constraint-Based Model for Lexical and Syntactic Choice in Natural Language Generationructure in natural language generation (in particuler in French). We concentrate on the linguistic description, which is the most challenging. The CSP procedures themselves are then rather straightforward. In the first case, preposition choice depends on the verb and its requirements, on the one han作者: mydriatic 時(shí)間: 2025-3-27 07:17
https://doi.org/10.1007/b136253Syntax; constraint logic programming; constraint optimization; constraint programming; constraint solvin作者: 討好女人 時(shí)間: 2025-3-27 11:52
978-3-540-26165-0Springer-Verlag Berlin Heidelberg 2005作者: membrane 時(shí)間: 2025-3-27 14:24 作者: 善辯 時(shí)間: 2025-3-27 20:54 作者: 總 時(shí)間: 2025-3-27 23:45 作者: 信任 時(shí)間: 2025-3-28 02:10 作者: Diaphragm 時(shí)間: 2025-3-28 06:20
Margherita Antona,Constantine Stephanidisonal 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作者: Cubicle 時(shí)間: 2025-3-28 12:41
https://doi.org/10.1007/978-3-319-20687-5n 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作者: 不來 時(shí)間: 2025-3-28 15:31 作者: 過份 時(shí)間: 2025-3-28 20:54
Liesbet Geris,David Gomez-Cabrerotion is performed on the probability of a sentence using a dependency-style syntactic representation, which is computed using an adaptation of the English Penn Treebank as data. The same program solves both parsing and generation subproblems, providing the flexibility of a general architecture combi作者: clarify 時(shí)間: 2025-3-29 00:59
Liesbet Geris,David Gomez-Cabreroructure in natural language generation (in particuler in French). We concentrate on the linguistic description, which is the most challenging. The CSP procedures themselves are then rather straightforward. In the first case, preposition choice depends on the verb and its requirements, on the one han作者: GREEN 時(shí)間: 2025-3-29 06:15
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/235934.jpg作者: 歹徒 時(shí)間: 2025-3-29 09:51 作者: Aesthete 時(shí)間: 2025-3-29 13:53
Lecture Notes in Computer Scienceystem 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.作者: 厭惡 時(shí)間: 2025-3-29 18:51
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.作者: 饑荒 時(shí)間: 2025-3-29 22:12
Rastko R. Selmic,Vir V. Phoha,Abdul Serwadda. Their analysis is undertaken by constructing an algebra of pseudodifferential operators sharing the same type of degeneracy which is large enough to contain parametrices for many of the elliptic elements of the original ring of edge differential operators. These parametrices are constructed explic作者: jarring 時(shí)間: 2025-3-30 01:02 作者: Monocle 時(shí)間: 2025-3-30 05:49
T-Labs Series in Telecommunication Services differenziertes Vorgehen. So müssen beispielsweise bei der Beurteilung des Fortschritts der Privatisierungsprozesse sowohl interne Voraussetzungen, wie die Gr??e eines Landes und die Bev?lkerungszahl, Besch?ftigungs-, Qualifikations- und Altersstrukturen, Branchen- und Infrastruktur, aber auch exte作者: 創(chuàng)作 時(shí)間: 2025-3-30 10:52
https://doi.org/10.1007/978-1-4939-3591-8RNA-binding proteins; RNA-protein complexes; Ribonucleoproteins; Direct RNA-protein contact; Bioinformat作者: habile 時(shí)間: 2025-3-30 16:08
