
% Lexical entry to
% (1) illustrate the application of ALE Lexical Rules in TRALE and
% (2) show how PHON values can be changed with Prolog in accordance
%     to the creation of new terminals by the lexical rule (note:
%     done without using the functionality provided by tree_extensions,
%     which covers this case)
%
% Two variants of the manipulation of the PHON value in the lexical
% rule are provided
%
% IMPORTANT:
% This specification is to be used with the implementation of Chapter 8
% of Pollard and Sag (1994)


test --->  (word,
            phon:[(a_ test)],
	    synsem:loc:(cat:head:(verb,
                                 vform: base,
                                 aux: minus),
                        cont:(quants:[(a_ special)],
			      nucleus:qfpsoa)),
	    qstore:[],
	    retr:[],
            arg_st:[(loc:(cat:(head:noun,
                               subcat:[]),
                          cont:index:it))]).



test_lex_rule lex_rule
(word,      phon:[(a_ Phon)],
	    synsem:loc:(cat:head:(Verb,
				 verb,
                                 vform: base,
                                 pred: plus,
                                 aux: minus),
                        cont:(quants:[(a_ special)],
			      nucleus:qfpsoa)))
 **>
(word, phon:[(a_ NewPhon)],
 synsem:loc:(cat:head:Verb,
	     cont:(quants:[],
	     nucleus:qfpsoa)))
if prolog(atom_concat(Phon,s,NewPhon))
%if prolog((atom_chars(Phon,List), append(List,[115],NList),
%	   name(NewPhon,NList)))  % use char_code(Char,Code) to find integer
morphs
X becomes (X,s).