83 | -- | 87 | . Introduction |
89 | -- | 110 | Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemonte de la Clergerie. Tabulation of Automata for Tree-Adjoining Languages |
111 | -- | 131 | Pierre Boullier. A Cubic Time Extension of Context-Free Grammars |
133 | -- | 150 | Corinna Cortes, Mehryar Mohri. Context-Free Recognition with Weighted Automata |
151 | -- | 173 | Robert Frank, Seth Kulick, K. Vijay-Shanker. Monotonic C-Command: A New Perspective on Tree Adjoining Grammar |
175 | -- | 187 | Martin Kappes. Combining Contextual Grammars and Tree Adjoining Grammars |
189 | -- | 216 | Hans-Peter Kolb, Uwe Mönnich, Frank Morawietz. Descriptions of Cross-Serial Dependencies |
217 | -- | 241 | Alexander Koller, Joachim Niehren, Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation |
243 | -- | 257 | Alain Lecomte. Proof-Nets, Hybrid Logics and Minimalist Representations |
259 | -- | 273 | Rani Nelken, Nissim Francez. The Algebraic Semantics of Interrogative NPs |
275 | -- | 293 | Dick Oehrle. Context-Sensitive Node Admissibility |
295 | -- | 312 | Gerald Penn. The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures |