File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/metho/87/p87-1012_metho.xml
Size: 39,979 bytes
Last Modified: 2025-10-06 14:11:59
<?xml version="1.0" standalone="yes"?> <Paper uid="P87-1012"> <Title>A Lazy Way to Chart-Parse with Categorial Grammars Ill</Title> <Section position="3" start_page="0" end_page="81" type="metho"> <SectionTitle> 1. Combinatory Categorial Grammars </SectionTitle> <Paragraph position="0"> &quot;Pure&quot; categorial grammar (CG) is a grammatical notation, equivalent in power to context-free grammars, which puts all syntactic information in the lexicon, via the specification of all grammatical entities as either functions or arguments. For example, such a grammar might capture the obvious intuitions concerning constituency in a sentence like John must leave by identifying the VP leave and the NP John as the arguments of the tensed verb must, and the verb itself as a function combining to its right with a VP, to yield a predicate -- that is, a leftward-combining function-from-NPs-into-sentences. One common &quot;slash&quot; notation for the types of such functions expresses them as triples of the for~ <result, direction, argu.</Paragraph> <Paragraph position="1"> merit>, where result and argument are themselves syntactic types, and direction is indicated by &quot;/&quot; (for rightward-combining functions) or '~,&quot; (for leftward). Must then gets the following type-assignment: (I) must :- (SkNP)/VP In pure categorial grammar, the only other element is a single &quot;combinatory&quot; rule of Functional Application. which gives rise to the following two instances: 1 1 All combinatory roles are written as productions in the present paper, in contrast with the reduction rule notation used in the earlier papers. The change is intended to aid comparison with other tmification-based grammars, and has no theoretical significance. ~) a. Rightward Application:</Paragraph> <Paragraph position="3"> These rules allow functions to combine with inunediam~ adjacent a~uments in the obv~us way, to ~dd the obv~ surface su'ucmres and interpretations, as in: Combinatory Categorial Grammar (CCG) (Ades and Steedman 1982, Smedman 1985, Smedman 1986) adds a number of further elementary operations on fimcfions and arguments m the combinatory component These operadons conespond to certain of the primitive combinamrs used by Curry and Feys (1958) to define the foundations of the ~calculus, notably including functional composition and &quot;type raising&quot;. For These combin-tory operations allow additional, non-standard &quot;surface structures&quot; like the following, which arises from the type-raising of the subject John into a function over predicates, which composes with the verb, which is of course a function /no predicates: In general, wherever orthodox surface structure posits a right branching slructure like (a) below, these new operations will allow not only the left branching structure (b), but every mixlure of right- and left- branching in between: b. y,/X'~~ A s ~'B ...~ C ~D The linguistic motivation for including such operations, (and the grounds for contesting the standard linguists' view of surface constituency), for details of which the reader is referred to the bibliography, sterns from the possibility of extracting over, and also coordinating, a wide range of such non-standard composed structures. A crucial feature of this theory of grammar is that the novel operation of functional composition is assoc/atire so that all the novel analyses like (5)are semantically equivalent to the relevant canonical analysis, like O). On the other hand, roles of type raising simply map arguments into functions over the functions of which they are argument, producing the same result, and thus are by themselves responsible for no change in generative capacity;, indeed, they can simply be regarded as tools which enable functional composition to operate in circumstances where one or both the constituents which need to be combined initially are not associated with a functional type, as when combining a subject NP with the verb which follows it.</Paragraph> <Paragraph position="4"> Grammars of this kind, and the related variety proposed by Karmrmen (1986), achieve simplicity in the grammar of movement and coordination at the expense of multiplying the number of derivations according to which an unambiguous suing such as the sentence above can be parsed. While we have suggested in earlier papers (Ades and Steedman 1982, Pareschi 1986) that this property can be exploited for incremental semantic interpretation and evaluation, a suggestion which has been explored further by Haddock (1987) and Hinrichs and Polanyi (1986), two potentially serious problems arise from these spurious ambiguities. The fast is the possibility of producing a whole set of semantically equivalent analyses for each reading of a given siring. The second more serious problem is that of efficiently coping with non-determinism in the face of such proliferating ambiguity in surface analyses.</Paragraph> <Paragraph position="5"> The problem of avoiding equivalent derivations is common to parsers of all grammars, even context-flee phrase-structure grammars. Since all the spurious derivations are by clef'tuition semantically equivalent, the solution seems obvious: just find one of them, say via a &quot;reduce rast&quot; strategy of the kind proposed by Ades and Steedman (1982). The problem with this proposal arises from the fact that, assuming left-to-right processing, Rightward Composition may preempt the construction of constituents which are needed as arguments by leftward combining functional types. 2 Such a depth-fast processor cannot take advantage of standard techniques for eliminating backtracking, such as chart-parsing (Kay, 1980), because the subconstituents for the alternative analysis will not in general have been built. For example, if we have produced a left-branching analysis like (b) above, and then rind that we need the constituent X in analysis (a) (say to attach a modifier), we will be forced to redo the entire analysis, since not one of the subcoustituents of X (such as Y) was a constituent under the previous analysis. Nor of course can we afford a standard breadth-fast strategy. Karttunen (1986a) has pointed out that a parser which associates a canonical interpretation structure 2 If we had chosen to prc~Js fight-to-left, then an identical problem would arise from the involvement of Leftward Composition. with substzings in a chart can always distinguish a spurious new analysis of the same string from a genuinely different analysis: spurious analyses produce results that are the same as one already installed on the chart. However, the spurious ambiguity problem remains acute. In order to produce only the genuinely distinct readings, it seems that all of the spurious analyses must be explored, even if they can be discarded gain. Even for short strings, this can lead to an unmanageable enlargement of the search space of the processor. Similarly, the problem of reanalysis under backtracking still threatens to overwhelm the parser. In the face of this problem Wittonburg (1986) has recently argued that massive heuristic guidance by strategies quite problematically related to the grammar itself may be required to parse at all with acceptable costs in the face of spurious ambiguities (see also Wittenburg, this conference.) The present paper concerns an alternative unification-based chart-parsing solution which is grammatically transparent, and which we claim to be generally applicable to parsing &quot;genuine&quot; attachment ambiguities, under exteusions to CG which involve associative operations.</Paragraph> </Section> <Section position="4" start_page="81" end_page="85" type="metho"> <SectionTitle> 2. Unification-based Comblnatory Categorlal Grammars </SectionTitle> <Paragraph position="0"> As Kamunen (1986), Uszkoreit (1986), Wittenburg (1986), and Zeevat et al. (1986) have noted, unification-based computational enviroments (Shieber 1986) offer a natural choice for implementing the categories and combination roles of CGs, because of their rigorously dermed declarative semantics. We describe below a unification-besed realisation of CCG which is both transparent to the linguistically motivated properties of the theory of granu'nar and can be directly coupled to the parsing methodology we offer further on.</Paragraph> <Section position="1" start_page="81" end_page="83" type="sub_section"> <SectionTitle> 2.1. A Restricted Version of Graph-unification </SectionTitle> <Paragraph position="0"> We assume, like all unification formalisms, that grammatical constituents can be represented as feature-structures, which we encode as directed acyclic graphs (dags). A dag can be either:.</Paragraph> <Paragraph position="1"> (i) a constant (ii) a variable (iii) a finite set of label-value pairs (features), where any value is itself a dag, and each label is associated with one and only one value We use round brackets to def'me sets, and we notate features as \[label value\]. We refer to variables with symbols starting with capital letters, and to labels and constants with symbols starting with lower-case letters. The following is an example of a dag:</Paragraph> <Paragraph position="3"> Like other unification based grammars, we adopt degs as the data-structures encoding categorial feature information because of the conceptual perspicuity of their set-theoretic def'mitio~ However, the variety of unification between dags that we adopt is more resu'ictive than the one used in standard graph-unification formalisms like PATR-2 (Shieber 1986), and closely resembles term-unification as adopted in logicprogramming languages.</Paragraph> <Paragraph position="4"> We define unification by first defining a partial ordering of subsumption over dags in a similar (albeit more reslricted) way to previous work discussed in Shieber (1986). A dag D 1 subsumes a dag D2 if the information contained in D 1 is a (not necessarily proffer ) subset of the information contaified in D 2. Thus, variables subsume all other dags, as they contain no information at all. Conversely, a constant subsumes, and is subsumed by, itself alone. Finally, subsumptlon between dags which are feature-sets is defined as follows. We refer to two feature-sets D 1 and D? as variants of each other if there is an isomorphism d mapphSg each feature in D 1 onto a feature with the same label in D 9. Then a feature-set D 1 subsumes a feature-set D 2 if and oilly if: (i) D 1 and D 2 are variants; and (ii) if o~ f ), where fis a feature in D 1 and f is a feature in D 2, then the value off subsumes tile value off.</Paragraph> <Paragraph position="5"> The unification of two dags D 1 and D,~ is then def'med as the most general dag D which is subsume?d by beth D 1 and D 2.</Paragraph> <Paragraph position="6"> Like most other unification-based approaches, we assume that from a procedural point of view, the process of obtaining the unification of two dags D 1 and D 9 requires that they be destructively modified to becfime the-same dag D. (We also use the term unification to refer to this process.) For example let D 1 and D 2 be the two following dags: However, under the present definition of unification, as opposed to the more general PATR-2 def'mition&quot; the above is not the unification of the following pair of dags: (10) (\[a (\[b c\])\] (\[d Z\] \[d g\]) \[e z\]) These two dags are not unifiable in present terms, because under the above clef'tuition of suhsumption&quot; unification of two feature sets can only succeed if they are variants. It follows that a dag resulting from unification must have the same feature population as the two feature su-uctures that it unifies. The present clef'tuition of unification thus resembles term unification in invariably yielding a feature-set with exactly the same structure as both of the input feature-sets, via the instentiation of variables. The only difference from standard term unification is that it is defined over dags, rather than standard terms. By contrast, standard graph-unification can yield a feature-set containing features initially entirely missing from one or other of the unified feature-sets. The significance of this point will emerge later on, in the discussions of the procedural neutrality of combinatory rules in section 2.4, and of the related transparency property of functional categories in section 2.3. Since the properties in question inhere to the grammar itself, to which unification is merely transparent, there is nothing in our approach that is incompatible with the more general definition of graph unification offered by PATR-2.</Paragraph> <Paragraph position="7"> However, in order to establish the correctness of our proposal for efficient parsing of extended categorial grammars using the more general definition&quot; we would have had to neutralise its greater power with more laborious constraints on the encoding of entries in the categorial lexicon as dags than those we actually require below. The more restricted version we propose preserves most of the advantages of gjraph over term datasu'uctures pointed out in Shieber (1986)/ 2.2. Categories as Features Structures We encode constituents corresponding to non-functional categories, such as the noun-phrases below, as feature-sets defining the three major attributes syraax, phonology and senmntics, abbreviated for reasons of space to syn, pho, and son (the examples of feature-based categories given below are of course simplified for the purposes of concise exposition -for instance, we omit any specification of agreement information in the value associated with the syn(tax) label): Constituents corresponding to functional categories are feature-sets characterized by a triple of am-ibutes, result, direc. t/on, end argument, abbreviated to res, dir, and ar 8. The value associated with dir(ection) can be instantiated to one of the constants / and \ and the values associated with res(ult) and arg(ument) can be associated with any functional or non-functional category. (Thus our functions are &quot;curried&quot;, and may be higher order.) We impose the simple but crucial requirement of transparency over the well-formedness of functional categories in fcamre-based CCG. Intuitively, this requirement corresponds to the idea that any change to the structure of the value of arg(ument) caused by unification must be reflected in the value of res(ult). Given the definition of unification in the section above, this requirement can be simply stated as follows: (13) Functional categories must be transparent, in the sense that every uninstantiated feature in the value of a function's arg(ument) feature - that is, every feature whose value is a variable -- must share that variable value with some feature in the value of the function's res( ult) feature.</Paragraph> <Paragraph position="8"> Thus, whenever a feature in a function's arg(ument) is instantiated by unification, some other feature in its res(uh) will be iastantiated identically, as a side-effect of the destructive replacement of structures imposed by unification. Variables in the value of the arg(ument) of a functional category therefore have the sole effect of increasing the specificity of the information contained in the value of its res(uh). As the combinatory rules of CCG build new constituents exclusively in terms of information already contained in the categories that they combine, a requirement that all the functional categories in the lexicon be transparent in mm guarantees the transparency of any functional category assigned to complex constituents generated by the grammar.</Paragraph> <Paragraph position="9"> 3 Calder (1987) and Thompson (1987) have independently motivated similar approaches to constraining unification in encoding The fotlowing feature-based functional category for a lexical =ansitive tensed verb obeys the ~ransparency requiremem (the operator * indicates suing concatenation): When two adjacent feamre-su~ctures corresponding to a function category X 1 and an argument X 9 are combined by functional application, a new feature-strucfin'e X 0 is constructed by unifying the argument feature-su'ucture X 2 with the value of the arg(ument) in the function feature s~'ucture X 1. The result X n is then unified with the res(~dt) of the function. For exam- null pl~., Rightward Application can be expressed in a notation adapted from PATR-2 as follows. We use the notation <I 1 ...</Paragraph> <Paragraph position="10"> 1~> for a path of feature labels of length n, and we identif\]7 as Xn(<11 ... I_>) the value associated with the feature identified by-the-path&quot;<11 ... 1.> in the dag corresponding to a category X_. We indicate udification with the equality sign, =. Rightw~rd Application can then be written as: (15) Rightward Application:</Paragraph> <Paragraph position="12"> Application of this rule to the functional feature-set (14) for the transitive verb loves and the feature-set (12)for the noun-phrase Mary yields the following structure for the verb.phrase To rightward-compose two functional categories according m rule (4b), we similarly unify the appropriate ar&(ument) and res(ult) features of the input functions according to the follow- null ing rule: linguistic theories.</Paragraph> <Paragraph position="13"> (17) Rightward Composition:</Paragraph> <Paragraph position="15"> For example, suppose that the non-functional feature-set (II) for the noun-phrase John is type-raised into the following functional feature-set, according to rule (4a), whose Leftward-combining rules are defined analogously to the rightward-combining rules above.</Paragraph> </Section> <Section position="2" start_page="83" end_page="84" type="sub_section"> <SectionTitle> 2.3. Derivational Equivalence Modulo Composition </SectionTitle> <Paragraph position="0"> Let us denote the operations of applying and composing categories by writing apply(X, Y) and comp(X, Y) respectively. Then by the definition of the operations themselves, and in particular because of the associativity of functional composition, the following equivalences hold across typederivations: null (20) apply (comp (X 1, X2), X3) apply (X I, apply~X 2, X 3) ) (21) comp(comp(X4, X5) , X6) - comp(X4, comp(X 5, X6)) More formally, the left-hand side and right-hand side of both equations define equivalent terms in the combinatory logic of Curry and Feys (1958). 4 It follows that all alternative derivations of an arbitrary sequence of functions and arguments that are allowed by different orders of application and composition in which a composition is merely traded for an,~pplication also define equivalent terms of Combinatory Logic.&quot; So. for instance, a type for the sentence John loves Mary can be assigned either by rightward-composing the type-raised function John, (18), with loves. (14), to obtain the feature-structure (19)for John loves, and then rightward applying (19) to Mary, (12). to obtain a feature-structure for the whole sentence; or. conversely, it can be assigned by rightward-applying loves. (14), to Mary, (12), to obtain the feature-structure (16)for loves Mary, and then rightward-applying John. (18). to (16) to obtain the final feamre-su'ucmre. In both cases, as the reader may care to verify, the type-assignment we get is the following: An important property of CCO is that it unites syntactic and semantic combination in uniform operations of application and composition. Unification-based CCG makes this identification explicit by uniting the syntactic type of a constituent and its interpretation in a single feature-based type. It follows that all derivations for a given suing induced by functional composition correspond to the same unique feature-based type, whic~ cannot be assigned to any other constituent in the grammar.&quot; This property, which we characterize formally elsewhere, is a direct consequence of the fact that unification is itself an associative operation.</Paragraph> <Paragraph position="1"> It follows in turn that a feature-based category like (22) associated with a given constituent not only contains all the information necessary for its grammatical interpretation, but also determines an equivalence class of derivations for that constituent, a point which is related to Karttunen's (1986) proposal for the spurious ambiguity problem (cf. secn. 1 above), but which we exploit differently, as follows.</Paragraph> </Section> <Section position="3" start_page="84" end_page="85" type="sub_section"> <SectionTitle> 2.4. Procedural Neutrality of Combinatory Rules </SectionTitle> <Paragraph position="0"> The rules of combinatory eategorial grammar are purely declarative, and unification preserves this property, so that, as with other unification-based grammatical formalisms (cf.</Paragraph> <Paragraph position="1"> Shieber 1986). there is no procedural constraint on their use.</Paragraph> <Paragraph position="2"> So far. we have only considered examples in which such rules are applied &quot;bottom-up&quot;, as in example (16). in which the rule of application (15) is used to define the feature structure X 0 on the left-hand side of the rule in terms of the feature structures 4 The terms are equivalent in the technical sense that they reduce to an identical normal form.</Paragraph> <Paragraph position="3"> 5 The inclusion of certain higher-order function catesories in the lexicon (of which &quot;modifiers of modifiers&quot; Hkeformerly would be an example in English) means that composition may affect the argument structure itself, thereby changing me.~ning and giving rise to non-equivalent terms. This possibility does not affect the present proposal, ~d can be ignored.</Paragraph> <Paragraph position="4"> o If there is genuine ambiguity, a constitoent will of course he assigned more than one type.</Paragraph> <Paragraph position="5"> X 1 and X 2 on the fight, respectively instantiated as the function loves (14)and its argument Mary ~12). However, other procedural realizations are equally viable.' In particular, it is a property of rules (15)and (17), (and of all the cumbinatory rules permitted in the theory -- of. Steedman 1986) that if any two out of the three elements that they relate are specified, then the third is entirely and uniquely determined. This property, which we call procedural neutrality follows from the form of the rules themselves and from the transparency property (13) of functional categories, t~ier the definition of unification given in section 2.1 above.&quot; This property of the grammar offers a way to short-circuit the entire problem of non-determinism in a chart-based parser for grammars characterised by spurious analyses engendered by associative rules such as composition. The procedural neutrality of the combinatory rules allows a processor to recover constituents which are &quot;implicit&quot; in analysed constituents in the sense that they would have been built if some other equivalent analysis had happened to have been the one followed by the processor. For example, consider the situation where, faced with the suing John loves Mary dealt with in the last section, the processor has avoided multiple analyses by composing John, (18), with loves, (14), to obtain John loves, (19), and has then applied that to Mary, (12), to obtain John loves Mary (22), ignoring the other analysis. If the parser rams out to need the constituent loves Mary, (16), (as it will ff it is to find a sensible analysis when the sentence turns out to be John loves Mary mad/y), then it can recover that constituent by clef'ruing it via the rule of Rightward Application in terms of the feature structures for John loves Mary, (22), and John, (18). These two feature structures can be used to respectively instantiate X 0 and X I in the rule as stated at (15). The reader may verify tl~t instanttating the rule in this way determines the required constituent to be exactly the same category as (16).</Paragraph> <Paragraph position="6"> This particular procedural alternative to the bottom-up invocation of combinatery rules will be central to the parsing algorithm which we present in the following section, so it will be convenient to give it a name. Since it is the &quot;parent&quot; category X 0 and the &quot;left-constituent&quot; category X l that are instantiated, it seems natural to call this alternative l~ft-branch instantlatlon of a combinatory rule, a term which we contrast with the bottom-up instantlatlon invoked in earlier examples.</Paragraph> <Paragraph position="7"> The significance of this point is as follows. Let us suppose that we can guarantee that a parser will always make available, say in a chart, the constituent that could have combined under 7 There is an obvious analogy here with the fact that unification-based programming languages like Prolog do not have any predefmed distinction between the input and the output parameters of * given l~r~uw-From a formal point of view, procedural neutrality is * consequence of the fact that unification-based combinatory roles, as characterised above, are e.xJens/ona/. Thus, we follow Pereira and Shieher (1984) in claiming that the &quot;bottom-up&quot; realization of a unification-based rule * corresponds to the unification of a structure E* encoding the equational constraints of r, and a structure D r corresponding to the merging of the structures instentiating the elemcnu of the right-hand side of r. A stmcmreN r is consequently assigned as the insumtiation of the left-hand side of * by individuating a relevant substructure of the unification of the pair <D. E >. If * is a rule of unification-based</Paragraph> <Paragraph position="9"> bottom-up instantiation as a left-cenatiment with an implicit fight-constituent to yield the same result as the analysis that was actually followed. In that case, the processor will be able to recover the implicit right-constituent by left-branch instantiation of a single combinatory rule, without restarting syntactic analysis and without backtracking or search of any kind.</Paragraph> <Paragraph position="10"> The following algorithm does just that.</Paragraph> </Section> </Section> <Section position="5" start_page="85" end_page="87" type="metho"> <SectionTitle> 3. A Lazy Chart Parsing Methodology </SectionTitle> <Paragraph position="0"> Derivafional equivalence modulo composition, together with the procedural neutrality of unification-based combinatory rules, allows us to def'me a novel generalisadon of the classic chart parsing technique for extended CGs, which is &quot;lazy&quot; in the sense that: a) only edges corresponding to one of the set of semantically equivalent analyses are installed on the chart; b) surface constituents of already parsed parts of the input which are not on the chart are directly generated from the structures which are, rather than being built from scratch via syntactic reanalysis.</Paragraph> <Section position="1" start_page="85" end_page="86" type="sub_section"> <SectionTitle> 3.1. A Bottom-up Left-to-Right Algorithm </SectionTitle> <Paragraph position="0"> The algorithm we decribe here implements a bottom-up, left-to-right parser which delivers all semantically distinct analyses. Other algorithms based on alternative control strategies are equally feas~le. In this specific algorithm, the distinction between active and inactive edges is drawn in a rather diffeae+Lt way from the standard one. For an edge E to be active does not meanthat it is associated with an incomplete constituent (indeed, the distinction between complete and incomplete constituents is eliminated in CCG); it simply means that E can Irigger new actions of the parser to install other edges, after which E itself becomes inactive. By contrast, inactive edges cannot initiate modifications to the state of the parser.</Paragraph> <Paragraph position="1"> Active edges can be added to the chart according to the three following actions: Scanning: if a is a word in the input string then, for each lexical entry X associated with a, add an active edge labeled X spanning the vertices corresponding to the position of a on the chart.</Paragraph> <Paragraph position="2"> Lifting: if E is an active edge labeled X 1. then for every unary lrule of type raising which can-be instantiated as X O ~> X 1 add an active edge E 0 labeled X 0 and spannifig the sanie vertices of E 1.</Paragraph> <Paragraph position="3"> Reducing: if an edge E 9 labeled X 9 has a left-adjacent edge E 1 labeled X I aKd there is ~ combinatory rule which c-an be instanfiated as X 0 --~---> X 1 X~ then add an active edge E 0 labeled X n spanning fife sr3rting vertex of E 1 and the ending ver~x F.. 2.</Paragraph> <Paragraph position="4"> The operational meaning of Scanning and Lifting should be clear enough. The Reducing action is the workhorse of the parser, building new constituents by invoking combinatory rules via bottom-up instantiadon. Whenever Reducing is effected over two edges E 1 and E 2 to obtain a new edge E 0 we ensure that: E l is marked as a left-generator of E N. If the rule in the gr'~mmar which was used is RightWard Composition, then E 2 is marked as a right-generator of E 0.</Paragraph> <Paragraph position="5"> The intuition behind this move is that right.generators are rightward functional categories which have been composed into, and will therefore give rise to spurious analyses ff they take part in further rightward combinations, as a consequence of the property of derivational equivalence modulo composition, discussed in section 2.3. Left-generators correspond instead to choice points from where it would have been possible to obtain a derivationally different but semantically equivalent constituent analysis of some part of the input string. They thus constitute suitable constituents for use in recovering /mpl/c/t right-constituents of other constituents in the chart via the invocation of combinatory rules under the procedure of left-branch instantiation discussed in the last section.</Paragraph> <Paragraph position="6"> In order to state exactly how this is done, we need to introduce the left-starter relation, corresponding to the lransitive closure of the left-generator relation: (i) A left-generator L of an edge E is a left-starter of E.</Paragraph> <Paragraph position="7"> (ii) If L is a left-sterter of E, then any left-starter of L is a left-stsrter of E.</Paragraph> <Paragraph position="8"> The parser can now add inactive edges cones~nding to implic/t right-constituents according to the fonowing action: Revealing:. if an edge E is labeled by a leftward-looking functional type X and there is a combinatory rule which can be instantiated esX' ~> X2Xthenif (i) there is an edge E 0 labeled Xn left-adjacent to E (ii) E 0 has a left-starter E 1 labele~ X 1 (iii) there is a combinatory'rule which'can be instantiated esX 0 ~ XIX 2 then add to the chart an inactive edge E 2 labeled X~ spanning the ending vertex of E 1 and the starting vertex of E, unless there is already an e~ige labelled in the same way and spanning the same vertices. Mark E?as a right-generator of E 0 if the rule used in (iii) was'Righiward Composition.</Paragraph> <Paragraph position="9"> To summarise the section so far:. if the parser is devised so as to avoid putting on the chart subeonsfiments which would lead to redundant equivalent derivations, non-determiuism in the grammar will always give rise to cases which require some of the excluded constituents. In a left-to-right processor this typically happens when the argument required by a leftward-looking fimctional type has been mistakenly combined in the analysis of a substring left-adjacent to that leftward-looking type. However, such an implicit or hidden constituent could have only been obtained through an equivalent derivation path for the left-adjacent substring. It follows that we can &quot;reveal&quot; it on the chart by invoking a combinatory rule in terms of left-branch instantiation.</Paragraph> <Paragraph position="10"> We can now informally characterize the algorithm itself as follows: null the parser does Scanning for each word in the input string going left-to-right moreover, whenever an active edge A is added to the chart, then the following actions are taken in order.</Paragraph> <Paragraph position="11"> (i) the parser does Lifting over A (ii) if A is labeled by a leftward-looking type, then for every edge E left-adjacant to A the parser does Revealing over E with respect to A (iii) for every edge E left-adjacent to A the parser does Reducing over E and A, with the constraint that ff A is not labeled by a leftward-looking type then E must not be a right-generator of any edge E' the parser returns the set of categories associated with edges spanning the whole input, if such a set is not empty; it fails otherwise,.</Paragraph> </Section> <Section position="2" start_page="86" end_page="87" type="sub_section"> <SectionTitle> 3.2. An Example </SectionTitle> <Paragraph position="0"> In the interests of brevity and simplicity, we eschew all details to do with unifieafion itself in the following examples of the workings of the parser, reverting to the original categorial notation for CCG of section 1, bearing in mind that the categories are now to be read strictly as a shorthand for the fuller notation of un/fication-based CCG. For similar reasons of simplicity in exposition, we assume for the present purpose that the only type-raising rule in the grammar is the subject rule (4a).</Paragraph> <Paragraph position="1"> The algorithm analy~es the sentence John loves Mary madly as follows. First, the parser Scans the first word John, ed~g to the chart an active NP edge corresponding to its sole lexical entry, and spanning the word in question, thus:</Paragraph> <Paragraph position="3"> (We adopt the convention that active edges are indicated by upper-case categories, while inactive edges will be indicated with lower-easo categories.) Since the edge in question is active, it fails under the second clause of the algorithm. The Lifting condition (i) of this clause applies, since there is a rule which type raises over NP, so a new active edge of type S/(S~rP) is added, spanning the same word, John (no other conditions apply to the NP active edge, and it becomes inac- null The new lexical edge Reduces with the type-raised subject to yield a new active edge of type S/NP. The subject category is marked as the new edge's left-generator, and (because the combinatory rule was Rightward Composition) the verb category is marked as its right-generator. Nothing more results from loves, and neither Lifting, Revealing nor Reducing yield anything from the new edge, so it too becomes inactive, and the next word is Sc~rmed to add a new lexical active NP edge corresponding to Mary: (26) ~/np np ( s \n~/np NP This edge yields two new active edges before becoming inacfive, one of type S/(S~P) via Lifting and the subject rule, and one of type S, via Reducing with the s/np edge to its left by the Forward application rule (we omit the former from the illustralion, because nothing further happens to it, but it is there nonetheless): ~ The s/np edge is in addition marked as the left generator of the S. Note that Reducing would potentially have allowed a third new active edge corresponding to loves Mary to be added by Reducing the new active NP edge corresponding to Mary with the left-adjacent (s~np)/np edge, loves. However. this edge has been marked as a right generator, and is therefore not allowed to Reduce by the algorithm.</Paragraph> <Paragraph position="4"> Nothing new results from the new active S edge, so it becomes inactive and the next word mad/y is scanned to add a new This active edge, being a leftward=looking functional type, precipitates Revealing. Since there is a rule (Backward Application. 2a) which would allow madly, (S~IP)~(S~IP) to combine with a left-adjacent s~np, and there is a rule (Forwards Application, 2a) which would allow a left-starter John .... ~hine with ~h en ,~p to yield the s which is le~-~ to madly, (and since there is no left-adjacent s~np there already), the rule of Forward Application can be invoked via Left-branch Instantiation to Reveal the inactive edge loves Mary, s~p.~~'~,~ ..- ~,.~-,. .o,,.,,,. ~-,, ,. ~a.~._~..~._.~.</Paragraph> <Paragraph position="5"> ~(S\NP) \ (S\NP) The (still) active backward modier mad/y can now Reduce with the newly introduced s~mp, to yield a new active edge S~P corresponding to loves Mary madly, before becoming inactive: ~ (30) ///~/,/cs\~p~ ~',,o/np &quot;,~ .'/John TM.~ loves~._ Marg~..._Lmadly ~.</Paragraph> <Paragraph position="6"> The new active edge potentially gives rise to two semantically equivalent Reductions with the subject John to yield S -- one with its ground np type, and one with its raised type, s/(s~np). Only one of these is effected, because of a detail dealt with in the next section, and the algorithm terminates with a single S edge spanning the str/n~&quot; ~.</Paragraph> <Paragraph position="7"> np ~npl/np np_/(s\np) \ (s\npJ/ In an attachment-ambiguous sentence like the following, which we leave as an exercise, two predicates, believes John loves Mary and loves Mary. are revealed in the penultimate stage of the analysis, and two semantically distinct analyses result&quot; (32) Fred believes John loves Mary passionately Space permits us no more than to note that this procedure will also cope with another class of constructions which constitute a major source of non-determinism in natural language parsing, namely the diverse coordinate constructions whose categorial analysis is discussed by Dowty (1985) and Steedman (1985, 1987).</Paragraph> <Paragraph position="8"> 4. Type Raising and Spurious Ambiguity As noted at example (30) above, type raising rules introduce a second kind of spurious ambiguity connected to the interactions of such rules with functional application rather than functional composition. If the processor can Reduce via a rule of application on a type.raised category, then it can also always invoke the opposite rule of appHcaton to the u~aised version of the same category to yield the same result. Spurious ambiguity of this kind is trivially easy to avoided, as (u~l~e the kind associated with composition), it can always be detected locally by the following redundancy check on attachment of new edges to the chart in Reducing: when Reducing creates an edge via functional application, then it is only added to the chart if there is no edge associated with the same feature structure and spanning the same vertices already on the chart.</Paragraph> </Section> </Section> <Section position="6" start_page="87" end_page="87" type="metho"> <SectionTitle> 5. Alternative Control Strategies and Grammatical For- </SectionTitle> <Paragraph position="0"> mailsms The algorithm described above is a pure bottom-up parsing procedure which has a close relative in the Cocke-Kasami-Younger algorithm for context-free phrase-strucnne grammars. However, our chart-parsing methodology is completely open to alternative control options. In particular, Pareschi (forthcoming) describes an adaptation of the Farley algorithm, which, in virtue of its top-down prediction stage, allows for efficient application of more genera\] type-raising rules than are considered here. Formal proofs of the correcmess of both these algorithms wili be presented in the same reference.</Paragraph> <Paragraph position="1"> The possibility of exploiting this methodology for improving processing of other unification-based extensions of CG involving spurious ambiguity, like the one reported in Kartmnen (1986a), is also under exploration.</Paragraph> </Section> class="xml-element"></Paper>