Edited 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.
Author(s): Denis Béchet, Annie Foret (auth.), Philippe Blache, Edward Stabler, Joan Busquets, Richard Moot (eds.)
Series: Lecture Notes in Computer Science 3492 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005
Language: English
Pages: 366
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Language Translation and Linguistics
Front Matter....Pages -
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages....Pages 1-17
Dependency Structure Grammars....Pages 18-34
Towards a Computational Treatment of Binding Theory....Pages 35-50
Translating Formal Software Specifications to Natural Language....Pages 51-66
On the Selective Lambek Calculus....Pages 67-83
Grammatical Development with Xmg ....Pages 84-100
Lambek-Calculus with General Elimination Rules and Continuation Semantics....Pages 101-113
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars....Pages 114-130
Large Scale Semantic Construction for Tree Adjoining Grammars....Pages 131-146
A Compositional Approach Towards Semantic Representation and Construction of ARABIC....Pages 147-161
Strict Deterministic Aspects of Minimalist Grammars....Pages 162-176
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar....Pages 177-188
Learnable Classes of General Combinatory Grammars....Pages 189-204
On Expressing Vague Quantification and Scalar Implicatures in the Logic of Partial Information....Pages 205-220
Describing Lambda Terms in Context Unification....Pages 221-237
Category Theoretical Semantics for Pregroup Grammars....Pages 238-254
Feature Constraint Logic and Error Detection in ICALL Systems....Pages 255-270
Linguistic Facts as Predicates over Ranges of the Sentence....Pages 271-286
How to Build Argumental Graphs Using TAG Shared Forest: A View from Control Verbs Problematic....Pages 287-300
When Categorial Grammars Meet Regular Grammatical Inference....Pages 301-316
The Expressive Power of Restricted Fragments of English....Pages 317-329
The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars....Pages 330-346
More Algebras for Determiners....Pages 347-362
Back Matter....Pages -
