% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %
%                                                                           %
% File:            nerbonne.dtr                                             %
% Purpose:         response to Bouma & Nerbonne scepticism about recursion  %
% Author:          Gerald Gazdar (April 1995)                               %
% Email:           geraldg@cogs.sussex.ac.uk                                %
% Address:         COGS, Sussex University, Brighton BN1 9QH, UK            %
% Documentation:   see references given below                               %
% Related files:   derivatn.dtr, german_d.dtr, german_g.dtr, german_p.dtr   %
% Version:         1.00 (April 1995)                                        %
%                                                                           %
%      Copyright (c) University of Sussex 1995.  All rights reserved.       %
%                                                                           %
% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %

% Bouma & Nerbonne (1994) comment that "in spite of Kilgarriff's (1993)
% interesting work on modelling some derivational relations in the pure
% inheritance machinery of DATR, we know of no work attempting to model
% potentially recursive derivational relations, and we remain sceptical
% about relying on inheritance alone for this".  It is not clear what
% they mean by "the pure inheritance machinery of DATR" or why they
% think that someone attempting an analysis of recursive derivation in
% DATR would want to do so using pure inheritance alone (whatever that
% might mean).  But here is a trivial (and linguistically rather
% pointless) DATR analysis of the more complex of their two examples:

    Word:
        <v> == "<>"
        <a from n> == <n> + al
        <v from a> == <a> + ize
        <n from v> == <v> + tion.

    Institute:
        <> == Word
        <root> == institute.

% From this theory we can derive theorems like these:
% 
% Institute:
%   <root> = institute
%   <n from v root> = institute + tion
%   <a from n from v root> = institute + tion + al
%   <v from a from n from v root> = institute + tion + al + ize 
%   <n from v from a from n from v root> = institute + tion + al + ize + tion .
% 
% Note the recursive reintroduction of the "tion" suffix in the last
% theorem shown.


% Gosse Bouma & John Nerbonne (1994) Lexicons for feature-based
%   systems.  In Harald Trost, ed., Proceedings of KONVENS-94,
%   Vienna: Oesterreichische Gesellschaft fuer Artificial Intelligence,
%   42-51.
% 
% Adam Kilgarriff (1993) Inheriting verb alternations.  Sixth
%   Conference of the European Chapter of the Association for
%   Computational Linguistics, 213-221.

% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %

# hide Word.

# show
    <root>
    <n from v root>
    <a from n from v root>
    <v from a from n from v root>
    <n from v from a from n from v root>.

% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %

% 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 $