... dependencies that transformational grammars in their various incarnations have tried to account for can be satisfactorily captured by classes of rules that are non-transformational and at the same Clme ... this language (although for TAG's a proof is not in hand yet), LFG's can generate this language. In a TAG for each elementary tree, we can add mare elementary trees, systematically ... Se n ,'~ • 13 FACTORING RECURSION AND DEPENDENCIES: AN ASPECT OF TREE ADJOINING GRAMMARS (TAG) AND A COMPARISON OF SOME FORMAL PROPERTIES OF TAGS, GPSGS, PLGS, AND LPGS * Aravind K....