Sciweavers

GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 11 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
GRAMMARS
2000
97views more  GRAMMARS 2000»
13 years 11 months ago
Proof-Nets, Hybrid Logics and Minimalist Representations
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
Alain Lecomte
GRAMMARS
2000
56views more  GRAMMARS 2000»
13 years 11 months ago
Relaxing Underspecified Semantic Representations for Reinterpretation
Alexander Koller, Joachim Niehren, Kristina Strieg...
GRAMMARS
2000
89views more  GRAMMARS 2000»
13 years 11 months ago
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
Robert Frank, Seth Kulick, K. Vijay-Shanker