Logical Aspects of Computational Linguistics: 5th International Conference, LACL 2005, Bordeaux, France, April 28-30, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3492
Editat de Philippe Blache, Edward Stabler, Joan Busquets, Richard Mooten Limba Engleză Paperback – 15 apr 2005
The 25 revised full papers presented were carefully reviewed and selected from over 40 submissions. The papers address a wide range of logical and formal methods in computational linguistics with studies of particular grammar formalisms and their computational properties, language engineering, and traditional topics about the syntax/semantics interface.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 336.54 lei
Preț vechi: 420.67 lei
-20% Nou
Puncte Express: 505
Preț estimativ în valută:
64.43€ • 67.22$ • 54.01£
64.43€ • 67.22$ • 54.01£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540257837
ISBN-10: 3540257837
Pagini: 380
Ilustrații: X, 366 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540257837
Pagini: 380
Ilustrații: X, 366 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
LACL.- k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.- Dependency Structure Grammars.- Towards a Computational Treatment of Binding Theory.- Translating Formal Software Specifications to Natural Language.- On the Selective Lambek Calculus.- Grammatical Development with Xmg.- Lambek-Calculus with General Elimination Rules and Continuation Semantics.- A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars.- Large Scale Semantic Construction for Tree Adjoining Grammars.- A Compositional Approach Towards Semantic Representation and Construction of ARABIC.- Strict Deterministic Aspects of Minimalist Grammars.- A Polynomial Time Extension of Parallel Multiple Context-Free Grammar.- Learnable Classes of General Combinatory Grammars.- On Expressing Vague Quantification and Scalar Implicatures in the Logic of Partial Information.- Describing Lambda Terms in Context Unification.- Category Theoretical Semantics for Pregroup Grammars.- Feature Constraint Logic and Error Detection in ICALL Systems.- Linguistic Facts as Predicates over Ranges of the Sentence.- How to Build Argumental Graphs Using TAG Shared Forest: A View from Control Verbs Problematic.- When Categorial Grammars Meet Regular Grammatical Inference.- The Expressive Power of Restricted Fragments of English.- The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars.- More Algebras for Determiners.