In this paper we investigate the incorporation of Tree Adjoining Grammars (TAG) into the systemic framework. We show that while systemic grammars have many desirable characteristics as a generation paradigm, they appear to have problems in generating certain kinds of sentences (e.g., those containing discontinuity or long-distance dependencies). We argue that these problems can be overcome with...

c. ∃e∃e′∃e′′∃s [causation(e) ∧CAUSE(e, e′) ∧ EFFECT(e, e′′) ∧ activity(e′) ∧ EFFECTOR(e′, x) ∧ change-of-state(e′′) ∧ RESULT(e′′, s) ∧ broken-state(s) ∧ PATIENT(s, y)] Case study: the English dative alternation (1) a. John sent Mary the book. (double object, DO) b. John sent the book to Mary. (prepositional object, PO) Traditional decompositional analysis: (2) a. [ [x ACT] CAUSE [z HAVE y] ] (c...

In recent years, there has been a lot of research on wide-coverage statistical natural language processing with linguistically expressive grammars such as Combinatory Categorial Grammars (CCG), Head-driven Phrase-Structure Grammars (HPSG), Lexical-Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG). But although many young researchers in natural language processing are very well trained...

Tabular parsers can be defined as deduction systems where formulas, called items, are sets of complete or incomplete constituents (Sikkel, 1997; Shieber, Schabes and Pereira, 1995). Formally, given an input string w = a1 . . . an with n ≥ 0 and a grammar G, a parser IP is a tuple (I,H,D) where I is a set of items, H is a set of hypothesis ([ai, i − 1, i] with 1 ≤ i ≤ n) that encodes the input s...

The ability to represent cross-serial dependencies is one of the central features of Tree Adjoining Grammar (TAG). The class of dependency structures representable by lexicalized TAG derivations can be captured by two graph-theoretic properties: a bound on the gap degree of the structures, and a constraint called well-nestedness. In this paper, we compare formalisms from two strands of extensio...

The predicate-argument structure (PAS) of a natural language sentence is a useful representation that can be used for a deeper analysis of the underlying meaning of the sentence or directly used in various natural language processing (NLP) applications. The task of semantic role labeling (SRL) is to identify the predicate-argument structures and label the relations between the predicate and eac...

Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting point for the study of such cross-derivational properties is the notion of consistency. The probability model de ned by a probabilistic grammar is said to be consistent if the probabilities assigned to all the strings...

This paper presents a logical formalization of Tree Adjoining Grammar (TAG). TAG deals with lexicalized trees and two operations are available: substitution and adjunction. Adjunction is generally presented as an insertion of one tree inside another, surrounding the subtree at the adjunction node. This seems to contradict standard logical ability. We prove that some logical formalisms, namely a...

This paper extends the “parsing as deduction” approach to tree-adjoining grammars by showing how a TAG recognition problem can be reduced to a Datalog deduction problem, and presents an SLD selection rule that makes the proof search correspond to a top-down parse using the original grammar. Just as in the DCG extension of context-free grammars, this approach permits nodes tn be labeled with fir...