... define the syntax of natural lan- guages. On the other hand, there has been much effort to propose well-defined computa- tional models of transformational grammars. One of these is the one ... node v of a derivation tree is a finite set F of pairs of at- tribute names and their values. F is called the f- structure of v. An lfg G consists of a cfg Go called the underlying cfg of ... dc-lfg G, for each pair (tl, t2) of derivation trees in G, if the f-structure and nonterminal of the root of tl are the same as those of t2, then t] and t2 derive the same termi- nal string. Let...