| { |
| "paper_id": "P91-1028", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T09:03:44.201154Z" |
| }, |
| "title": "Multiple Default Inheritance in a Unification-Based", |
| "authors": [ |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Russell", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Susan Warwick-Armstrong ISSCO", |
| "location": { |
| "addrLine": "54 route des Acacias", |
| "postCode": "1227", |
| "settlement": "Geneva", |
| "country": "Switzerland" |
| } |
| }, |
| "email": "" |
| }, |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Carroll", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Susan Warwick-Armstrong ISSCO", |
| "location": { |
| "addrLine": "54 route des Acacias", |
| "postCode": "1227", |
| "settlement": "Geneva", |
| "country": "Switzerland" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "A formalism is presented for lexical specification in unification-based grammars which exploits defeasible multiple inheritance to express regularity, subregularity, and exceptions in classifying the properties of words. Such systems are in the general case intractable; the present proposal represents an attempt to reduce complexity while retaining sufficient expressive power for the task at hand. Illustrative examples are given of morphological analyses from English and German.", |
| "pdf_parse": { |
| "paper_id": "P91-1028", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "A formalism is presented for lexical specification in unification-based grammars which exploits defeasible multiple inheritance to express regularity, subregularity, and exceptions in classifying the properties of words. Such systems are in the general case intractable; the present proposal represents an attempt to reduce complexity while retaining sufficient expressive power for the task at hand. Illustrative examples are given of morphological analyses from English and German.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "The primary task of a computational lexicon is to associate character strings representing word forms with information able to constrain the distribution of those word forms within a sentence. 1 The organization of a lexicon requires the ability, on the one hand, to make general statements about classes of words, and, on the other, to express exceptions to such statements affecting individual words and subclasses of words. These considerations have provoked interest in applying to the lexicon AI knowledge representation techniques involving the notions of inheritance and default. 2 The sys-*current address: Cambridge University Computer Laboratory, New Museums Site, Pembroke Street, Cambridge CB2 3QG, UK.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "OWe are indebted to Af-.al Ballim, Mark Johnson, and anonymous referees for valuable comments on this paper. tin the general case, the relation between forms and information is many-to-many (rather than one-to-many as often assumed) and this observation has influenced the choice of facilities incorporated within the system. See 3.2 below for an example of how distinct forms share identical morphosyntactic specifications.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "2See e.g. Daelemaus and Gazdar eds. (1990) , and the references in Gazdar (1990) . The work of Hudson (1984) extends this general approach to sentence syntax. tem described here is part of the ELU s unification grammar development environment intended for research in machine translation, comprising parser, generator, transfer mechanism and lexical components. The user language resembles that of PATR-II (Shieber, 1986) , but provides a larger range of data types and more powerful means of stating relations between them. Among the requirements imposed by the context within which this system is used are (i) the ability to both analyse and generate complex word forms, (ii) full integration with existing parts of the ELU environment, and (iii) the ability to accommodate a relatively large number of words.", |
| "cite_spans": [ |
| { |
| "start": 10, |
| "end": 42, |
| "text": "Daelemaus and Gazdar eds. (1990)", |
| "ref_id": null |
| }, |
| { |
| "start": 67, |
| "end": 80, |
| "text": "Gazdar (1990)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 95, |
| "end": 108, |
| "text": "Hudson (1984)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 406, |
| "end": 421, |
| "text": "(Shieber, 1986)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "An ELU lexicon consists of a number of 'classes', each of which is a structured collection of constraint equations and macro calls encoding information common to a set of words, together with links to other more general 'superc]asses'. For example, if an 'intransitive' class is used to express the common syntactic properties shared by all intransitive verbs, then particular instances of intransitive verbs can be made to inherit this information by specifying the 'intransitive' class as one of their superclasses -it then becomes unnecessaw to specify the relevant properties individually for each such verb. The lexicon may be thought of as a tangled hierarchy of classes linked by inheritance paths, with, at the most specific level, lexicai classes and, at the most general, classes for which no superclasses have been defined, and which therefore inherit no information from elsewhere.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "S \"Environnement Linguistique d'Unlfication\" -see Estival (1990) , and, for a description of the earlier UD system on which E~u is based, Johnson and Rosner (1989) .", |
| "cite_spans": [ |
| { |
| "start": 50, |
| "end": 64, |
| "text": "Estival (1990)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 138, |
| "end": 163, |
| "text": "Johnson and Rosner (1989)", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Lexical entries are themselves classes, 4 and any information they contain is standardly specific to an individual word; lexical and non-lexical classes differ in that analysis and generation take only the former as entry points to the lexicon.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Inheritance of a feature value from a superclass may be overridden by a conflicting value for that feature in a more specific class. This means, for example, that it is possible to place in the class which expresses general properties of verbs an equation such as '<* aux> = no' (i.e. \"typical verbs are not auxiliaries\"), while placing the contradictory specification '<* aux> = yes' in s subclass from which only anTiliaries inherit. The ability to encode exceptional properties of lexical items is extremely attractive from the linguistic point of view; the lower the position in the hierarchy at which the property appears, the more exceptional it may be considered.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "A class definition consists of the compiler directive '#Class' (for a non-lexicai class) or '#Word' (for a lexical class), followed by the name of that class, a possibly empty list of direct superclasses, a possible empty 'main' or default equation set, and sere or more 'variant' equation sets. The superclass declaration states from which classes the current class inherits; if more than one such superclass is specified, their order is significant, more specific classes appearing to the left of more general ones. If the current class is one of the most general in the lexicon, it inherits no information, and its superclass list is empty.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Following the superclass declaration are sere or more equations representing default information, which we refer to as the 'main' equation set. These may be overridden by eontlleting information in a more specific class. Each equation in a main set functions as an independent constraint, in a msnner which will be clarified below.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Variant equation sets, loosely speaking, correspend to alternatives at the same conceptual level in the hiersrchy, and in msny cases reflect the traditional ides of 'paradigm'. Equations within a variant set are absolute constraints, in contrast to those in the main set; if they conflict with informstion in a more specific class, failure of unification occurs in the normal way. Also, unlike the main set, each variant set functions as a single, possibly complex, constraint (see section 2.2). A feature 4Thus no distinction is made between classes and 'instances', as in e.g. KL-ONE (Schmolse and Lipkis, 1983) structure is created for each variant set that successfully unifies with the single structure arising from the main set. Each variant set is preceded by the vertical bar ' ['. The order of variant sets within a class is not significant, although, if a main set is employed, it must precede any variant sets.", |
| "cite_spans": [ |
| { |
| "start": 586, |
| "end": 613, |
| "text": "(Schmolse and Lipkis, 1983)", |
| "ref_id": "BIBREF10" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The following simplified example illustrates the form and interaction of class definitions. In equs. tions, unification variables have initial capitals, and negation of constants is indicated by ' '. 'kk' is the string concatenation operator -an equation of the form X = Y kk Z unifies X nondeterministically with the result of concatenating \u00a5 and Z. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "V I <tense> = past <~onO = <stem> kk ed I =presont <form>= <steuO kk s i <aSr> = \"s83 <tense> -present <form> = <stem>", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The lexiesl class walk is declared as having two direct superclasses, Intransitive and Verb; its main set contains just one equation, which sets the value of the feature stem to be walk. Intransitive has no direct superclasses, and its main equation set assigns to the value of subcat a list with one element, a feature structure in which the value of cat is rip. Neither walk nor Intransitive has sny variant equation sets. Verb, by contrast, has three, in addition to two main set equations. The latter assign, by default, the values of cat and aux. The three variants accounted for by this example are the past tense verb, in which the value of form unifies with the result of concatenatin 8 the value of stem with the string 'ed', the third person singular form, in which the suffix string is 's', and the form representing other combinations of person and number in the present tense; in the last case, the form value is simply identical to the stem value. 5 5We ignore for the moment the question of morphogrsphemic effects in sufllxstion -see section 3.3 below.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Classes and Inheritance", |
| "sec_num": "2" |
| }, |
| { |
| "text": "In an ELU lexicon, a class may inherit directly from more than one superclass, thus permitting 'multiple inheritance' (Touretsky, 1986: 7ft.) , in contrast to 'simple inheritance' in which direct inheritance is allowed from only one superclass at a time. The main advantage that multiple inheritance offers over simple inheritance is the ability to inherit several (orthogonal or complementary) sets of properties from classes in more than one path through the hierarchy. In the lexical context, it has often been observed that morphological and syntactic properties are essentially disjoint; the subeategorisation class of a verb is not predictable from its conjugation class, and vice versa, for example. Multiple inheritance permits the two types of information to be separated by isolating them in distinct subhierarchies.", |
| "cite_spans": [ |
| { |
| "start": 118, |
| "end": 141, |
| "text": "(Touretsky, 1986: 7ft.)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Class Precedence", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "The question to be resolved in systems employing multiple inheritance is that of precedence: which of several superclasses with conflicting properties is to be inherited from? ELU employs the class precedence algorithm of the Common Lisp Object System (CLOS) to compute a total ordering on the superclasses of a lexicsl class, s The resulting 'class precedence list' (CPL) contains the class itself and all of its superclasses, from most specific to most general, and forms the basis for the defaulting behaviour of the lexicon. As an example, consider the following lexicon:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Class Precedence", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "#Word It (B D) #Class B (C) ZClass C (Y) #Class D (E) #Class E (P) #Class F ()", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Class Precedence", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Here, the superclass declarations embody the orderin 8 constraints A < B, A < D, B < D, B < C, C < F, D < E, and E < F; from these are derived a total order assigning to the lexical class A the CPL (A,B,C,D,E,F).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Class Precedence", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "A lexical class such as walk in the example above corresponds to a family offeature structures. Here, as in most analyses, members of this family represent morphosyntactically distinct realizations of a single basic lexeme. Consulting the lexicon involves determining membership of the set of feature structures associated with a given lexical class;", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "s See Steele (1990: 782ff.) for details of the aIgorithm, and Keene (1989:118ff.) for discussion. In circumstances where no such total ordering is possible, the system reports an error. the precedence relation encoded in the CPL controls the order in which defeasible information is considered, each class in the CPL adding first default and then non-default information to each FS produced by the previous class.", |
| "cite_spans": [ |
| { |
| "start": 6, |
| "end": 27, |
| "text": "Steele (1990: 782ff.)", |
| "ref_id": null |
| }, |
| { |
| "start": 62, |
| "end": 81, |
| "text": "Keene (1989:118ff.)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "More formally, we define default eztension, superclass eztension, and global ez~e~sion as follows: 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "(1) The default eztension of a FS ~ with respect to a set of FSs \u2022 is if U ({~b} U ~) :f: _1_, and .1_ otherwise.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "(2) The superclass ez~ension of a FS ~b with respect to a class c having a main equation set M and variant sets Vl,...v, is the set", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "I ~be J.},", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "where M s is the smallest set of FSs such that each m E M describes some m ~ E M s, \u00a2~s is the default extension of~b with respect to M e, and v~ is the feature structure described by vl. We refer to this set as E(~b, c).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "( 3) With regard to (I), each of the FSs in W that can unify with ~b does so -those that cannot, because they conflict with information already present, are ignored. The condition requiring ~ to be unifiable with the result of unifying the elements of \u2022 takes account of the potential order-sensitivity of the defaulting operation -only those main sets having this property can be applied without regard to ordef. If this condition is met then the application of defaults always succeeds, producing a feature structure which, if no member of the default set is applicable, is identical to ~b. This interpretation of default unification is essentially that of Bouma (1990) .", |
| "cite_spans": [ |
| { |
| "start": 659, |
| "end": 671, |
| "text": "Bouma (1990)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "The superclass extension E(~, c) is formed by applying to ~ any default equations in the main set of c, and then applying to the result each variant set in c; for variant sets Vl,... v,,, the result of this 7'A U B' here denotes the unification of A and B, 'T' denotes the most general, 'empty' FS, which unifies with all others, and '_L' denotes the inconsistent FS, equated with failure of unification. second stage is the set of FSs {@1,...@~}, where each ~ is the result of successfully unifying ~b with some different vj.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "To speak in procedural terms, the global extension of a lexicai class L with the CPL C is computed as follows: T is the empty FS which is input to C; each c~ in C yields as its superelass extension a set of FSs, each member of which is input to the remainder of C, (c~+l,...c,). The global extension of L is then the yield of the most general class in its CPL -expressed in a slightly different way, the global extension of L is the result of applying to T the CPL of L.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "It is possible to exert quite fine control over inheritance; one property may override another when assigned in a main equation set, but cause failure when assigned in a variant set. Normally, variant sets are defined so as to be mutually exclusive; a FS that unifies with more than one of the variant sets is in effect multiplied, s The inheritance systems of Calder (1989) and Flickinger (1987) make use of lexical rules -the ELU lexicon does not provide such devices, although some of their functionality may be reproduced by the variant set mechanism.", |
| "cite_spans": [ |
| { |
| "start": 361, |
| "end": 374, |
| "text": "Calder (1989)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 379, |
| "end": 396, |
| "text": "Flickinger (1987)", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "The approach described here differs from some previous proposals for default inheritance in unification-based lexicons in that the process of building FSs is monotonic -classes may add information to a FS, but are unable to remove or alter it. Thus, given a CPL (ci,...c.), any FS F admitted by a class c~ subsumes every FS that can be created by applying to F the classes (c~ + I,... c,~), m n. Karttunen (1986) and Shieber (1986) describe systems in which FSs may be modified by default statements in such a way that this property does not automatically hold. These schemes permit default statements to override the effect of earlier statements, whereas default information in the ELU lexicon may itself be overridden.", |
| "cite_spans": [ |
| { |
| "start": 396, |
| "end": 412, |
| "text": "Karttunen (1986)", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 417, |
| "end": 431, |
| "text": "Shieber (1986)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "We now turn to some examples illustrating the r61e of defeasible inheritance in the lexicon. morpheme only in certain syntactic environments, namely when the verb is untensed or head of a verb-final clause. 9 Members of both classes share morphological, but not necessarily syntactic, properties of the verb which corresponds in form to their stem. The separable-prefix verb weglau/en ('run away') and inseparable verlau/en ('elapse') are two such verbs, which the lexicon should be able to relate to their apparent stem lau/en ('run').", |
| "cite_spans": [ |
| { |
| "start": 424, |
| "end": 434, |
| "text": "('elapse')", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Inheritance of Properties", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "Since word definitions are classes, they can be inherited from like any non-lexical class. Thus the lexical classes verlaufen and weglaufen may inherit from lanfen, itself a lexical class: x\u00b0 9Within the syntactic analysis assumed here, the distribution of verbs is controlled by a binary feature inv, whose value in these contexts is no.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Example Analyses", |
| "sec_num": "3" |
| }, |
| { |
| "text": "lea number of simplifications have been made here; ]aufen is in reality a member of a subclass of the strong verbs, and the verb class itself has been truncated, so that it accounts for only bare infinitive and first person singular present tense indicative forms. Past participle formation also interacts with the presence of separable and inseparable prefixes.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Example Analyses", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The lexical classes weglaufen and verlaufen each have two immediate superclasses, containing information connected with the prefix and stem. The classes weg and vet set the value of the morph:prefix path of the verb (overriding the value given in the main set of verb), and specify inheritance from the separable and non.separable classes respectively. The former of these unifies the variable Prefix with either the empty string (in the case of tensed 'inverted' verbs) or the value of morph : prefix (for other variants), while the latter sets the value uniquely for all forms of the verb in question. As the value of sere is fixed in the main equation set ofweglaufen and verlaufen, the corresponding equation in laufen is overridden, but Base.stem unifies with lauf. Finally, in verb, the main set supplies default values for Prefix and morph : prefix (which in the cases under consideration will not be applicable), unifies P_bs with the result of concatenating the strings Prefix and Base_stem, and for each value of syn infl assigns to form the concatenation of P_bs with the appropriate sufftx string.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Example Analyses", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Values for sere (antics) are provided in main set equations; those in weglaufen and verlaufen are thus correctly able to override that in laufen.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Example Analyses", |
| "sec_num": "3" |
| }, |
| { |
| "text": "In most cases, lexical items that realize certain morphosyntactic properties in irregular forms do not also have regular realizations of those properties; thus *sinked is not a well-formed alternative to sank or sunk, on the analogy of e.g. walked.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "English Irregular Verbs", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "This phenomenon has frequently been discussed in both theoretical and computational morphology, under the title of 'blocking', and it appears to provide clear motivation for a default-based hierarchical approach to lexical organization. 11 There are exceptions to this general rule, however, and inheritance mechanisms must be sufficiently flexible to permit deviation from the strict behaviour illustrated above.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "English Irregular Verbs", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Consider the small class of English verbs including dream, lean, learn and burn; these have, for many speakers, alternate past finite and past participle forms: e.g. dreamed and dreamt. The following fragment produces the correct pairings of strings and feature structures, the written form of the word being encoded as the value of the form llSee e.g. Calder (1989) . The main set equations in s/nk override those in its superclass verb, so that the variants in the latter class which give rise to past participle and past tensed forms associate the appropriate information with the strings sunk and sank, respectively. The class walk, on the other hand, contains nothing to pre-empt the equations in verb, and so its past forms are constructed from its value for base and the suffix string ed.", |
| "cite_spans": [ |
| { |
| "start": 353, |
| "end": 366, |
| "text": "Calder (1989)", |
| "ref_id": "BIBREF1" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "English Irregular Verbs", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "The lex/cai class dream differs from these in haying as one of its direct superclasses dual-past, which contains two variant sets, the second of which is empty (recall that variant sets are preceded by the vertical bar 'I'). Moreover, this class is more specific than the other superclass verb, and so its equations assigning to PaP_Form and P_Fin_Form the string formed by concatenating the value of base and t have precedence over the contradictory statements in the main set of verb. Note that this set also includes a disjunctive constraint to the effect that the value of morph in this FS must be either pastfinite or pastnonfinite. The dual_past class thus describes two feature IZAgain, the analysis sketched here is simplified; several variants within the verb class have been omitted, and all infleetional information is embodied as the value of the single feature morph.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "English Irregular Verbs", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "structures, but adds no information to the second. The absence of contradictory specifications permits the equations in the main set of verb to apply, in addition to those in the first variant set of dual-past. The second, empty, variant set in dual-past permits this class also to inherit all the properties of its superclass, i.e. those of regular verbs like walk; among these is that of forming the two past forms by suffixing ed to the stem, which produces the regular dreamed past forms.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "English Irregular Verbs", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "The string concatenation operator '&&' allows the lexicon writer to manipulate word forms with ELU equations and macros. In particular, &t can be used to add or remove prefixes and suE3xes, and also to effect internal modifications, such as German Umlaut, by removing a string of characters from one end, changing the remainder, and then replacing the first string. In this section we show briefly how unification, string concatenation, and defensible inheritance combine to permit the analysis of some of the numerous orthographic changes that accompany English inflectional sufftxation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Word-Form Manipulation", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "The inflectional paradigms of English nouns, verbs, and adjectives are complicated by a number of orthographic effects; big, hop, etc. undergo a doubling of the final stem character in e.g. bigger, hopped, stems such as/oz, bush, and arch take an epenthetic \u2022 before the plural or third singular present suiflx s, stem-final ie becomes y before the present participle suifL~ ing, and so on. Peripheral alternations of this kind are accomplished quite straightforwardly by macros like those in the following lexicon fragment (in which invocations of user-defined macros are introduced by ': ,):is 13As before, this is s somewhat sbbre~sted version of s full descrip~on; the verb and vo~bJpolliag classes require additional variant sets to account for other morphosyntsc~c prope~|es. Other st~ng-predicste macros, in particular OK, must be defined in order to ester for the ~ range of spelling changes observed in verbal inflee~on. The class verbJpellJ.ng contains three variant equation sets, the first two of which assign values to variables according to the form of the string which is the value of the base feature. If Final_\u00a5 is applicable, Base.P-PSP is unified with the concatenation of the second argument to the macro (e.g. tr) and is, while Base_3SG is unified with e.g. tr and i.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Word-Form Manipulation", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "String = ~reftx I~ y Prefix= &k b/c/4/~/g/h/j/k/i/m/n/p/r/s/t/v/w/x/z # Word try (verb_spe11~) <base> = try", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Word-Form Manipulation", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "If FJ.na1.Slbilant is applicable, then Base.3SG is unified with the concatenation of the value of base (e.g. watch) and e. If neither of these is applicable (because the base string does not match the patterns in the macro definitions), the variables are bound not within this class, but in the main equation set of its superc]ass verb. Here, their values are unified directly with that of base, and the eventual values of the form feature result from concatenation of the appropriate suiflx strings, giving values of watched, watches, tried, and tries.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Word-Form Manipulation", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "The lexicon system presented above is fully integrated into the ELU environment; in particular, the result of analysis and the starting point for generation is the same type of feature structure as that produced by ELU grammars, and the equa-tions within classes are of the same sort as those used elsewhere in a linguistic description, being able to exploit re-entrancy, negation, disjunction, direct manipulation of lists, etc.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Summary", |
| "sec_num": "4" |
| }, |
| { |
| "text": "For the purpose of experimenting with the structure of the class hierarchy and the distribution of information within individual classes, the lexicon is held in memory, and is accessed directly by means of an exhaustive search. Once a stable description is achieved, and the coverage of the lexicon increases, a more efficient access mechanism exists, in which possible word-forms are pre-computed, and used to index into a disk file of class definitions.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Summary", |
| "sec_num": "4" |
| }, |
| { |
| "text": "We have presented an implemented treatment of a framework for lexical description which is both practical from the perspective of efficiency and attractive in its reflection of the natural organization of a lexicon into nested and intersecting generalizations and exceptions. The system extends traditional unification with a multiple default inheritance mechanism, for which a declarative semantics is provided.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Summary", |
| "sec_num": "4" |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Defaults in Unification Grammar", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Boums", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Proceedings of the ~Sth Annual Meeting of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "165--172", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Boums, G. (1990) \"Defaults in Unification Gram- mar,\" Proceedings of the ~Sth Annual Meeting of the Association for Computational Linguis- tics, Pittsburgh, June 6th-9th. 165-172.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Paradigmatic Morphology", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Calder", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Calder, J. (1989) \"Paradigmatic Morphology,\" Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, Manchester, April 10th-12th. $8-65.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Inheritance in", |
| "authors": [ |
| { |
| "first": "W", |
| "middle": [], |
| "last": "Daelemans", |
| "suffix": "" |
| }, |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Gazdar", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Natural Language Processing: Workshop Proceedings. ITK, Tilbut8 University", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Daelemans, W. and G. Gazdar, eds. (1990) Inher- itance in Natural Language Processing: Work- shop Proceedings. ITK, Tilbut8 University.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "ELU User Manual", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Estival", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Estival, D. (1990) \"ELU User Manual\". Technical Report 1, ISSCO, Geneva.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Lexical Rules in the Hierarchical Lexicon", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [ |
| "P" |
| ], |
| "last": "Flickinger", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Flickinger, D. P. (1987) \"Lexical Rules in the Hier- archical Lexicon,\" PhD Thesis, Stanford Uni- versity.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "An Introduction to DATR", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Gasdar", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "The DATR Papers: February I990. Cognitive Science Research Paper CSRP 139, School of Cognitive and Computing Sciences", |
| "volume": "", |
| "issue": "", |
| "pages": "1--14", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gasdar, G. (1990) \"An Introduction to DATR,\" in R. Evans and G. Gasdar (eds.) The DATR Papers: February I990. Cognitive Science Re- search Paper CSRP 139, School of Cognitive and Computing Sciences, University of Sussex. 1-14.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Word Grammar", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "A" |
| ], |
| "last": "Hudson", |
| "suffix": "" |
| } |
| ], |
| "year": 1984, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hudson, R. A. (1984) Word Grammar. Oxford: Blackwell.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "A Rich Environment for Experimentation with Unification Grammars", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Johnson", |
| "suffix": "" |
| }, |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Rosner", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "Proceedings of the Fourth Conference of the European Chapter of the Association .for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "182--189", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Johnson, R. and M. Rosner (1989) \"A Rich Envi- ronment for Experimentation with Unification Grammars,\" Proceedings of the Fourth Confer- ence of the European Chapter of the Associ- ation .for Computational Linguistics, Manch- ester, April 10th-12th. 182-189.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "D-PATR: A Development Environment for Unification-Based Grammars", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Karttunen", |
| "suffix": "" |
| } |
| ], |
| "year": 1986, |
| "venue": "Proceedings of the llth lnterna. tional Conference on Computational Linguis. tics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Karttunen, L. (1986) \"D-PATR: A Development Environment for Unification-Based Gram- mars,\" Proceedings of the llth lnterna. tional Conference on Computational Linguis. tics, Bonn, August 25th-29th. 74-80.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Object-Oriented Programming in Common Lisp", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Keene", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Keene, S. (1989) Object-Oriented Programming in Common Lisp. Reading, Massachussetts: Addison-Wesley.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Classification in the KL-ONE Knowledge Representation System", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [ |
| "G" |
| ], |
| "last": "Schmolse", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [ |
| "A" |
| ], |
| "last": "Lipkis", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "Proceedings of the Eighth International Joint Conference on Artificial Intelligence", |
| "volume": "", |
| "issue": "", |
| "pages": "330--332", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Schmolse, J. G. and T. A. Lipkis (1983) \"Classifi- cation in the KL-ONE Knowledge Representa- tion System,\" Proceedings of the Eighth Inter- national Joint Conference on Artificial Intelli- gence, Karlsruhe, West Germany. 330-332.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "An Introduction to Unification-Based Approaches to Grammar", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [ |
| "M" |
| ], |
| "last": "Shieber", |
| "suffix": "" |
| } |
| ], |
| "year": 1986, |
| "venue": "CSLI Lecture Notes", |
| "volume": "", |
| "issue": "4", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shieber, S. M. (1986) An Introduction to Unifi- cation-Based Approaches to Grammar. CSLI Lecture Notes no. 4, Stanford University.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Common Lisp: The Language", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [ |
| "L" |
| ], |
| "last": "Steele", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Steele, G. L. (1990) Common Lisp: The Lan- guage (second edition). Bedford, Massachus- setts: Digital Press.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "The Mathematics of Inheritance Systems", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [ |
| "S" |
| ], |
| "last": "Touretsky", |
| "suffix": "" |
| } |
| ], |
| "year": 1986, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Touretsky, D. S. (1986) The Mathematics of Inher- itance Systems. London: Pitman Publishing.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "type_str": "figure", |
| "uris": null, |
| "num": null, |
| "text": "The global eztensio~, of a lexlcvd class having the CPL (cl,...c,) is F~, where Fo = {T}, and r,>0= U{~ IVY, ~ r,_l, \u2022 = E(~, c,)}." |
| }, |
| "FIGREF3": { |
| "type_str": "figure", |
| "uris": null, |
| "num": null, |
| "text": "" |
| }, |
| "FIGREF5": { |
| "type_str": "figure", |
| "uris": null, |
| "num": null, |
| "text": "Two macros definitions are shown here; Final_\u00a5 is true of a pair of strings String and Prefix iff String consists of Prefix followed by y and the final character of Prefix is one of the set denoted by the disjunction b/c.., z, while Final_Sibilant is true of a given string iff that string terminates in sh, ch, s, z, or z. OK is a macro which is true of only those strings to which neither Final.Sibilant nor Final_Y apply." |
| } |
| } |
| } |
| } |
