ABSTR.ACT We will describe an Earley-type parser for Tree Adjoining Grammars (TAGs). Although a CKY-type parser for TAGs has been developed earlier (Vijay-Shanker and :Icshi, 1985), this is the first practical parser for TAGs because as is well known for CFGs, the average behavior of Earley-type parsers is superior to that of CKY-type parsers. The core of the algorithm is described. Then we dis...

We present a treebank and lexicon for German and English, which have been developed for PLTAG parsing. PLTAG is a psycholinguistically motivated, incremental version of tree-adjoining grammar (TAG). The resources are however also applicable to parsing with other variants of TAG. The German PLTAG resources are based on the TIGER corpus and, to the best of our knowledge, constitute the first scal...

In this paper we apply a new notation for the writing of natural language grammars to some classical problems in the description of English. The formalism is the Tree Adjoining Grammar (TAG) of Joshi, Levy and Takahashi 1975, which was studied, initially only for its mathematical properties but which now turns out to be a interesting candidate for the proper notation of meta-grammar; that is fo...

Abstract. In relative clauses, the wh relative pronoun can be embedded in a larger phrase, as in “a boy [whose brother] Mary hit” and “a boy [whose brother’s friend] Mary hit”. In such examples, we say that the larger phrase containing the wh-word has pied-piped along with the wh-word. In this paper, using a similar syntactic analysis for wh pied-piping as in Han (2002) and further developed in...

We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k x k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but ...

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars ...

We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k × k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but ...

This paper describes a direct parser for Schema–Tree Adjoining Grammars (S–TAG) which explores schemata, i.e. underspecified elementary rules. Basically, a schema in a S–TAG represents a possibly infinite set of elementary rules by folding up all actual substructures and depicting them in terms of a regular expression (RX). Hence, S–TAGs provide a more condensed grammar representation. In the f...

We propose an O(M(n)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k × k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but a...

In the following the components of a workbench for the grommar formalism of Schema-Tree Adjoining Grammars (S-TAGs) are outlined. This workbench can also serve as a workbench for pure TA Gs because it provides a component which transforms an arbitrory TAG into an S-TAG in a non-trivial manner. Another interesting property of the workbench is that it provides a parser, which is realized as a rev...