000 04203nam a22005535i 4500
001 978-3-540-31953-5
003 DE-He213
005 20160624101920.0
007 cr nn 008mamaa
008 100713s2005 gw | s |||| 0|eng d
020 _a9783540319535
_9978-3-540-31953-5
024 7 _a10.1007/b136076
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aLogical Aspects of Computational Linguistics
_h[electronic resource] :
_b5th International Conference, LACL 2005, Bordeaux, France, April 28-30, 2005. Proceedings /
_cedited by Philippe Blache, Edward Stabler, Joan Busquets, Richard Moot.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
300 _aX, 366 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3492
505 0 _aLACL -- 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.
520 _aEdited in collaboration with FoLLI, the Association of Logic, Language and Information, this book inaugurates the new FoLLI LNAI subline. It constitutes the refereed proceedings of the 5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005, held in Bordeaux, France in April 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aTranslators (Computer programs).
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLanguage Translation and Linguistics.
700 1 _aBlache, Philippe.
_eeditor.
700 1 _aStabler, Edward.
_eeditor.
700 1 _aBusquets, Joan.
_eeditor.
700 1 _aMoot, Richard.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540257837
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3492
856 4 0 _uhttp://dx.doi.org/10.1007/b136076
942 _2EBK3735
_cEBK
999 _c33029
_d33029