LEADER 04122nam 2200589 a 450 001 9910768444803321 005 20200520144314.0 024 7 $a10.1007/b136076 035 $a(CKB)1000000000212922 035 $a(SSID)ssj0000318716 035 $a(PQKBManifestationID)11265692 035 $a(PQKBTitleCode)TC0000318716 035 $a(PQKBWorkID)10311055 035 $a(PQKB)10496936 035 $a(DE-He213)978-3-540-31953-5 035 $a(MiAaPQ)EBC3067523 035 $a(PPN)123094232 035 $a(EXLCZ)991000000000212922 100 $a20050318d2005 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogical aspects of computational linguistics $e5th international conference, LACL 2005, Bordeaux, France April 2005 : proceedings /$fPhilippe Blanche ... [et al.] (eds.) 205 $a1st ed. 2005. 210 $aBerlin $cSpringer$dc2005 215 $a1 online resource (X, 366 p.) 225 1 $aLecture notes in computer science 225 1 $aLecture notes in artificial intelligence,$x0302-9743 ;$v3492 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31953-0 311 $a3-540-25783-7 320 $aIncludes bibliographic references and index. 327 $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. 330 $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. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence ;$v3492. 410 0$aLecture notes in computer science. 606 $aComputational linguistics$vCongresses 606 $aLanguage and logic$vCongresses 615 0$aComputational linguistics 615 0$aLanguage and logic 676 $a410.285 701 $aBlache$b Philippe$01295256 712 12$aLACL 2005 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768444803321 996 $aLogical aspects of computational linguistics$94196996 997 $aUNINA