[Fwd: Re: [developers] processing of lexical rules]

[Stephan Oepen]

> But what about
> 
> orthographemics-top-rules :=
> 
> to mark final rules...

that would only seem logical, although i was thinking `bottom' as in at
the lower end of a derivation, or closer to the lexicon.  thus, when in
parsing we run these rules from form to stem, my examples were meant as
terminating a chain, i.e. be the ones that operated on stems directly.

however, when i checked in my changes last night, i abstained from this
mechanism, i.e. i did (a) to (c) only.  unless we find a need for it, i
think it is better to not add additional `ad hoc' mechanisms.  it looks
like the rule filter approach is sufficient for german for now, right?

                                                         cheers  -  oe

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+++ Universitetet i Oslo (ILF); Boks 1102 Blindern; 0317 Oslo; (+47) 2285 7989
+++     CSLI Stanford; Ventura Hall; Stanford, CA 94305; (+1 650) 723 0515
+++       --- oe at csli.stanford.edu; oe at hf.uio.no; stephan at oepen.net ---
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++