You have Guest access.
Log In
Philippe Blache, Edward Stabler, Joan Busquets and Richard Moot
Front matter
269-297
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages
43-51
Dependency Structure Grammars
137-146
Towards a Computational Treatment of Binding Theory
47-82
Translating Formal Software Specifications to Natural Language A Grammar-Based Approach
11-20
On the Selective Lambek Calculus
91-99
Grammatical Development with Xmg
147-165
Lambek-Calculus with General Elimination Rules and Continuation Semantics
3-10
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
83-89
Large Scale Semantic Construction for Tree Adjoining Grammars
101-110
A Compositional Approach Towards Semantic Representation and Construction of ARABIC
3-9
Strict Deterministic Aspects of Minimalist Grammars
177-188
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
113-122
Learnable Classes of General Combinatory Grammars
11-18
On Expressing Vague Quantification and Scalar Implicatures in the Logic of Partial Information
167-173
Describing Lambda Terms in Context Unification
21-27
Category Theoretical Semantics for Pregroup Grammars
299-319
Feature Constraint Logic and Error Detection in ICALL Systems
21-34
Linguistic Facts as Predicates over Ranges of the Sentence
321-332
How to Build Argumental Graphs Using TAG Shared Forest: A View from Control Verbs Problematic
123-136
When Categorial Grammars Meet Regular Grammatical Inference
317-329
The Expressive Power of Restricted Fragments of English
177-189
The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars
29-45
More Algebras for Determiners
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info