d in the file then an empty array is returned, causing
    the token to be discarded.  If not, the lower-cased form of the word
    is returned as the normalized lexeme.  Alternatively, the dictionary
    can be configured to report non-stop-words as unrecognized, allowing
    them to be passed on to the next dictionary in the list.
   </P
><P
>    Here is an example of a dictionary definition using the <TT
CLASS="LITERAL"
>simple</TT
>
    template:

</P><PRE
CLASS="PROGRAMLISTING"
>CREATE TEXT SEARCH DICT