% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % File: derivatn.dtr % % Purpose: English derivational morphology % % Author: Roger Evans, April 1992 % % Email: Roger.Evans@itri.bton.ac.uk % % Address: ITRI, Univ. Brighton, Lewes Road, Brighton BN2 4GJ, UK % % Related files: german_d.dtr % % Documentation: Cognitive Science Research Paper CSRP 239, Univ. Sussex % % Version: 1.03 % % % % Copyright (c) University of Sussex 1992. All rights reserved. % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % Roger Evans (1992) "Derivational morphology in DATR" in Lynne Cahill & % Richard Coates, eds. Sussex Papers in General and Computational Linguistics % Cognitive Science Research Paper CSRP 239, University of Sussex, 55-69. % % This paper presents a DATR analysis of some aspects of % English derivational morphology, and demonstrate how the % facilities of the language allow succinct description of % derivational concepts. The aim is not to present a new % theory of derivational morphology, but rather to show how % existing ideas in the field can be expressed in terms of % DATR's default and inheritance mechanisms. To this end, the % analysis is based on a single, coherent, but informal % account of the data, namely Bauer's "English Word-formation" % (Cambridge University Press, 1983). The account presented % is a description rather than a representation of % derivational morphology. This entails that representational % issues such as productivity and lexicalisation lie outside % its scope. The implications of this are discussed, and it % is suggested that such a DATR description offers a well- % defined basis for a theory of representation which does % encompass such issues. % Note that the last line of the definition of CURY in the above paper is % incorrect - the correct version appears below. % Abstract category nodes CATEGORY: == ""
== "" >" == . VERB: <> == CATEGORY == "" == "" ing == "" ed == "" er == "" able == "" ion. NOUN: <> == CATEGORY == "" == "" s == "" ous. ADJECTIVE: <> == CATEGORY == "" ity == un "" == UNDEF == UNDEF. % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % The lexeme LOVE LOVE: <> == VERB == love. % Surface forms of LOVE LOVE_BSE: <> == LOVE == bse. LOVE_PRP: <> == LOVE == prp. LOVE_PAST: <> == LOVE == past. % Some relevant extensional sentences % LOVE_BSE: = love. % LOVE_PRP: = love ing. % LOVE_PAST: = love ed. % The derived lexeme LOVER LOVER: <> == NOUN == "LOVE:<>" == . % Surface forms of LOVER LOVER_SING: <> == LOVER == sing. LOVER_PLUR: <> == LOVER == plur. % Some relevant extensional sentences % LOVE: = love % LOVER: = love er % LOVER_SING: = love er % LOVER_PLUR: = love er s % Lexemes LOVABLE and LOVABILITY LOVABLE: <> == ADJECTIVE == "LOVE:<>" == > == able . LOVABILITY: <> == NOUN == "LOVABLE:<>" == > == ity . % Recursive un-prefixation examples HAPPY: <> == ADJECTIVE == happy. UNHAPPY: <> == ADJECTIVE == "HAPPY:<>" == > == un . UNUNHAPPY: <> == ADJECTIVE == "UNHAPPY:<>" == > == un . % Semi-productivity examples REGRESS: <> == VERB == regress. CARESS: <> == VERB == caress == UNDEF. SESS: <> == VERB == sess == UNDEF == UNDEF == VERB. REGRESSION: <> == NOUN == "REGRESS:<>" == > == ion . CARESSION: <> == NOUN == "CARESS:<>" == > == ion . SESSION: <> == NOUN == "SESS:<>" == > == ion . % Blocking examples GLORY: <> == NOUN == glory. GLORIOUS: <> == ADJECTIVE == "GLORY:<>" == > == ous . GLORIOUSITY: <> == NOUN == "GLORIOUS:<>" == > == ity . CURY: <> == NOUN == cury == UNDEF == UNDEF == NOUN. CURY-OUS: <> == ADJECTIVE == "CURY:<>" == > == ous . CURIOUS: <> == "CURY-OUS:<>" == . CURIOSITY: <> == NOUN == "CURIOUS:<>" == > == ity . % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % # hide CATEGORY NOUN VERB ADJECTIVE. # show . % The next line is the Revision Control System Id: do not delete it. % $Id: archive.dtr,v 1.1 1997/04/09 20:40:33 root Exp $