Derivation without lexical rules

In Krieger and Nerbonne (1992) we showed how to get rid of LEXICAL RULES for DERIVATION, as they are explicated by Pollard and Sag (1987) in HPSG I, Ch. 8.2. We proposed a treatment of derivation not by means of traditional lexical rules but instead in terms of PRINCIPLES, RULES, and LEXICAL ENTRIES entirely in the spirit of HPSG, together with unification-based inheritance of a very sophisticated kind. One major disadvantage of this approach was the employment of complex functions in certain principles. In this paper I first extend the old approach and then show how to eliminate these functional dependencies in the domain of derivational morphology by going back to simpler ones like cons, first, and rest. But this simplification is only achieved if we assume more complex feature structures than the ones described in Krieger and Nerbonne (e.g., by introducing two different SUBCAT features) and by proposing modified versions of the old Constituent Order Principle and the Subcategorization Principle for morphology. In addition, I postulate a hierarchy of affixes which is cross-classified, for instance, according to the effects these affixes contribute to the subcategorization information of a compound word. The structure of the paper is as follows. We start with a very short introduction about the residence of word-formation rules in modern feature-based theories. After that we present our approach to derivational morphology which is distinguished in that it gives up the notion of lexical rule as a single entity (operator). We describe the structure of affixes and words (e.g., which attributes are appropriate?) and introduce the relevant principles and the rule schema of our approach to derivational morphology. The section shows how to reduce functional dependencies to a minimum at the cost of the size of our feature structures. We also present a technique which allows us to state relational dependencies as they are called by HPSG in a functional manner. In the next section we show how the whole treatment works by applying it to tough phenomena from prefixation and suffixation. The section presents many examples, which might serve as a how to guide to a practitioner. After that we explain the idea which will lead us to the affix hierarchy. We will see that the affix hierarchy is inspired by the work of HPSG on structured lexicons (i.e., by the hierarchy of lexical types). A lot of examples will again be given throughout this section. We finish the paper by summarizing our approach and by saying a few words about the topics which we will tackle next.

[1]  J.F.A.K. van Benthem,et al.  "Situations, Language and Logic" , 1987 .

[2]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Information and Computation.

[3]  D. Flickinger Lexical rules in the hierarchical lexicon , 1989 .

[4]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .

[5]  Kimmo Koskenniemi,et al.  A General Computational Model for Word-Form Recognition and Production , 1984, ACL.

[6]  Jack Hoeksema Categorial Morphology (Rle Linguistics B: Grammar) , 1985 .

[7]  Hassan Aït-Kaci,et al.  An Algebraic Semantics Approach to the Effective Resolution of Type Equations , 1986, Theor. Comput. Sci..

[8]  Gert Smolka Residuation and Guarded Rules for Constraint Logic Programming , 1991, WCLP.

[9]  Walter Daelemans,et al.  Inheritance in Natural Language Processing , 1992, Comput. Linguistics.

[10]  Gosse Bouma Feature Structures and Nonmonotonicity , 1992, Comput. Linguistics.

[11]  Bob Carpenter,et al.  Inclusion, Disjointness and Choice: The Logic of Linguistic Classification , 1991, ACL.

[12]  Gert Smolka,et al.  A Feature Logic with Subsorts , 1988, LILOG-Report.

[13]  Walt Detmar Meurers,et al.  Word Formation in Lexical Type Hierarchies { a Case Study of Bar-adjectives in German { , 1993 .

[14]  Ronald M. Kaplan,et al.  The Interface between Phrasal and Functional Constraints , 1993, Comput. Linguistics.

[15]  Jo Calder Feature-value Logics: Some Limits on the Role of Defaults , 1994 .

[16]  Gert Smolka,et al.  Feature-Constraint Logics for Unification Grammars , 1989, J. Log. Program..

[17]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[18]  Mark Aronoff,et al.  Word Formation in Generative Grammar , 1979 .

[19]  Steven Bird,et al.  Finite-State Phonology in HPSG , 1992, COLING.

[20]  Ivan A. Sag,et al.  Information-based syntax and semantics , 1987 .

[21]  John A. Carroll,et al.  Multiple Default Inheritance in a Unification-Based Lexicon , 1991, ACL.

[22]  Stuart M. Shieber,et al.  Prolog and Natural-Language Analysis , 1987 .

[23]  Dan Flickinger,et al.  Structure-Sharing in Lexical Representation , 1985, ACL.

[24]  Hans-Ulrich Krieger,et al.  Feature-based inheritance networks for computational lexicons , 1994 .

[25]  Stephen G. Pulman,et al.  A Computational Framework for Lexical Description , 1987, Comput. Linguistics.

[26]  Gert Smolka,et al.  Inheritance Hierarchies: Semantics and Unification , 1989, J. Symb. Comput..

[27]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[28]  Lauri Karttunen,et al.  D-PATR: A Development Environment for Unification-Based Grammars , 1986, COLING.

[29]  M. Baltin,et al.  The Mental representation of grammatical relations , 1985 .

[30]  B. Carpenter Skeptical and credulous default unification with applications to templates and inheritance , 1994 .

[31]  Fernando Pereira,et al.  The Formalism and Implementation of PATR-II , 1983 .