My Account Log in

1 option

Logical Aspects of Computational Linguistics : 5th International Conference, LACL 2005, Bordeaux, France, April 28-30, 2005, Proceedings / edited by Philippe Blache, Edward Stabler, Joan Busquets, Richard Moot.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Blache, Philippe, editor.
Stabler, Edward, editor.
Busquets, Joan, editor.
Moot, Richard, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science. Lecture notes in artificial intelligence ; 3492.
Lecture Notes in Artificial Intelligence ; 3492
Language:
English
Subjects (All):
Artificial intelligence.
Logic, Symbolic and mathematical.
Natural language processing (Computer science).
Artificial Intelligence.
Mathematical Logic and Formal Languages.
Natural Language Processing (NLP).
Local Subjects:
Artificial Intelligence.
Mathematical Logic and Formal Languages.
Natural Language Processing (NLP).
Physical Description:
1 online resource (X, 366 pages).
Edition:
First edition 2005.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-31953-5
9783540319535
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account