<?xml version="1.0" standalone="yes"?>
<Paper uid="P94-1022">
  <Title>Capturing CFLs with Tree Adjoining</Title>
  <Section position="2" start_page="0" end_page="161" type="abstr">
    <SectionTitle>
Grammars
Abstract
</SectionTitle>
    <Paragraph position="0"> We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LC, FGs of Schabes and Waters but with considerably less restriction on the form of the grammars. The class provides a nornlal form for TAGs that generate local sets m rnuch the same way that regular grammars provide a normal form for CFGs that generate regular sets.</Paragraph>
    <Paragraph position="1"> Introduction We introduce the notion of Regular Form for Tree Adjoining (;rammars (TA(;s). The class of TAGs that are in regular from is equivalent in strong generative capacity 1 to the Context-Free Grammars, that is, the sets of trees generated by TAGs in this class are the local sets--the sets of derivation trees generated by CFGs. 2 Our investigations were initially motivated by the work of Schabes, Joshi, and Waters in lexicalization of CFGs via TAGs (Schabes and Joshi, 1991; Joshi and Schabes, 1992; Schabes and Waters, 1993a; Schabes and Waters, 1993b; Schabes, 1990). The class we describe not only serves to lexicalize CFGs in a way that is more faithtiff and more flexible in its encoding than earlier work, but provides a basis for using the more expressive TAG formalism to define Context-Free Languages (CFLs.) In Schabes et al. (1988) and Schabes (1990) a general notion of lexicalized grammars is introduced. A grammar is lexicalized in this sense if each of the basic structures it manipulates is associated with a lexical item, its anchor. The set of structures relevant to a particular input string, then, is selected by the lexical *The work reported here owes a great deal to extensive discussions with K. Vijay-Shanker.</Paragraph>
    <Paragraph position="2"> 1 We will refer to equivalence of the sets of trees generated by two grammars or classes of grammars as strong equivalence. Equivalence of their string languages will be referred to as weak equivalence.</Paragraph>
    <Paragraph position="3"> 2Technically, the sets of trees generated by TAGs in the class are recognizable sets. The local and recognizable sets are equivalent modulo projection. We discuss the distinction in the next section.</Paragraph>
    <Paragraph position="4"> items that occur in that string. There are a number of reasons for exploring lexicalized grammars. Chief among these are linguistic considerations--lexicalized grammars reflect the tendency in many current syntactic theories to have the details of the syntactic structure be projected from the lexicon. There are also practical advantages. All lexicalized grammars are finitely ambiguous and, consequently, recognition for them is decidable. Further, lexicalization supports strategies that can, in practice, improve the speed of recognition algorithms (Schabes et M., 1988).</Paragraph>
    <Paragraph position="5"> One grammar formalism is said to lezicalize another (Joshi and Schabes, 1992) if for every grammar in the second formalism there is a lexicalized grammar in the first that generates exactly the same set of structures. While CFGs are attractive for efficiency of recognition, Joshi and Schabes (1992) have shown that an arbitrary CFG cannot, in general, be converted into a strongly equivalent lexiealized CFG. Instead, they show how CFGs can be lexicalized by LTAGS (Lexicalized TAGs). While the LTAG that lexicalizes a given CFG must be strongly equivalent to that CFG, both the languages and sets of trees generated by LTAGs as a class are strict supersets of the CFLs and local sets. Thus, while this gives a means of constructing a lexicalized grammar from an existing CFG, it does not provide a direct method for constructing lexicalized grammars that are known to be equivalent to (unspecified) CFGs.</Paragraph>
    <Paragraph position="6"> Furthermore, the best known recognition algorithm for LTAGs runs in O(n 6) time.</Paragraph>
    <Paragraph position="7"> Schabes and Waters (1993a; 1993b) define Lexicalized Context-Free Grammars (LCFGs), a class of lexicalized TAGs (with restricted adjunction) that not only lexicalizes CFGs, but is cubic-time parsable and is weakly equivalent to CFGs. These LCFGs have a couple of shortcomings. First, they are not strongly equivalent to CFGs. Since they are cubic-time parsable this is primarily a theoretical rather than practical concern. More importantly, they employ structures of a highly restricted form. Thus the restrictions of the formalism, in some cases, may override linguistic considerations in constructing the grammar. Clearly any class of TAGs that are cubic-time parsable, or that are equivalent in  any sense to CFGs, must be restricted in some way.</Paragraph>
    <Paragraph position="8"> The question is what restrictions are necessary.</Paragraph>
    <Paragraph position="9"> In this paper we directly address the issue of identifying a class of TAGs that are strongly equivalent to CFGs. In doing so we define such a class--TAGs in regular form--that is decidable, cubic-time parsable, and lexicalizes CFGs. Further, regular form is essentially a closure condition on the elementary trees of the TAG. Rather than restricting the form of the trees that can be employed, or the mechanisms by which they are combined, it requires that whenever a tree with a particular form can be derived then certain other related trees must be derivable as well. The algorithm for deciding whether a given grammar is in regular form can produce a set of elementary trees that will extend a grammar that does not meet the condition to one that does. 3 Thus the grammar can be written largely on the basis of the linguistic structures that it is intended to capture. We show that, while the LCFGs that are built by Schabes and Waters's algorithm for lexicalization of CFGs are in regular form, the restrictions they employ are unnecessarily strong.</Paragraph>
    <Paragraph position="10"> Regular form provides a partial answer to the more general issue of characterizing the TAGs that generate local sets. It serves as a normal form for these TAGs in the same way that regular grammars serve as a normal form for CFGs that generate regular languages. While for every TAG that generates a local set there is a TAG in regular form that generates the same set, and every TAG in regular form generates a local set (modulo projection), there are TAGs that are not in regular form that generate local sets, just as there are CFGs that generate regular languages that are not regular grammars. null The next section of this paper briefly introduces notation for TAGs and the concept of recognizable sets.</Paragraph>
    <Paragraph position="11"> Our results on regular form are developed in the subsequent section. We first define a restricted use of the adjunction operation--derivation by regular adjunction-which we show derives only recognizable sets. We then define the class of TAGs in regular form and show that the set of trees derivable in a TAG of this form is derivable by regular adjunction in that TAG and is therefore recognizable. We next show that every local set can be generated by a TAG in regular form and that Schabes and Waters's construction for LCFGs in fact produces TAGs in regular form. Finally, we provide an algorithm for deciding if a given TAG is in regular form. We close with a discussion of the implications of this work with respect to the lexicalization of CFGs and the use of TAGs to define languages that are strictly context-free, and raise the question of whether our results can be strengthened for some classes of TAGs.</Paragraph>
    <Paragraph position="12"> 3Although the result of this process is not, in general, equivalent to the original grammar.</Paragraph>
    <Section position="1" start_page="155" end_page="156" type="sub_section">
      <SectionTitle>
Preliminaries
Tree Adjoining Grammars
</SectionTitle>
      <Paragraph position="0"> Formally, a TAG is a five-tuple (E, NT, I, A, S / where: E is a finite set of terminal symbols, NT is a finite set of non-terminal symbols, I is a finite set of elementary initial trees, A is a finite set of elementary auxiliary trees, S is a distinguished non-terminal, the start symbol.</Paragraph>
      <Paragraph position="1"> Every non-frontier node of a tree in I t3 A is labeled with a non-terminal. Frontier nodes may be labeled with either a terminal or a non-terminal. Every tree in A has exactly one frontier node that is designated as its foot. This must be labeled with the same non-terminal as the root. The auxiliary and initial trees are distinguished by the presence (or absence, respectively) of a foot node. Every other frontier node that is labeled with a non-terminal is considered to be marked for substitution. In a lexicalized TAG (LTAG) every tree in I tO A must have some frontier node designated the anchor, which must be labeled with a terminal.</Paragraph>
      <Paragraph position="2"> Unless otherwise stated, we include both elementary and derived trees when referring to initial trees and auxiliary trees. A TAG derives trees by a sequence of substitutions and adjunctions in the elementary trees.</Paragraph>
      <Paragraph position="3"> In substitution an instance of an initial tree in which the root is labeled X E NT is substituted for a frontier node (other than the foot) in an instance of either an initial or auxiliary tree that is also labeled X. Both trees may be either an elementary tree or a derived tree.</Paragraph>
      <Paragraph position="4"> In adjunction an instance of an auxiliary tree in which the root and foot are labeled X is inserted at a node, also labeled X, in an instance of either an initial or auxiliary tree as follows: the subtree at that node is excised, the auxiliary tree is substituted at that node, and the excised subtree is substituted at the foot of the auxiliary tree. Again, the trees may be either elementary or derived.</Paragraph>
      <Paragraph position="5"> The set of objects ultimately derived by a TAG 6' is T(G), the set of completed initial trees derivable in (;. These are the initial trees derivable in G in which tile root is labeled S and every frontier node is labeled with a terminal (thus no nodes are marked for substitution.) We refer to the set of all trees, both initial and auxiliary, with or without nodes marked for substitution, that are derivable in G as TI(G). The language derived by G is L(G) the set of strings in E* that are the yields of trees in T(G).</Paragraph>
      <Paragraph position="6"> In this paper, all TAGs are pure TAGs, i.e., without adjoining constraints. Most of our results go through for TAGs with adjoining constraints as well, but there is much more to say about these TAGs and the implications of this work in distinguishing the pure TACs from TAGs in general. This is a part of our ongoing research.</Paragraph>
      <Paragraph position="7"> The path between the root and foot (inclusive) of an auxiliary tree is referred to as its spine. Auxiliary trees  in which no node on the spine other than the foot is labeled with the same non-terminal as the root we call a prvper auxiliary tree.</Paragraph>
      <Paragraph position="8"> Lemma 1 For any TAG G there is a TAG G' that includes no improper elementary trees ,such that T(G) is a projection ofT((7').</Paragraph>
      <Paragraph position="9"> Proof (Sketch): The grammar G can be relabeled with symbols in {(x,i} \[ x E E U NT, i E {0, 1}} to form G'. Every auxiliary tree is duplicated, with the root and foot labeled (X,O) in one copy and (X, 1} in the other. Improper elementary auxiliary trees can be avoided by appropriate choice of labels along the spine. \[\] The labels in the trees generated by G' are a refinement of the labels of the trees generated by G. Thus (7 partitions the categories assigned by G into sub-categories on the basis of (a fixed amount of) context. While the use here is technical rather than natural, the al)proach is familiar, as in the use of slashed categories to handle movement.</Paragraph>
    </Section>
    <Section position="2" start_page="156" end_page="156" type="sub_section">
      <SectionTitle>
Recognizable Sets
</SectionTitle>
      <Paragraph position="0"> The local sets are formally very closely related to the recognizable sets, which are somewhat more convenient to work with. These are sets of trees that are accepted by finite-state tree automata (G~cseg and Steinby, 1984). If E is a finite alphabet, a Z-valued tree is a finite, rooted, left-to-right ordered tree, the nodes of which are labeled with symbols in E. We will denote such a tree in which the root is labeled o&amp;quot; and in which the subtrees at the children of the root are tl,..., tn as cr(tl,...,t,,). The set of all E-valued trees is denoted A (non-deterministic) bottom-up finite state tree automaton over E-valued trees is a tuple (E,Q, M, F) where: e is a finite alphabet, Q is a finite set of states, F is a subset of Q, the set of final states, and M is a partial flmction from I3 x Q* to p(Q) (the powerset of Q) with finite domain, the transition function.</Paragraph>
      <Paragraph position="1"> The transition function M associates sets of states with alphabet symbols. It induces a function that associates sets of states with trees, M : T~ ~ P(Q), such that:</Paragraph>
      <Paragraph position="3"> of states qo, *.., q, such that qi E M(ti), for 0 &lt; i &lt; n, and q E M(a, qo ..... q,~).</Paragraph>
      <Paragraph position="4"> An automaton A = (E,Q, M, F} accepts a tree t E TE iff, by definition, FIq-'M(t) is not empty. The set of trees accepted by an automaton .,4 is denoted T(A).</Paragraph>
      <Paragraph position="5"> A set of trees is recognizable iff, by definition, it is T(A) for some automaton .A.</Paragraph>
      <Paragraph position="6"> Lemma 2 (Thatcher, 1967) Every local set is recognizable. Every recognizable set is the projection of some local set.</Paragraph>
      <Paragraph position="7"> The projection is necessary because the automaton can distinguish between nodes labeled with the same symbol while the CFG cannot. The set of trees (with bounded branching) in which exactly one node is labeled A, for instance, is recognizable but not local. It is, however, the projection of a local set in which the labels of the nodes that dominate the node labeled A are distinguished from the labels of those that don't. As a corollary of this lemma, the path set of a recognizable (or local) set, i.e., the set of strings that label paths in the trees in that set, is regular.</Paragraph>
      <Paragraph position="8"> TAGs in Regular Form</Paragraph>
    </Section>
    <Section position="3" start_page="156" end_page="157" type="sub_section">
      <SectionTitle>
Regular Adjunction
</SectionTitle>
      <Paragraph position="0"> The fact that the path sets of recognizable sets must be regular provides our basic approach to defining a class of TAGs that generate only recognizable sets. We start with a restricted form of adjunction that can generate only regular path sets and then look for a class of TAGs that do not generate any trees that cannot be generated with this restricted form of adjunction.</Paragraph>
      <Paragraph position="1"> Definition 1 Regular adjunction is ordinary adjunction restricted to the following cases: * any auxiliary tree may be adjoined into any initial tree or at any node that is not on the spine of an auxiliary tree, * any proper auxiliary tree may be adjoined into any auxiliary tree at the root or fool of that tree, * any auxiliary tree 7t may be adjoined at any node along the spine of any auxiliary tree 72 provided that no instance of 3'2 can be adjoined at any node along the spine of 71.</Paragraph>
      <Paragraph position="2"> In figure 1, for example, this rules out adjunction of /31 into the spine of/33, or vice versa, either directly or indirectly (by adjunction of/33, say, into f12 and then adjunction of the resulting auxiliary tree into fit-) Note that, in the case of TAGs with no improper elementary auxiliary trees, the requirement that only proper auxiliary trees may be adjoined at the root or foot is not actually a restriction. This is because the only way to derive an improper auxiliary tree in such a TAG without violating the other restrictions on regular adjunction is by adjunction at the root or foot. Any sequence of such adjunctions can always be re-ordered in a way which meets the requirement.</Paragraph>
      <Paragraph position="3"> We denote the set. of completed initial trees derivable by regular adjunetion in G as TR(G). Similarly, we denote the set of all trees that are derivable by regular adjunction in G as T~(G). As intended, we can show that TR(G) is always a recognizable set. We are looking, then, for a class of TAGs for which T(G) = TR(G) for every G in the class. Clearly, this will be the case if</Paragraph>
      <Paragraph position="5"> ular adjunction, if one treats adjunction at the root or foot as substitution, there is a fixed bound, dependent only on G, on the depth to which auxiliary trees can be nested. Thus the nesting of the auxiliary trees can be tracked by a fixed depth stack. Such a stack can be encoded in a finite set of states. It's reasonably easy to see, then, how G can be compiled into a bottom-up finite state tree automaton, t3 Since regular adjunction generates only recognizable sets, and thus (modulo projection) local sets, and since CFGs can be parsed in cubic time, one would hope that TAGs that employ only regular adjunction can be parsed in cubic time as well. In fact, such is the case.</Paragraph>
      <Paragraph position="6"> Proposition 2 If G is a TAG for which T(G) = TR(G) then there is a algorithm that recognizes strings in L(G) in time proportional to the cube of the length of the string. 4 Proof(Sketch): This, again, follows from the fact that the depth of nesting of auxiliary trees is bounded in regular adjunction. A CKY-style style parsing algorithm for TAGs (the one given in Vijay-Shanker and Weir (1993), for example) can be modified to work with a two-dimensionM array, storing in each slot \[i, j\] a set of structures that encode a node in an elementary tree that can occur at the root of a subtree spanning the input from position i through j in some tree derivable in G, along with a stack recording the nesting of elementary auxiliary trees around that node in the derivation of that tree. Since the stacks 4This result was suggested by K. Vijay-Shanker.</Paragraph>
      <Paragraph position="7"> are bounded the amount of data stored in each node is independent of the input length and the algorithm executes in time proportional to the cube of the length of the input, o</Paragraph>
    </Section>
    <Section position="4" start_page="157" end_page="161" type="sub_section">
      <SectionTitle>
Regular Form
</SectionTitle>
      <Paragraph position="0"> We are interested in classes of TAGs for which T'(G) = T~(G). One such class is the TAGs in regular form.</Paragraph>
      <Paragraph position="1"> Definition 2 A TAG is in regular form if\[ whenever a completed auxiliary tree of the form 71 in Figure 2 is derivable, where Xo ~PS xl ~ x2 and no node labeled X occurs properly between xo and xl, then trees of the form 72 and 73 are derivable as well.</Paragraph>
      <Paragraph position="2"> Effectively, this is a closure condition oll the elementary trees of the grammar. Note that it immediately implies that every improper elementary auxiliary tree in a regular form TAG is redundant. It is also easy to see, by induction on the number of occurrences of X along the spine, that any auxiliary tree 7 for X that is derivable in G can be decomposed into the concatenation of a sequence of proper auxiliary trees for X each of which is derivable in G. We will refer to the proper auxiliary trees in this sequence as the proper segments of 7.</Paragraph>
      <Paragraph position="3"> Lemina 3 Suppose G is a TAG in regular form. Then</Paragraph>
      <Paragraph position="5"> Proof: Suppose 7 is any non-elementary auxiliary tree derivable by unrestricted adjunction in G and that any smaller tree derivable in (7, is derivable by regular adjunction in G. If'/is proper, then it is clearly derivable from two strictly smaller trees by regular adjunction, each of which, by the induction hypothesis, is in T~(G).</Paragraph>
      <Paragraph position="6"> If 7 is improper, then it has the form of 71 in Figure 2 and it is derivable by regular adjunction of 72 at the root of'/3. Since both of these are derivable and strictly  smaller than 7 they are in T~(G). It follows that 7 is in T~(G') as well. \[\] Lemma 4 Suppose (; is a TAG with no improper elementary trees and T'(G) = T'R(G ). Then G is in regular form.</Paragraph>
      <Paragraph position="7"> Proofi Suppose some 7 with the form of 7l in Figure 2 is derivable in G and that for all trees 7' that are smaller than 7 every proper segment of 7' is derivable in G'. By assumption 7 is not elementary since it is improper. Thus, by hypothesis, 7 is derivable by regular adjunction of some 7&amp;quot; into some 7' both of which are derivable in (/.</Paragraph>
      <Paragraph position="8"> Suppose 7&amp;quot; adjoins into the spine of 7' and that a node labeled X occurs along the spine of 7&amp;quot;. Then, by the definition of regular adjunction, 7&amp;quot; must be adjoined at. either tile root or foot of 7'. Thus both 7' and 7&amp;quot; consist of sequences of consecutive proper segments of 7 with 7&amp;quot; including t and the initial (possibly empty) portion of u and 7' including the remainder of u or vice versa. In either case, by the induction hypothesis, every proper segment of both 7' and 7&amp;quot;, and thus every proper segment of 7 is derivable in G. Then trees of the forrn 72 and 73 are derivable from these proper segments.</Paragraph>
      <Paragraph position="9"> Suppose, on the other hand, that 7&amp;quot; does not adjoin along the spine of 7 ~ or that no node labeled X occurs along tile spine of 7&amp;quot;- Note that 7&amp;quot; must occur entirely within a proper segment of 7. Then 7' is a tree with the form of 71 that is smaller than 7. From the induction hypothesis every proper segment of 7 ~ is derivable in (;. It follows then that every proper segment of 7 is derivable in G, either because it is a proper segment of 7' or because it is derivable by aC/0unction of 7&amp;quot; into a proper segment of 7'- Again, trees of the form &amp;quot;r2 and 7a are derivable from these 1)roper segments. \[\] Regular Form and Local Sets The class of TAGs in regular form is related to the local sets in much the same way that the class of regular grammars is related to regular languages. Every TAG in regular form generates a recognizable set. This follows from Lemma 3 and Proposition 1. Thus, modulo projection, every TAG in regular form generates a local set. C, onversely, the next proposition establishes that every local set can be generated by a TAG in regular form. Thus regular form provides a normal form for TAGs that generate local sets. It is not the case, however, that all TAGs that generate local sets are in regular form.</Paragraph>
      <Paragraph position="10"> Proposition 3 For every CFG G there is a TAG G' in regular form such that the set of derivation trees for G is exactly T(G').</Paragraph>
      <Paragraph position="11"> Proof: This is nearly immediate, since every CFG is equivalent to a Tree Substitution Grammar (in which all trees are of depth one) and every Tree Substitution Grammar is, in the definition we use here, a TAG with no elementary auxiliary trees. It follows that this TAG can derive no auxiliary trees at all, and is thus vacuously in regular form. \[\] This proof is hardly satisfying, depending as it does on the fact that TAGs, as we define them, can employ substitution. The next proposition yields, as a corollary, the more substantial result that every CFG is strongly equivalent to a TAG in regular form in which substitution plays no role.</Paragraph>
      <Paragraph position="12"> Proposition 4 The class of TAGs in regular form can lexicalize CFGs.</Paragraph>
      <Paragraph position="13"> Proof: This follows directly from the equivalent lemma in Schabes and Waters (1993a). The construction given there builds a left-corner derivation graph (LCG). Vertices in this graph are the terminals and non-terminals of G. Edges correspond to the productions of G in the following way: there is an edge from X to Y labeled X ---* Ya iff X ---* Ya is a production in G. Paths through this graph that end on a terminal characterize the left-corner derivations in G. The construction proceeds by building a set of elementary initial trees corresponding to the simple (acyelic) paths through the LCG that end on terminals. These capture the non-recursive left-corner derivations in G. The set of auxiliary trees is built in two steps. First, an auxiliary tree is constructed for every simple cycle in the graph. This gives a set of auxiliary trees that is sufficient, with the initial trees, to derive every tree generated by the CFG. This set of auxiliary trees, however, may include some which are not lexicalized, that is, in which every frontier node other than the foot is marked for substitution. These can be lexicalized by substituting every corresponding elementary initial tree at one of those frontier nodes. Call the LCFG constructed for G by this method G'. For our purposes, the important point of the construction is that every simple cycle in the LCG is represented by an elementary auxiliary tree.</Paragraph>
      <Paragraph position="14"> Since the spines of auxiliary trees derivable in G' correspond to cycles in the LCG, every proper segment of an auxiliary tree derivable in G' is a simple cycle in the LCG. Thus every such proper segment is derivable in G' and G' is in regular form. \[\] The use of a graph which captures left-corner derivations as the foundation of this construction guarantees that the auxiliary trees it builds will be left-recursive (will have the foot as the left-most leaf.) It is a requirement of LCFGs that all auxiliary trees be either leftor right-recursive. Thus, while other derivation strategies may be employed in constructing the graph, these must always expand either the left- or right-most child at each step. All that is required for the construction to produce a TAG in regular form, though, is that every simple cycle in the graph be realized in an elementary tree. The resulting grammar will be in regular form no  matter what (complete) derivation strategy is captured ill the graph. In particular, this admits the possibility of generating an LTAG in which the anchor of each elementary tree is some linguistically motivated &amp;quot;head&amp;quot;. Corollary 1 For every CFG G there is a TAG G ~ in regular form in which no node is marked for substitution, such that the set of derivation trees for G is exactly T(G').</Paragraph>
      <Paragraph position="15"> This follows from the fact that the step used to lexicalize the elementary auxiliary trees in Schabes and Waters's construction can be applied to every node (in both initial and auxiliary trees) which is marked for substitution. Paradoxically, to establish the corollary it is not necessary for every elementary tree to be lexicalized. In Schabes and Waters's lemma G is required to be finitely ambiguous and to not generate the empty string. These restrictions are only necessary if G ~ is to be lexicalized. Here we can accept TAGs which include elementary trees in which the only leaf is the foot node or which yield only the empty string. Thus the corollary applies to all CFGs without restriction.</Paragraph>
      <Paragraph position="16"> Regular Form is Decidable We have established that regular form gives a class of TAGs that is strongly equivalent to CFGs (modulo projection), and that LTAGs in this class lexicalize CFGs. In this section we provide an effective procedure for deciding if a given TAG is in regular form. The procedure is based on a graph that is not unlike the LCG of the construction of Schabes and Waters.</Paragraph>
      <Paragraph position="17"> If G is a TAG, the Spine Graph of G is a directed multi-graph on a set of vertices, one for each non-terminal in G. If Hi is an elementary auxiliary tree in G and the spine of fli is labeled with the sequence of non-terminals (Xo, X1,..., Xn) (where X0 = Xn and the remaining Xj are not necessarily distinct), then there is an edge in the graph from each Xj to Xj+I labeled (Hi, J, ti,j), where ti,j is that portion of Hi that is dominated by Xj but not properly dominated by Xj+I.</Paragraph>
      <Paragraph position="18"> There are no other edges in the graph except those corresponding to the elementary auxiliary trees of G in this way.</Paragraph>
      <Paragraph position="19"> The intent is for the spine graph of G to characterize the set of auxiliary trees derivable in G by adjunction along the spine. Clearly, any vertex that is labeled with a non-terminal for which there is no corresponding auxiliary tree plays no active role in these derivations and can be replaced, along with the pairs of edges incident on it, by single edges. Without loss of generality, then, we assume spine graphs of this reduced form. Thus every vertex has at least one edge labeled with a 0 in its second component incident from it.</Paragraph>
      <Paragraph position="20"> A well-formed-cycle (wfc) in this graph is a (nonempty) path traced by the following non-deterministic automaton: * The automaton consists of a single push-down stack.</Paragraph>
      <Paragraph position="21"> Stack contents are labels of edges in the graph.</Paragraph>
      <Paragraph position="22"> * The automaton starts on any vertex of the graph with an empty stack.</Paragraph>
      <Paragraph position="23"> * At each step, the automaton can move as follows: - If there is an edge incident from the current vertex labeled (ill, O, ti,o) the automaton can push that label onto the stack and move to the vertex at the far end of that edge.</Paragraph>
      <Paragraph position="24"> - If the top of stack contains (fli,j, tis) and there is an edge incident from the current vertex labeled (fli,j+ 1,ti,j+l) the automaton may pop the top of stack, push (Hi,j-t-l,ti,j+l) and move to the vertex at the end of that edge.</Paragraph>
      <Paragraph position="25"> - If the top of stack contains (Hi,j, ti,j) but there is no edge incident from the current vertex labeled (Hi,J + 1,ti,j+l) then the automaton may pop the top of stack and remain at the same vertex.</Paragraph>
      <Paragraph position="26"> * The automaton may halt if its stack is empty.</Paragraph>
      <Paragraph position="27"> * A path through the graph is traced by the automaton if it starts at the first vertex in the path and halts at the last vertex in the path visiting each of the vertices in the path in order.</Paragraph>
      <Paragraph position="28"> Each wfc in a spine graph corresponds to the auxiliary tree built by concatenating the third components of the labels on the edges in the cycle in order. Then every wfc in the spine graph of G corresponds to an auxiliary tree that is derivable in G by adjunction along the spine only. Conversely, every such auxiliary tree corresponds to some wfc in the spine graph.</Paragraph>
      <Paragraph position="29"> A simple cycle in the spine graph, by definition, is any minimal cycle in the graph that ignores the labels of the edges but not their direction. Simple cycles correspond to auxiliary trees in the same way that wfcs do. Say that two cycles in the graph are equivalent iff they correspond to the same auxiliary tree. The simple cycles in the spine graph for G correspond to the minimal set of elementary auxiliary trees in any presentation of G that is closed under the regular form condition in tile following way.</Paragraph>
      <Paragraph position="30"> Lemma 5 A TAG G is in regular form iff every simple cycle in its spine graph is equivalent to a wfc in that graph.</Paragraph>
      <Paragraph position="31"> Proof: (If every simple cycle is equivalent to a wfc then (; is in regular form.) Suppose every simple cycle in the spine graph of (; is equivalent to a wfc and some tree of the form 71 in Figure 2 is derivable in G. Wlog, assume the tree is derivable by adjunction along the spine only. Then there is a wfc in the spine graph of G corresponding to that tree that is of the form (Xo,...,Xk,...,X,,) where X0 = Xk = Xn, 0 :~ k # n, and Xi # Xo for all0 &lt; i &lt; k. Thus (X0 .... ,Xk) is asimple cycle in the spine graph. Further, (Xk ..... Xn) is a sequence of one or more such simple cycles. It follows that both (X0,...,Xk) and (Xk,...,Xn) are wfc in tile  (;.</Paragraph>
      <Paragraph position="32"> (If (; is in regular form then every simple cycle corresponds to a wfc.) Assume, wlog, tile spine graph of G is connected. (If it is not we can treat G as a union of grammars.) Since the spine graph is a union of wfcs it has an Eulerian wfc (in tile usual sense of Eulerian). Further, since every w~rl, ex is the initial vertex of some wfc, every vertex is tile initial vertex of some Eulerian wfc.</Paragraph>
      <Paragraph position="33"> Suppose there is some simple cycle</Paragraph>
      <Paragraph position="35"> ... x~ (f~,, t,, t~) x0 where the Xj are the vertices and the tuples are the labels on the edges of the cycle. Then there is a wfc starting at Xo that includes the edge (flo, 10, to), although not necessarily initially. In particular the Eulerian wfc starting at X0 is such a wfc. This corresponds to a derivable auxiliary tree that includes a proper segment beginning with to. Since G is in regular form, that proper segment is a derivable auxiliary tree. Call this 7o (see Figure 3.) The spine of that tree is labeled X0,X1,...,X0, where anything (other than X0) can occur in the ellipses.</Paragraph>
      <Paragraph position="36"> The same cycle can be rotated to get a simple cycle starting at each of the Xj. Thus for each Xj there is a derivable auxiliary tree starting with tj. Call it 73&amp;quot;. By a sequence of adjunctions of each 7j at the second node on the spine of 7j-1 an auxiliary tree for X0 is derivable in which the first proper segment is the concatenation of tO, tl,...,tn.</Paragraph>
      <Paragraph position="37"> Again, by the fact that G is in regular form, this proper segment is derivable in G. Hence there is a wfc in the spine graph corresponding to this tree. \[\] Proposition5 For any TAG G the question of whetherG is in regular form is decidable. Further, there is an effective procedure that, given any TAG, will extend it to a TAG that is in regular form.</Paragraph>
      <Paragraph position="38"> Proof.&amp;quot; Given a TAG G we construct its spine graph. Since the TAG is finite, the graph is as well. The TAG is in regular form iff every simple cycle is equivalent to a wfc. This is clearly decidable. Further, the set of elementary trees corresponding to simple cycles that are not equivalent to wfcs is effectively constructible. Adding that set to the original TAG extends it to regular form. \[\] Of course the set of trees generated by the extended TAG may well be a proper superset of the set generated by the original TAG.</Paragraph>
      <Paragraph position="39">  The LCFGs of Schabes and Waters employ a restricted form of adjunction and a highly restricted form of elementary auxiliary tree. The auxiliary trees of LCFGs can only occur in left- or right-recursive form, that is, with the foot as either the left- or right-most node on the frontier of the tree. Thus the structures that can be captured in these trees are restricted by the mechanism itself, and Schabes and Waters (in (1993a)) cite two situations where an existing LTAG grammar for English (Abeill@ et at., 1990) fails to meet this restriction. But while it is sufficient to assure that the language generated is context-free and cubic-time parsable, this restriction is stronger than necessary.</Paragraph>
      <Paragraph position="40"> TAGs in regular form, in contrast, are ordinary TAGs utilizing ordinary adjunction. While it is developed from the notion of regular adjunction, regular form is just a closure condition on the elementary trees of the grammar. Although that closure condition assures that all improper elementary auxiliary trees are redundant, the form of the elementary trees themselves is unrestricted. Thus the structures they capture can be driven primarily by linguistic considerations. As we noted earlier, the restrictions on the form of the trees in an LCFG significantly constrain the way in which CFGs can be lexicalized using Schabes and Waters's construction. These constraints are eliminated if we require only that the result be in regular form and the lexicalization can then be structured largely on linguistic principles.</Paragraph>
      <Paragraph position="41">  On the other hand, regular form is a property of the grammar as a whole, while the restrictions of LCFG are restrictions on individual trees (and the manner in which they are combined.) Consequently, it is immediately obvious if a grammar meets the requirements of LCFG, while it is less apparent if it is in regular form. In the case of the LTAG grammar for English, neither of the situations noted by Schabes and Waters violate regular form themselves. As regular form is decidable, it is reasonable to ask whether the grammar as a whole is in regular form. A positive result would identify the large fragment of English covered by this grammar as strongly context-free and cubic-time parsable. A negative result is likely to give insight into those structures covered by the grammar that require context-sensitivity.</Paragraph>
      <Paragraph position="42"> One might approach defining a context-free language within the TAG formalism by developing a grammar with the intent that all trees derivable in the grammar be derivable by regular adjunction. This condition can then be verified by the algorithm of previous section. In the case that the grammar is not in regular form, the algorithm proposes a set of additional auxiliary trees that will establish that form. In essence, this is a prediction about the strings that would occur in a context-free language extending the language encoded by the original grammar. It is then a linguistic issue whether these additional strings are consistent with the intent of the grammar.</Paragraph>
      <Paragraph position="43"> If a grammar is not in regular form, it is not necessarily the case that it does not generate a recognizable set. The main unresolved issue in this work is whether it is possible to characterize the class of TAGs that generate local sets more completely. It is easy to show, for TAGs that employ adjoining constraints, that this is not possible. This is a consequence of the fact that one can construct, for any CFG, a TAG in which the path language is the image, under a bijeetive homomorphisrn, of the string language generated by that CFG. Since it is undecidable if an arbitrary CFG generates a regular string language, and since the path language of every recognizable set is regular, it is undecidable if an arbitrary TAG (employing adjoining constraints) generates a recognizable set. This ability to capture CFLs in the string language, however, seems to depend crucially on the nature of the adjoining constraints. It does not appear to extend to pure TAGs, or even TAGs in which the adjoining constraints are implemented as monotonically growing sets of simple features. In the case of TAGs with these limited adjoining constraints, then, the questions of whether there is a class of TAGs which includes all and only those which generate recognizable sets, or if there is an effective procedure for reducing any such TAG which generates a recognizable set to one in regular form, are open.</Paragraph>
    </Section>
  </Section>
class="xml-element"></Paper>