<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1007">
  <Title>REFERENCES</Title>
  <Section position="1" start_page="0" end_page="0" type="metho">
    <SectionTitle>
THE REPRESENTATION OF CONSTITUENT STRUCTURES FOR FINITE-STATE PARSING
D. Terence Langendoen
</SectionTitle>
    <Paragraph position="0"/>
  </Section>
  <Section position="2" start_page="0" end_page="26" type="metho">
    <SectionTitle>
ABSTBACT
</SectionTitle>
    <Paragraph position="0"> A mixed prefix-postfix notation for representations of the constituent structures of the expressions of natural languages is proposed, which are of limited degree of center embedding if the original expressions are noncenter-embedding.</Paragraph>
    <Paragraph position="1"> The method of constructing these representations is applicable to expressions with center embedding, and results in representations which seem to reflect the ways in which people actually parse those expressions. Both the representations and their interpretations can be computed from the expressions from left to right by finite-state devices. null The class of acceptable expressions of a natural language L all manifest no more than a small, fixeR, finite degree n of center embedding. From this observation, it fo~lows that the ability of human beings to parse the expressions of L can be modeled by a finite transducer that associates with the acceptable expressions of L representations of the structural descriptions of those expressions. This paper considers some initial steps in the construction of such a model. The first step is to determine a method of representing the class of constituent structures of the expressions of L without center embedding in such a way that the members of that class themselves have no more than a small fixed finite degree of center embedding. Given a grammar that directly generates that class of constituent structures, it is not difficult to construct a deterministic finite-state transducer (parser) that assigns the appropriate members of that class to the noncenter-embedded expressions of L from left to right. The second step is to extend the method so that it is capable of representing the class of constituent structures of expressions of L with no more than degree n of center embedding in a manner which appears to accord with the way in which human beings actually parse those sentences. Given certain reasonable assumptions about the character of the rules of grammar of natural languages, we show how this step can also be taken.</Paragraph>
    <Paragraph position="2"> *This work was partly supported by a gran t from the PSC-CUNY Faculty Research Award Program.</Paragraph>
    <Paragraph position="3"> Let G be a context-free phrase-structure grammar (CFPSG). First, suppose that the category A in G is right-recursive; i.e., that there are subderivations with respect to G such that A ==~ X A, where X is a nonnull string of symbols (terminal, nonterminal, or mixed). We seek a new CFPSG G*, derived from G, that contains the category A* (corresponding to A), such that there are subderivations with respect to G* of the form A* ==8 X* A*, where X* represents the constituent structure of X with respect to G. Next, suppose that the category B in G is left-recursive; i.e., that there are subderivations with respect to G such that B ==~ B Y, where Y is nonnull. We seek a new CFPSG G*, derived from G, that contains the category B* (corresponding to B), such that there are subderivations with respect to G* of the form B* ==~ B* Y*, where Y* represents the constituent structure of Y with respect to G. In other words, given a grammar G, we seek a grammar G* that directly generates strings that represent the constituent structures of the noncenter-embedded expressions generated by G, that is right-recursive wherever G is right-recursive and is left-recursive wherever G is left-recursive.</Paragraph>
    <Paragraph position="4"> In order to find such a G*, we must first determine what kinds of strings are available that can represent constituent structures and at the same time can be directly generated by noncenter-embedding grammars. Full bracketing diagrams are not suitable, since grammars that generate them are center embedding whenever the original grammars are left- or right-recursive (Langendoen 1975). Suppose, however, that we leave off right brackets in right-recursive structures and left brackets in left-recursive structures. In right-recursive structures, the positions of the left brackets that remain indicate where each constituent begins; the position where each constituent ends can be determined by a simple counting procedure provided that the number of daughters of that constituent is known (e.g., when the original grammar is in Chomsky-normal-form). Similarly, in left-recursive structures, the positions of the right brackets that remain indicate where each constituent ends, and the position where each constituent begins can also be determined simply by counting. Moreover, since brackets no longer occur in matched pairs, the brackets themselves can be omitted, leaving only the category labels. In left-recursive structures, these category symbols occur as postfixes; in right-recursive structures,  they occur as prefixes. Let us call any symbol which occurs as a prefix or a postfix in a string that represents the constituent structure of an expression an affix; the strings themselves affixed strings; and the grammars that generate those strings affix gra1~ars.</Paragraph>
    <Paragraph position="5"> To see how affix grammars may be constructed, consider the noncenter-embedding CFPSG GI, which generates the artificial language L1 = a(b*a)*b*a.</Paragraph>
    <Paragraph position="6">  (G1) a. S * S A b. A * B A c. A ~ a d. B * b e. S ) a  A noncenter-embedding affix grammar that generates the affixed strings that represent the constituent structures of the expressions of L1 with respect to G1 is given in GI*.</Paragraph>
    <Paragraph position="7">  (GI*) a. S ~ ~ S* A* S b. A* * A B* A* c. A* &gt; A a d. B* * B b e. S ~ ~ S a Among the expressions generated by GI is El; the affixed string generated by GI* that represents its structural description is El*.</Paragraph>
    <Paragraph position="8"> (El) abbaba (El*) SaABbABbAaSABbAaS  Let us say that an affix covers elements in an affixed string which correspond to its constituents (not necessarily immediate). Then El* may be interpreted as a structural description of E1 with respect to GI according to the rules in R, in which J, K, and L are affixes; k is a word; x and y are substrings of affixed strings; and G is a CFPSG (in this case, GI).</Paragraph>
    <Paragraph position="9"> (R) a. If K ~ k is a rule of G, then in the configuration ... K k ..., K is a prefix which covers k.</Paragraph>
    <Paragraph position="10"> b. If J ~ K L is a rule of G, then in the configuration ... J K x L ..., in which x does not contain L, J is a prefix which covers K L.</Paragraph>
    <Paragraph position="11"> cdeg If J d K L is a rule of G, then in the configuration ... K x L y J ..., in which x does not contain L and y does not contain K, J is a postfix which covers K L.</Paragraph>
    <Paragraph position="12"> Coverage of constituents by the rules in R may be thought to be assigned dynamically from left to right.</Paragraph>
    <Paragraph position="13"> A postfix is used in rule Gl*a because the category S is left-recursive in GI, whereas a prefix is used in rule Gl*b because the category A is right-recursive in GI. The use of prefixes in rules Gl*c-e, on the other hand, is unmotivated if the only criteria for choosing an affix type have to do with direction of recursion. For affix grammars of natural languages, however, one can motivate the decision to use a particular type of affix by principles other than those having to do with direction of recursion.</Paragraph>
    <Paragraph position="14"> The use of a prefix can be interpreted as indicating a decision (or guess) on the part of the language user as to the identity of a particular constituent on the basis of the identity of the first constituent in it. Since lexical items are assigned to lexical categories essentially as soon as they are recognized (Forster 1976), we may suppose first that prefixes are used for rules such as those in Gl*c-e that assign lexical items to lexical categories. Second, if, as seems reasonable, a decision about the identity of constituents is always made as soon as possible, then we may suppose that prefixes are used for all rules in which the leftmost daughter of a particular constituent provides sufficient evidence for the identification of that constituent; e.g., if the leftmost daughter is either the specifier or the head of that constituent in the sense of Jackendoff (1977). Third, we may suppose that even if the leftmost daughter of a particular constituent does not provide sufficient evidence for the identification of that constituent, a prefix may still be used if that constituent is the left sister of a constituent that provides sufficient evidence for its identification. Fourth, we may suppose that postfixes are used in all other cases.</Paragraph>
    <Paragraph position="15"> To illustrate the use of these four principles, consider the noncenter-embedding partial grammar G2 that generates a fragment of English that we call L2.</Paragraph>
    <Paragraph position="16">  (G2) a. S ~ NP VP b. lip ~ D c.~ * ~g d.~ * ~c e. H &gt; N f. VP P V (\[~,C~) g. C P C S h. C , that i. D &gt; Zhe j. C k. ~ ~ {boss, child ...~ 1. V * {knew, saw ....</Paragraph>
    <Paragraph position="17"> * o s Among the expressions of L2 are those with both right-recursion and left-recursion, such as E2. (E2) the boss knew that the teacher's sis null ter's neighbor's friend believed that the student saw the child We now give an affix grammar G2* that directly generates affixed strings that represent the structural descriptions of the expressions of L2 with respect to G2, and that has been constructed in accordance with the four principles described above.</Paragraph>
    <Paragraph position="18">  (G2*) a. i. S* S NP* VP* I C that ii. S*----&gt; NP* VP* S / elsewhere b. NP* ~ NP D* N* c. NP*---~ G* N* NP e. ~*---~ R N* g. ~* ~ Uc*S* h. C* * C that i. 1~---~ D the j. G ~ &gt; G's k. N* * N ~child, house, ...~ 1. V ~ ) V ~k.new, saw, ---i  Rules G2Wh-I conform to the first principle, according to which lexical categories generally appear as prefixes. Rules G2*b,e-g conform to the second principle, according to which a category appears as a prefix if Its leftmost daughter in the corresponding rule of G2 is its head or specifier. Rule G2*ai conforms to the third principle, according to which a category appears as a prefix if its presence can be predicted from its right sister in G2. Finally, rules G2*aii,c,d conform to the fourth principle, according to which a category appears as a postfix if it cannot appear as a prefix according co the preceding three principles. null The affixed string that G2* generates as the representation of the structural description of E2 with respect to G2 is given in E2*.</Paragraph>
    <Paragraph position="19">  E2* can be interpreted as the structural description of E2 with respect to G2 by the rules in R, with the addition of a rule to handle unary non-lexical branching (as in G2e), and a modification of Rc to prevent a postfix from simply covering a sequence of affixes already covered by a prefix. (This restriction is needed to prevent the postfix S in E2* from simply covering any of the subordinate clauses in that expression.) It is worth noting how the application of those rules dynamically enlarges the NP that is covered by the S prefix that follows the words knew that. First the teacher is covered; then the teacher's sister; then the teacher's sister's neighbor; and finally the teacher's sister's neighbor's friend.</Paragraph>
    <Paragraph position="20"> The derivation of E2* manifests first-degree center embedding of the category S*, as a result of the treatment of S as both a prefix and a suffix in G2*. However, no derivation of an affixed string generated by G2* manifests any greater degree of center embedding; hence, the affixed strings associated with the expressions of L2 can still be assigned to them by a finite-state parser. The added complexity involved in interpreting E2* results from the fact that all but the first of the NP-VP sequences in E2* are covered by prefix Ss, so that the constituents covered by the postfix S in E2* according to rule Rc are considerably far away from it.</Paragraph>
    <Paragraph position="21"> It will be noted that we have provided two logically independent sets of principles by which affixed grammars may be constructed from a given CFPSG. The first set is explicitly designed to preserve the property of noncenter-embedding. The second is designed to maximize the use of prefixes on the basis of being able to predict the identity of a constituent by the time its leftmost descendent has been identified. There is no reason to believe a priori that affixed grammars constructed according to the second set of principles should preserve noncenter-embedding, and indeed as we have just seen, they don't. However, we conjecture chat natural languages are designed so that representations of the structural descriptions of acceptable expressions of those languages can be assigned to them by finite-state parsers that operate by identifying constituents as quickly as possible. We call this the Efficient Finite-State Parser Hypothesis.</Paragraph>
    <Paragraph position="22"> The four principles for determining whether to use a prefix or a postfix to mark the presence of a particular constituent apply to grammars that are center embedding as well as to those that are not. Suppose we extend the grammar G2 by replacing rules G2e and f by rules G2e' and f' respectively, and adding rules G2m-s as follows:  (G2) e'. N ---~ N (PP1) f,. ve &gt; v (sP) ({Pe2, ~) m. NP * NP PP2 n. PP1 * PI NP o. PP2 * P2 NP p w ~ vP IA, PP21 q. A ~ yesterday r. P1 ---&gt; of S. P2 ~ ~in, on, ...\]  Among the expressions generated by the extended grammar G2 are those in E3.</Paragraph>
    <Paragraph position="23"> (E3) a. the boss knew that the teacher saw the child yesterday b. the friend of the teacher's sister  Although each of the expressions in E3 is ambiguous with respect to G2, each has a strongly preferred interpretation. Moreover, under each interpretation, each of these sentences manifests first-degree center embedding. In E3, the included VP saw the child is wholly contained in the including VP knew that the teacher saw the child yesterday; and in E3b, the included NP the teacher is wholly contained in the including NP the friend of the teacher's sister.</Paragraph>
    <Paragraph position="24"> Curiously enough, the extension of the affix grammar that our principles derive from the extension of the grammar G2 just given associates only one affixed string with each of the expressions in E3. That grammar is obtained by replacing rules G2*e and F with G2*e' and f' respectively, and adding the rules G2*m-s as follows.</Paragraph>
    <Paragraph position="25">  (G2*) e' N* &gt; N M* (PPI*) f'. VP* &gt; VP V* (NP*) (\[PP2*, C*}) m. NP* ~ NP* PP2* NP n. PPI* ---&gt; PP1PI* NP ~ o. PP2* &gt; PP2 P2* NP* p. VP* ~ VP* {A*, PP2*} VP q. A* P A yesterday r. PI* * P1 of  s. F2*---~ P2 fin, on .... J The affix strings that the extended affix grammar G2* associates with the expressions in E3 are given in E3*.</Paragraph>
    <Paragraph position="26"> (E3 ~) a. NP D the N N boss VP V knew C C that S NP D the N N teacher VP V saw NP D the N N child A yesterday VP S b. NP D the N N friend PP1 P1 of NP D the N N teacher G's G N N sister NP We contend that the fact that the expressions in E3 have a single strongly preferred interpretation results from the fact that those expressions have a single affixed string associated with them. Consider first E3a and its associated affixed string E3*a. According to rule Rc, the affix VP following yesterday is a postfix which covers the affixes VP and A. Now, there is only one occurrence of A in E3*a, namely the one that immediately precedes yesterday; hence that must be the occurrence which is covered by the postfix VP. On the other hand, there are two occurrences of prefix VP in E3*a that can legitimately be covered by the postfix, the one before saw and the one before knew. Suppose in such circumstances, rule Rc picks out the nearer prefix. Then automatically the complex VP, saw the child yesterday, is covered by the subordinate S prefix, in accordance with the natural interpretation of the expression as a whole.</Paragraph>
    <Paragraph position="27"> Next, consider E3b and its associated affixed string E3*b. According to rule Rc, the G is a postfix that covers the affixes NP and G. Two occurrences of the prefix NP are available to be covered; again, we may suppose that rule Rc picks out the nearer one. If so, then automatically the complex NP, the teacher's sister, is covered by PPI, again in accordance with the natural interpretation of the expression as a whole.</Paragraph>
    <Paragraph position="28"> This completes our demonstration of the ability of affixed strings to represent the structural descriptions of the acceptable sentences of a natural language in a manner which enables them to be parsed by a finite-state device, and which also predicts the way in which (at least) certain expressions with center embedding are actually interpreted. Much more could be said about the system of representation we propose, but time and space limitations preclude further discussion here. We leave as exercises to the reader the demonstration that the expression E4a has a single affixed string associated with it by G2*, and that the left-branching (stacked) interpretation of E4b is predicted to be preferred over the right-branching interpretation.</Paragraph>
    <Paragraph position="29"> (E4) a. the student saw the teacher in the house b. the house in the woods near the stream</Paragraph>
  </Section>
  <Section position="3" start_page="26" end_page="26" type="metho">
    <SectionTitle>
ACKNOWLEDGMENT
</SectionTitle>
    <Paragraph position="0"> We thank Maria Edelstein for her invaluable help in developing the work presented here.</Paragraph>
  </Section>
class="xml-element"></Paper>