% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % File: english.dtr % % Purpose: English verbal morphology & subcategorization % % Author: Gerald Gazdar, 7 August 1989 % % Email: geraldg@cogs.sussex.ac.uk % % Address: COGS, Sussex University, Brighton BN1 9QH, UK % % Version: 2.01 % % Copyright (c) University of Sussex 1989. All rights reserved. % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % The following DATR theory embodies a lexical account of passive, clitic % negation, and subject-auxiliary "inversion". It includes representative % main verbs and all the English auxiliaries. The theory employs what are % in effect, CASE statements built on the SYN and MOR nodes and uses the % value of "" as the selection trigger. This technique makes % crucial use of DATR's evaluable paths and would be impossible without them. % Note,in particular, how the lexical character of the analysis makes it % possible to deal directly with the exceptional form "won't" and the first % person use of "aren't" in the verb initial construction. % THERE SEEMS TO BE A BUG IN THE HANDLING OF inf FOR VERBS OTHER THAN To1: % THE inf ATTRIBUTE SHOULD BE UNDEFINED FOR ALL OTHER VERBS. # vars $syn_form: fin inf bse prp psp. SYN: == <""> <$syn_form> == "" == "" == == "" == 'NP' == nominative. MOR:
== <""> <> == "" == "" tense "" "">" == "" neg "" tense "" "">" == "" inv "" tense "" "">" == "" neg inv "" tense "" "">" % A generalization gets missed in the four preceding statements: % further work needed. == to == "" == "". VERB: == 'V' == main == no == SYN: == AUX: == "" == MOR: == "" ed == "" == "" == "" ing == "" == "" s. AUX: <> == VERB == "" nt == aux == VPCOMP. MODAL1: <> == AUX == fin. MODAL2: <> == MODAL1 == bse == "". COMP: == . NPCOMP: <> == COMP == 'NP' == accusative. VPCOMP: <> == COMP == 'VP' == inf. EN_MOR: == VERB == "" en. BE_MOR: == EN_MOR == be == == was == were == am == is == are == nt. DO_MOR: == VERB == do == done == did == does. GET_MOR: == VERB == get == got. HAV_MOR: == VERB == had == has == have. % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % Be1: <> == AUX == BE_MOR == NPCOMP. Be2: <> == MODAL1 == BE_MOR. Be3: <> == AUX == BE_MOR == prp. Be4: <> == AUX == BE_MOR == pas. Can1: <> == MODAL2 == could == can. Come1: <> == VERB == come == came == . Dare1: <> == VERB == dare == VPCOMP. Dare2: <> == MODAL2 == yes == dare. Do1: <> == MODAL2 == DO_MOR == main. Do2: <> == VERB == DO_MOR == NPCOMP. Drink1: <> == VERB == NPCOMP == drink == drank % in reality, this is a whole class == drunk. Get1: <> == VERB == GET_MOR == NPCOMP. Get2: <> == VERB == GET_MOR == VPCOMP == pas. Go1: <> == VERB == go == went == gone. Have1: <> == AUX == HAV_MOR == psp. Have2: <> == VERB == HAV_MOR == NPCOMP. Have3: <> == AUX == HAV_MOR == NPCOMP. Have4: <> == VERB == HAV_MOR == VPCOMP. Love1: <> == VERB == love == NPCOMP. Make1: <> == VERB == make == made == NPCOMP. May1: <> == MODAL2 == might == may. Need1: <> == VERB == need == VPCOMP. Need2: <> == MODAL2 == yes == need. Ought1: <> == MODAL1 == ought == == . Sew1: <> == VERB == EN_MOR == sew == NPCOMP. Take1: <> == VERB == take == EN_MOR == took. To1: <> == MODAL2 == to == inf. Want1: <> == VERB == want == VPCOMP. Will1: <> == MODAL2 == wont == would == will. % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % Word1: <> == Love1 == pas. % Some theorems: % % Word1: = V % = main % = love ed. Word2: <> == Have1 == pres == sing == three == fin. % Some theorems: % % Word2: = V % = aux % = VP % = psp % = has. Word3: <> == Have1 == pres == sing == three == inv. % Some theorems: % % Word3: = V % = NP % = nominative % = VP % = psp % = has. Word4: <> == Be3 == pres == sing == three == neg_inv. % Some theorems: % % Word4: = V % = NP % = nominative % = VP % = prp % = is nt. Word5: <> == Be3 == pres == sing == one == neg_inv. % Some theorems: % % Word5: = V % = NP % = nominative % = VP % = prp % = are nt. % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % # hide SYN MOR VERB AUX MODAL1 MODAL2 COMP NPCOMP VPCOMP EN_MOR BE_MOR DO_MOR GET_MOR HAV_MOR. % the declarations below need extending to include inversion and clitic % negation forms. # 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 $