... parsing meth- ods, it could be relevant from the perspective of linguistic information processing, because it em- ploys lexical information in a more direct way. 1. Introduction Tree Adjoining ... follow- ing definition of TAGs. Definition 1 A Tree Adjoining Grammar (TAG) is a 5-tuple G=(VN, Vy, S, l, A), where VN is a finite set of non-terminal symbols, Vy is a finite set of terminal ... TAGs, in (Schabes et al., 1988) a two step algorithm has been presented: during the first step the trees corresponding to the input string are selected and in the second step the input string...